Message-passing code generation for non-rectangular tiling transformations

Parallel Computing

Volumn 32, Issue 10, 2006, Pages 711-732

  Goumas, Georgios ^a   Drosinos, Nikolaos ^a   Athanasaki, Maria ^a   Koziris, Nectarios ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

Clusters; Code generation; Data parallel; Loop tiling; MPI

Indexed keywords

DATA STORAGE EQUIPMENT; ITERATIVE METHODS; OPTIMIZATION; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS;

CODE GENERATION; COMMUNICATION PATTERN; LOOP TILING; PARALLEL CODE;

DISTRIBUTED DATABASE SYSTEMS;

EID: 33750629461     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2006.07.003     Document Type: Article

References (31)

1. D'Acunto B. Computational Methods for Pde in Mechanics (2004), World Scientific Publ.
2. Adve V., and Mellor-Crummey J. Advanced code generation for high performance Fortran. Compiler Optimizations for Scalable Parallel Systems: Languages, Compilation Techniques, and Run Time Systems. Lecture Notes in Computer Science Series (2001), Springer-Verlag 553-596
3. S.P. Amarasinghe, M.S. Lam, Communication optimization and code generation for distributed memory machines, in: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, Albuquerque, New Mexico, USA, June 1993.
4. R. Andonov, P. Calland, S. Niar, S. Rajopadhye, N. Yanev, First steps towards optimal oblique tile sizing, in: Proceedings of the 8th International Workshop on Compilers for Parallel Computers, Aussois, January 2000, pp. 351-366.
5. Andronikos T., Koziris N., Papakonstantinou G., and Tsanakas P. Optimal scheduling for UET/UET-UCT generalized N-dimensional grid task graphs. Journal of Parallel and Distributed Computing 57 2 (1999) 140-165
6. Boulet P., Darte A., Risset T., and Robert Y. (Pen)-ultimate tiling?. INTEGRATION The VLSI Journal 17 (1994) 33-51
7. Calland P.Y., Darte A., Robert Y., and Vivien F. On the removal of anti and output dependences. International Journal of Parallel Programming 26 2 (1998) 285-312
8. Chapman B., Mehrotra P., and Zima H. Programming in Vienna Fortran. Scientific Programming 1 1 (1992) 31-50
9. Desprez F., Dongarra J., Rastello F., and Robert Y. Determining the idle time of a tiling: new results. Journal of Information Science and Engineering 14 1 (1997) 167-190
10. D'Hollander E.H. Partitioning and labeling of loops by unimodular transformations. IEEE Transactions on Parallel and Distributed Systems 3 4 (1992) 465-476
11. G. Fox, S. Hiranandani, K. Kennedy, C. Koelbel, U. Kremer, C. Tseng, M. Wu, Fortran-D language specification, Technical Report TR-91-170, Department of Computer Science, Rice University, December 1991.
12. Goumas G., Athanasaki M., and Koziris N. An efficient code generation technique for tiled iteration spaces. IEEE Transactions on Parallel and Distributed Systems 14 10 (2003) 1021-1034
13. G. Goumas, A. Sotiropoulos, N. Koziris, Minimizing completion time for loop tiling with computation and communication overlapping, in: Proceedings of IEEE International Parallel and Distributed Processing Symposium (IPDPS'01), San Francisco, April 2001.
14. Hodzic E., and Shang W. On supernode transformation with minimized total running time. IEEE Transactions on Parallel and Distributed Systems 9 5 (1998) 417-428
15. Hodzic E., and Shang W. On time optimal supernode shape. IEEE Transactions on Parallel and Distributed Systems 13 12 (2002) 1220-1233
16. K. Högstedt, L. Carter, J. Ferrante, Determining the idle time of a tiling, in: Proceedings of the 24th ACM Symposium on Principles of Programming Languages (POPL), January 1997, pp. 160-173.
17. K. Högstedt, L. Carter, J. Ferrante, Selecting tile shape for minimal execution time, in: Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1999, pp. 201-211.
18. Högstedt K., Carter L., and Ferrante J. On the parallel execution time of tiled loops. IEEE Transactions on Parallel and Distributed Systems 14 3 (2003) 307-321
19. M. Lam, E. Rothberg, M. Wolf, The cache performance and optimizations of blocked algorithms, in: Proceedings of the 4th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), Santa Clara, California, USA, April 1991, pp. 63-74.
20. Morton K., and Mayers D. Numerical Solution of Partial Differential Equations (2005), Cambridge University Press, Cambridge, UK
21. Padua D., and Wolfe W. Advanced compiler optimizations for supercomputers. Communications of the ACM 29 12 (1986) 1184-1201
22. Press W., Teukolsky S., Vetterling W., and Flannery B. Numerical Recipes in C: The Art of Scientific Computing (1992), Cambridge University Press, New York, NY, USA
23. Ramanujam J., and Sadayappan P. Tiling multidimensional iteration spaces for multicomputers. Journal of Parallel and Distributed Computing 16 2 (1992) 108-120
24. Shang W., and Fortes J.A.B. Independent partitioning of algorithms with uniform dependencies. IEEE Transactions on Computers 41 2 (1992) 190-206
25. E. Su, A. Lain, S. Ramaswamy, D.J. Palermo, E.W. Hodges, P. Banerjee, Advanced compilation techniques in the PARADIGM compiler for distributed memory multicomputers, in: Proceedings of the 9th ACM International Conference on Supercomputing (ICS), Madrid, Spain, July 1995, pp. 424-433.
26. Tang P., and Xue J. Generating efficient tiled code for distributed memory machines. Parallel Computing 26 11 (2000) 1369-1410
27. Wilkinson B., and Allen M. Parallel Programming: Techniques and Applications using Networked Workstations and Parallel Computers (1999), Prentice-Hall, Inc., Upper Saddle River, NJ, USA
28. M. Wolf, M. Lam, A data locality optimizing algorithm, in: Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation (PLDI), Toronto, Ontario, Canada, June 1991, pp. 30-44.
29. Wolf M., and Lam M. A loop transformation theory and an algorithm to maximize parallelism. IEEE Transactions on Parallel and Distributed Systems 2 4 (1991) 452-471
30. Xue J. Communication-minimal tiling of uniform dependence loops. Journal of Parallel and Distributed Computing 42 1 (1997) 42-59
31. Xue J., and Cai W. Time-minimal tiling when rise is larger than zero. Parallel Computing 28 6 (2002) 915-939