
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
JennYang Ke, JongChuang Tsay, "An Approach to Checking Link Conflicts in the Mapping of Uniform Dependence Algorithms into Lower Dimensional Processor Arrays," IEEE Transactions on Computers, vol. 48, no. 7, pp. 732737, July, 1999.  
BibTex  x  
@article{ 10.1109/12.780880, author = {JennYang Ke and JongChuang Tsay}, title = {An Approach to Checking Link Conflicts in the Mapping of Uniform Dependence Algorithms into Lower Dimensional Processor Arrays}, journal ={IEEE Transactions on Computers}, volume = {48}, number = {7}, issn = {00189340}, year = {1999}, pages = {732737}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.780880}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  An Approach to Checking Link Conflicts in the Mapping of Uniform Dependence Algorithms into Lower Dimensional Processor Arrays IS  7 SN  00189340 SP732 EP737 EPD  732737 A1  JennYang Ke, A1  JongChuang Tsay, PY  1999 KW  Uniform dependence algorithms KW  lower dimensional arrays KW  spacetime mapping KW  link conflict KW  mixed integer linear programming KW  Hermite normal form KW  Smith normal form. VL  48 JA  IEEE Transactions on Computers ER   
Abstract—In this paper, we propose an enumeration method to check link conflicts in the mapping of
[1] H.T. Kung, “Why Systolic Architectures?,” Computer, vol. 15, no. 1, pp. 3746, Jan. 1982.
[2] S.Y. Kung, VLSI Array Processors. Prentice Hall, 1988.
[3] W. Shang and J.A.B. Fortes, "Time Optimal Linear Schedules for Algorithms with Uniform Dependencies," IEEE Trans. Computers, vol. 40, June 1991.
[4] P.R. Cappello and K. Steiglitz, “Unifying VLSI Array Designs with Geometric Transformations,” Proc. Int'l Conf. Parallel Processing, pp. 448457, 1983.
[5] C. Guerra and R. Melhem, “Synthesizing NonUniform Systolic Designs,” Proc. Int'l Conf. Parallel Processing, pp. 765771, 1986.
[6] R. Karp, R. Miller, and S. Winograd, "The Organization of Computations for Uniform Recurrence Equations," J. ACM, vol. 14, July 1967.
[7] G.J. Li and B.W. Wah, “The Design of Optimal Systolic Arrays,” IEEE Trans. Computers, vol. 34, no. 1, pp. 6677, Jan. 1985.
[8] D.I. Moldovan and J.A.B. Fortes, “Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays,” IEEE Trans. Computers, vol. 35, no. 1, pp.112, Jan. 1986.
[9] P. Quinton, “Automatic Synthesis of Systolic Arrays from Uniform Recurrent Equations,” Proc. 11th Ann. Int'l Symp. Computer Architecture, pp. 208214, June 1984.
[10] S.K. Rao,“Regular iterative algorithms and their implementations on processor arrays,” PhD thesis, Stanford Univ., 1985.
[11] L. Lamport, "The Parallel Execution of DO Loops," Comm. ACM, vol. 17, Feb. 1974.
[12] J.A.B. Fortes and F. ParisiPresicce, “Optimal Linear Schedules for the Parallel Execution of Algorithms,” Proc. Int'l Conf. Parallel Processing, pp. 322329, 1984.
[13] P.Z. Lee and Z.M. Kedem, “Mapping Nested Loop Algorithms into Multidimensional Systolic Arrays,” IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 1, pp. 6476, Jan. 1990.
[14] P.Z. Lee and Z.M. Kedem,“Synthesizing linear array algorithms from nested for loop algorithms,” IEEE Trans. Computers, vol. 37, pp. 1,5781,598, Dec. 1988.
[15] W. Shang and J.A.B. Fortes, "On Time Mapping of Uniform Dependence Algorithms into Lower Dimensional Processor Arrays," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp. 350363, May 1992.
[16] J. Xue, “Avoiding Data Link and Computational Conflicts in Mapping Nested Loop Algorithms to LowerDimensional Processor Arrays,” Proc. Int'l Conf. Parallel and Distributed Systems, pp. 567572, 1994.
[17] J. Xue, “ClosedForm Mapping Conditions for the Synthesis of Linear Processor Arrays,” J. VLSI Signal Processing, vol. 10, pp. 181199, 1995.
[18] J. Xue, “A Unified Approach to Checking Data Link and Computational Conflicts in the Design of AlgorithmSpecific Processor Arrays,” Technical Report 94100, Dept. of Mathematics, Statistics, and Computing Science, Univ. of New England, 1994.
[19] K. Ganapathy and B.W. Wah, "Optimal Synthesis of AlgorithmSpecific LowerDimensional Processor Arrays," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 3, pp. 274287, Mar. 1996.
[20] K.N. Ganapathy and B.W. Wah, “Synthesizing Optimal Lower Dimensional Processor Arrays,” Proc. Int'l Conf. Parallel Processing, pp. III. 96III. 103, 1992.
[21] A. Schrijver, Theory of Linear and Integer Programming. John Wiley, 1986.
[22] R. Kannan and A. Bachem, “Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix,” SIAM J. Computing, vol. 8, no. 4, pp. 499507, 1979.
[23] T.C. Hu, Integer Programming and Network Flows. AddisonWesley, 1969.
[24] J.A.B. Fortes, B.W. Wah, W. Shang, and K.N. Ganapathy, “AlgorithmSpecific Parallel Processing with Linear Processor Arrays,” Advances in Computers, M. Yovits, ed. Academic Press, 1993.
[25] V. Van Dongen and P. Quinton,“Uniformization of linear recurrence equations: A step towards the automatic synthesis of systolic arrays,” Proc. Int’l Conf. Systolic Arrays, pp. 473482, 1988.