A Characterization of One-to-One Modular Mappings

In this paper, we deal with modular mappings as introduced by Lee and Fortes [15,14,13], and we build upon their results. Our main contribution is a characterization of one-to-one modular mappings that is valid even when the source domain and the target domain of the transformation have the same size but not the same shape. This characterization is constructive, and a procedure to test the injectivity of a given transformation is presented.

[1]  Peter Christy,et al.  Software to support massively parallel computing on the MasPar MP-1 , 1990, Digest of Papers Compcon Spring '90. Thirty-Fifth IEEE Computer Society International Conference on Intellectual Leverage.

[2]  Weijia Shang,et al.  Time Optimal Linear Schedules for Algorithms with Uniform Dependencies , 1991, IEEE Trans. Computers.

[3]  S. Kung,et al.  VLSI Array processors , 1985, IEEE ASSP Magazine.

[4]  Hyuk-Jae Lee,et al.  On the injectivity of modular mappings , 1994, Proceedings of IEEE International Conference on Application Specific Array Processors (ASSAP'94).

[5]  Tom Blank,et al.  The MasPar MP-1 architecture , 1990, Digest of Papers Compcon Spring '90. Thirty-Fifth IEEE Computer Society International Conference on Intellectual Leverage.

[6]  M. O'Boyle,et al.  Data alignment: transformations to reduce communication on distributed memory architectures , 1992, Proceedings Scalable High Performance Computing Conference SHPCC-92..

[7]  Yves Robert,et al.  Constructive Methods for Scheduling Uniform Loop Nests , 1994, IEEE Trans. Parallel Distributed Syst..

[8]  J. Fortes,et al.  Dist a distribution independent parallel programs for matrix multiplication , 1994 .

[9]  Franco P. Preparata,et al.  Area-Time Optimal VLSI Networks for Multiplying Matrices , 1980, Inf. Process. Lett..

[10]  Yves Robert,et al.  Mapping Uniform Loop Nests Onto Distributed Memory Architectures , 1993, Parallel Comput..

[11]  José A. B. Fortes,et al.  Modular mappings of rectangular algorithms , 1994 .

[12]  P. Feautrier.  Some Eecient Solutions to the Aane Scheduling Problem Part I One-dimensional Time , 1996 .

[13]  Monica S. Lam,et al.  A Loop Transformation Theory and an Algorithm to Maximize Parallelism , 1991, IEEE Trans. Parallel Distributed Syst..

[14]  Patrice Quinton,et al.  Systolic algorithms and architectures , 1987 .

[15]  Dan I. Moldovan,et al.  Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays , 1986, IEEE Transactions on Computers.

[16]  Monica S. Lam,et al.  Global optimizations for parallelism and locality on scalable parallel machines , 1993, PLDI '93.

[17]  Georg Hajós,et al.  Über einfache und mehrfache Bedeckung desn-dimensionalen Raumes mit einem Würfelgitter , 1942 .