This Article 
 Bibliographic References 
 Add to: 
A General Methodology of Partitioning and Mapping for Given Regular Arrays
October 1995 (vol. 6 no. 10)
pp. 1100-1107

Abstract—A methodology for partitioning and mapping of arbitrary uniform recurrence equations (UREs) expressed as computation graphs onto a given regular array is proposed. Deriving and based on a set of canonical dependencies together with two models of space projection, we give a general method of parallelization. The method has significant advantages in mapping an arbitrary computation graph onto a given processor array while preserving high efficiency in both communication and computation.

[1] A. Darte,“Regular partitioning for synthesizing fixed-size systolic array,” J. VLSI Integration, vol. 12, pp. 293-304 1991.
[2] F. Irigoin and R. Triolet, “Supernode Partitioning,” Proc. 15th ACM Symp. Principles of Programming Languages, pp. 319-329, Jan. 1988.
[3] L. Lamport, "The Parallel Execution of DO Loops," Comm. ACM, vol. 17, Feb. 1974.
[4] C.-T. King, W.-H. Chou, and L.M. Ni, "Pipelined Data-Parallel Algorithms: Part II-Design," IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 4, pp. 486-499, Oct. 1990.
[5] S.Y. Kung, VLSI Array Processors. Prentice Hall, 1988.
[6] 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.1-12, Jan. 1986.
[7] P. Quinton and V. Van Dongen,“The mapping of linear recurrence equations on regular arrays,” J. VLSI Signal Processing, vol. 1, pp. 95-113, 1989.
[8] P. Quinton, “Automatic Synthesis of Systolic Arrays from Uniform Recurrent Equations,” Proc. 11th Ann. Int'l Symp. Computer Architecture, pp. 208-214, June 1984.
[9] M. Wolf and M. Lam, “A Loop Transformation Theory and an Algorithm to Maximize Parallelism,” IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 4, Oct. 1991.
[10] M. Wolfe, “More Iteration Space Tiling,” Proc. Supercomputing '89, pp. 655-664, Nov. 1989.
[11] M. Wolfe,“Optimizing Supercompilers For Supercomputers.”Cambridge, MA: MIT, 1989.
[12] X. Zhong and S. Rajopadhye,“Quasi-linear allocation function for efficient array design,” J. VLSI Signal Processing, vol. 4, pp. 97-110, 1992.
[13] X. Chen and G.M. Megson,“A methodology of partitioning and mapping for fixed-shape and given-mesh regular array,” Tech. Rep., Univ. of Newcastle upon Tyne, 1993.
[14] G.M. Megson,X. Chen,“A survey and analysis of partitioning and mapping methods for regular arrays,” submitted for publication, 1993.

Index Terms:
Algorithm transformation, automatic compilation, given-shape and fixed-mesh partitioning, uniform recurrence equation.
Xian Chen, Graham M. Megson, "A General Methodology of Partitioning and Mapping for Given Regular Arrays," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 10, pp. 1100-1107, Oct. 1995, doi:10.1109/71.473518
Usage of this product signifies your acceptance of the Terms of Use.