Generating efficient tiled code for distributed memory machines

Parallel Computing

Volumn 26, Issue 11, 2000, Pages 1369-1410

  Tang, Peiyi ^a   Xue, Jingling ^b  

^a UNIVERSITY OF SOUTHERN QUEENSLAND   (Australia)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Distributed memory; Machines; Memory optimisations; Nested loops; SPMD; Tiling

Indexed keywords

EID: 0000778059     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-8191(00)00040-5     Document Type: Article

References (41)

1. R. Andonov, S. Rajopadhye, Optimal tiling of two-dimensional uniform recurrences, Technical Report 97-01, LIMAV, Université de Valenciennes, January 1997.
2. S. Benkner, B.M. Chapman, H.P. Zima, Vienna Fortran 90, in: Scalable High Performance Computing Conference, April 1992, pp. 51-59.
3. V. Bouchitté, P. Boulet, A. Darte, Y. Robert, Evaluating array expressions on massively parallel machines with commmuication/computation overlap, Int. J. Supercomputer Appl. High Performance Computing 9 (3) (1995) 205-219.
4. P.Y. Calland, A. Darte, Y. Robert, F. Vivien, On the removal of anti and output dependences, Technical Report 96-04, Ecole Normale Supérieure de Lyon, February 1996.
5. P.Y. Calland, J. Dongarra, Y. Robert, Tiling with limited resources, Technical Report 97, Ecole Normale Supérieure de Lyon, February 1997.
6. S. Carr, K. Kennedy, Compiler blockability of numerical algorithms, in: Supercomputing'92, Minneapolis, Minnesota, November 1992, pp. 114-124.
7. L. Carter, J. Ferrante, S. Flynn Hummel, Efficient parallelism via hierarchical tiling, in: SIAM Conference on Parallel Processing for Scientific Programming, New York, 1995.
8. S. Chatterjee, J.R. Gilbert, F.J.E. Long, R. Schreiber, S.-H. Teng, Generating local addresses and communication sets for data-parallel programs, in: Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, California, May 1993, pp. 149-158.
9. S. Chen, J. Xue, Issues of tiling double loops on distributed memory machines, in: Proceedings of the Fifth Australian Parallel and Real-Time Systems, 1998, pp. 377-388.
10. Y.-S. Chen, S.-D. Wang, C.-M. Wang, Tiling nested loops into maximal rectangular blocks, J. Parallel Distributed Computing 35 (2) (1996) 108-120.
11. F. Coelho, C. Germain, J.L. Pazat, State of the art in compiling HPF, in: G.R. Perrin, A. Darte (Eds.), Data Parallel Programing Model: Foundations, HPF Realization and Scientific Applications, Lecture Notes in Computer Science 1132, North-Holland, Amsterdam, 1996, pp. 659-664.
12. J.-F. Collard, T. Risset, P. Feautrier, Construction of DO loops from systems of affine constraints, Technical Report 93-15, Ecole Normale Supérieure de Lyon, May 1993.
13. A. Darte, F. Vivien, Combining retiming and scheduling techniques for loop parallelization and loop tiling, Technical Report 96-34, Ecole Normale Supérieure de Lyon, November 1996.
14. P. Feautrier, Dataflow analysis for array and scalar references, Int. J. Parallel Programming 20 (1) (1991) 23-53.
15. M. Gerndt, Updating distributed variables in local computations, Concurrency: Practice and Experience 2 (3) (1990) 171-193.
16. G. Goff, K. Kennedy, C.-W. Tseng, Practical dependence testing, in: ACM SIGPLAN'91 Conference on Programming Language Design and Implementation, Toronto, June 1991, pp. 15-29.
17. J. Gu, Z. Li, G. Lee, Symbolic array dataflow analysis for array privatization and program parallelization, in: Supercomputing'95, ACM Press, New York, 1995.
18. S.K.S. Gupta, S.D. Kaushik, S. Mufti, S. Sharma, C.-H. Huang, P. Sadayappan, On compiling array expressions for efficient execution on distributed-memory machines, in: 1993 International Conference on Parallel Processing, vol. II, St. Charles, Illinois, August 1993, pp. 301-305.
19. S. Hiranandani, K. Kennedy, C.W. Tseng, Compiling Fortran D for MIMD distributed memory machines, Commun. ACM 35 (8) (1992) 66-80.
20. F. Irigoin, R. Triolet, Supernode partitioning, in: 15th Annual ACM Symposium on Principles of Programming Languages, San Diego, California, January 1988, pp. 319-329.
21. C. Koelbel, Compile-time generation of regular communication patterns, in: Supercomputing'91, ACM Press, New York, 1991, pp. 101-110.
22. C.H. Koelbel, D.B. Loveman, R.S. Schreiber, G.L. Steele Jr., M.E. Zosel, The High Performance Fortran Handbook, The MIT Press, Cambridge, MA, 1994.
23. M.S. Lam, E.E. Rothberg, M.E. Wolf, The cache performance and optimizations of blocked algorithms, in: Second International Conference on Architectural Support for Programming Languages and Operating Systems, Santa Clara, California, April 1991, pp. 63-74.
24. V. Lefebvre, P. Feautrier, Optimizing storage size for static control programs in automatic parallelizers, in: European Parallel Processing Conference, 1997.
25. N. Mitchell, L. Carter, J. Ferrante, K. Hogstedt, Quantifying the multi-level nature of tiling interactions, Int. J. Parallel Programming 26 (26) (1998) 641-670.
26. H. Ohta, Y. Saito, M. Kainaga, H. Ono, Optimal tile size adjustment in compiling for general DOACROSS loop nests, in: 1995 ACM International Conference on Supercomputing, ACM Press, New York, 1995, pp. 270-279.
27. D.A. Padua, M.J. Wolfe, Advanced compiler optimizations for supercomputers, Commun. ACM 29 (12) (1986) 1184-1201.
28. W. Pugh, The Omega test: a fast and practical integer programming algorithm for dependence analysis, Commun. ACM 35 (8) (1992) 102-114.
29. J. Ramanujam, P. Sadayappan, Tiling multidimensional iteration spaces for multicomputers, J. Parallel Distributed Computing 16 (2) (1992) 108-230.
30. R. Schreiber, J.J. Dongarra, Automatic blocking of nested loops, Technical Report 90.38, RIACS, May 1990.
31. A. Schrijver, Theory of Linear and Integer Programming Series in Discrete Mathematics, Wiley, New York, 1986.
32. W. Shang, J.A.B. Fortes, Independent partitioning of algorithms with uniform dependencies, IEEE Trans. Comput. 41 (2) (1992) 190-206.
33. P. Tang, J.N. Zigman, Reducing data communication overhead for DOACROSS loop nests, in: ACM International Conference on Supercomputing, ACM Press, New York, 1994, pp. 44-53.
34. A. Thirumalai, J. Ramanujam, Fast address sequence generation for data-parallel programs using integer lattices, in: Ninth Workshop on Languages and Compilers for Parallel Computing, August 1996, pp. 291-301.
35. M.E. Wolf, M.S. Lam, data locality optimizing algorithm, in: ACM SIGPLAN'91 Conference on Programming Language Design and Implementation, Toronto, Ontario, June 1991, pp. 30-44.
36. M.E. Wolf, M.S. Lam, A loop transformation theory and an algorithm to maximize parallelism, IEEE Trans. Parallel Distributed Systems 2 (4) (1991) 452-471.
37. M.J. Wolfe, High Performance Compilers for Parallel Computing, Addison-Wesley, Reading, MA, 1996.
38. J. Xue, Communication-minimal tiling of uniform dependence loops, J. Parallel Distributed Computing 42 (1) (1997) 42-59.
39. J. Xue, On tiling as a loop transformation, Parallel Process. Lett. 7 (4) (1997) 409-424.
40. J. Xue, C.-H. Huang, Reuse-driven tiling for data locality, Int. J. Parallel Programming 26 (6) (1998) 671-696.
41. J.N. Zigman, P. Tang, Implementing global address space in distributed memory machines, Technical Report TR-CS-94-10, Department of Computer Science, The Australian National University, October 1994.