Compiling affine nested loops: How to optimize the residual communications after the alignment phase

Journal of Parallel and Distributed Computing

Volumn 38, Issue 2, 1996, Pages 176-187

  Dion, Michèle ^a   Randriamaro, Cyril ^a   Robert, Yves ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030295490     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0139     Document Type: Article

References (25)

1. 1. Jennifer M. Anderson and Monica S. Lam, Global optimizations for parallelism and locality on scalable parallel machines. ACM Sigplan Notices 28(6), 112-125 (June 1993).
2. 2. David Bau, Induprakas Kodukula, Vladimir Kotlyar, Keshav Pingali, and Paul Stodghill, Solving alignment using elementary linear algebra. In Pingali, K., Banerjee, U., Gelernter, D., Nicolau, A., and Padua, D. (Eds.). Languages and Compilers for Parallel Computing - 7th International Workshop. Lecture Notes in Computer Science, Vol. 892, pp. 46-60. Springer-Verlag, Berlin/New York, 1994.
3. 3. J. W. S. Cassels, Rational Quadratic Forms. Academic Press, New York, 1978.
4. 4. Tzung-Shi Chen and Jang-Ping Sheu, Communication-free data allocation techniques for parallelizing compilers on multicomputers. IEEE Trans. Parallel Distrib. Systems 5(9), 924-938 (1994).
5. 5. Alain Darte and Yves Robert, Mapping uniform loop nests onto distributed memory architectures. Parallel Comput. 20, 679-710 (1994).
6. 6. Alain Darte and Yves Robert, On the alignment problem. Parallel Process. Lett. 4(3), 259-270 (1994).
7. 7. Michèle Dion, Cyril Randriamaro, and Yves Robert, How to optimize residual communications? Research Report 95-27, Ecole Normale Supérieure de Lyon, Oct. 1995.
8. 8. Michèle Dion and Yves Robert, Mapping affine loop nests: New results. In Hertzberger, B., and Serazzi, G. (Eds.). High-Performance Computing and Networking, International Conference and Exhibition. Lecture Notes in Computer Science, Vol. 919, pp. 184-189. Springer-Verlag, Berlin/New York, 1995. Extended version available as Technical Report 94-30, LIP, ENS Lyon (anonymous ftp to lip.ens-lyon.fr).
9. 9. J. R. Evans and E. Minieka, Optimization Algorithms for Networks and Graphs. Dekker, New York, 1992.
10. 10. Paul Feautrier, Some efficient solutions to the affine scheduling problem, part II, multidimensional time. Internat. J. Parallel Programming 21(6), 389-420 (Dec. 1992).
11. 11. Paul Feautrier, Towards automatic distribution. Parallel Process. Lett. 4(3), 233-244 (1994).
12. 12. Hans Michael Gerndt, Automatic parallelization for distributed-memory multiprocessing systems. Ph.D. thesis, Univ. of Bonn, 1989.
13. 13. Gene H. Golub and Charles F. Van Loan, Matrix Computations, 2nd ed. Johns Hopkins, Baltimore, 1989.
14. 14. Erich Hecke, Lectures on the Theory of Algebraic Numbers. Springer-Verlag, Berlin/New York, 1981.
15. 15. C. H. Huang and P. Sadayappan, Communication-free hyperplane partitioning of nested loops. In Banerjee, Gelernter, Nicolau, and Padua (Eds.). Languages and Compilers for Parallel Computing, Lecture Notes in Computer Science, Vol. 589, pp. 186-200. Springer-Verlag, Berlin/New York, 1991.
16. 16. Kathleen Knobe, Joan D. Lukas, and Guy L. Steele, Data optimization: Allocation of arrays to reduce communication on SIMD machines. J. Parallel Distrib. Comput. 8, 102-118 (1990).
17. 17. A. Korganoff and M. Pavel-Parvu, Eléments de théorie des matrices carrées et rectangles en analyse numérique. Dunod, Paris, 1966 [In French]
18. 18. Jingke Li and Marina Chen, The data alignment phase in compiling programs for distributed memory machines. J. Parallel Distrib. Comput. 13, 213-221 (1991).
19. 19. Joan D. Lukas, Data locality for shared memory. In Sixth SIAM Conf. Parallel Processing for Scientific Computing, Vol. 2, pp. 836-839. SIAM Press, Philadelphia, 1993.
20. 20. Joan D. Lukas and Kathleen Knobe, Data optimization and its effect on communication costs in MIMD fortran code. In Dongarra, Kennedy, Messina, Sorensen, and Voigt (Eds.). Fifth SIAM Conf. Parallel Processing for Scientific Computing, pp. 478-483. SIAM Press, Philadelphia, 1992.
21. 21. Morris Newman, Integral Matrices. Academic Press, New York, 1972.
22. 22. Alexis Platonoff, Contribution à la Distribution Automatique des Données pour Machines Massivement Parallèles. Ph.D. thesis, École Nationale Supérieure des Mines de Paris, Mar. 1995.
23. 23. W. Shang and Z. Shu, Data alignment of loop nests without nonlocal communications. In Application Specific Array Processors, pp. 439-450. IEEE Computer Society Press, Los Alamitos, CA, 1994.
24. 24. Chau-Wen Tseng, An Optimizing Fortran D Compiler for MIMD Distributed-Memory Machines. Ph.D. thesis, Rice Univ., 1993.
25. 25. Michael Wolfe, The Tiny loop restructuring research tool. In Schwetman, H. D. (Ed.). International Conference on Parallel Processing, Vol. II, pp. 46-53. CRC Press, Boca Raton, FL, 1991.