Affine Dependence Classification for Communications Minimization

This paper introduces results on placement and communications minimization for systems of affine recurrence equations. We show how to classify the dependences according to the number and nature of communications they may result in. We give both communication-free conditions and conditions for an efficient use of broadcast or neighbor-to-neighbor communication primitives. Since the dependences of a problem can generally not be all communication-free, we finally introduce a heuristic to globally minimize the communications based on the classification of dependences.

[1]  Yves Robert,et al.  How to optimize residual communications? , 1996, Proceedings of International Conference on Parallel Processing.

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

[3]  Weijia Shang,et al.  Data alignment of loop nests without nonlocal communications , 1994, Proceedings of IEEE International Conference on Application Specific Array Processors (ASSAP'94).

[4]  P. Feautrier.  Compiling for Massively Parallel Architectures , 1995 .

[5]  Yves Robert,et al.  On the Alignment Problem , 1994, Parallel Process. Lett..

[6]  Michael Gerndt,et al.  SUPERB: A tool for semi-automatic MIMD/SIMD parallelization , 1988, Parallel Comput..

[7]  Alexis Platonoff.  Contribution à la distribution automatique des données pour machines massivement parallèles , 1995 .

[8]  Paul Feautrier.  Compiling for massively parallel architectures: a perspective , 1995, Microprocess. Microprogramming.

[9]  C. Mongenet.  Informatique Et Calcul Parall Ele De Strasbourg Data Compiling for Systems of Aane Recurrence Equations , 2007 .

[10]  Catherine Mongenet.  Mappings for communication minimization using distribution and alignment , 1995, PACT.

[11]  Philippe Clauss,et al.  Geometrical tools to map systems of affine recurrence equations on regular arrays , 1994, Acta Informatica.

[12]  Rudolf Eigenmann,et al.  Automatic program parallelization , 1993, Proc. IEEE.

[13]  Saman Amarasinghe,et al.  The suif compiler for scalable parallel machines , 1995 .

[14]  Paul Feautrier.  Toward Automatic Distribution , 1994, Parallel Process. Lett..

[15]  Manish Gupta,et al.  A methodology for high-level synthesis of communication on multicomputers , 1992, ICS '92.

[16]  J. Ramanujam,et al.  Compile-Time Techniques for Data Distribution in Distributed Memory Machines , 1991, IEEE Trans. Parallel Distributed Syst..

[17]  B. Welch.  The structure , 1992 .

[18]  Yves Robert,et al.  Mapping affine loop nests: new results , 1995, HPCN Europe.

[19]  Patrice Quinton,et al.  The mapping of linear recurrence equations on regular arrays , 1989, J. VLSI Signal Process..

[20]  P. Sadayappan,et al.  Communication-Free Hyperplane Partitioning of Nested Loops , 1991, LCPC.

[21]  Peter R. Cappello,et al.  Converting affine recurrence equations to quasi-uniform recurrence equations , 1995, J. VLSI Signal Process..

[22]  Vincent Loechner,et al.  Solutions to the Communication Minimization Problem for Affine Recurrence Equations , 1997, Euro-Par.