Efficient computation of address sequences in data parallel programs using closed forms for basis vectors

Journal of Parallel and Distributed Computing

Volumn 38, Issue 2, 1996, Pages 188-203

  Thirumalai, Ashwath ^a   Ramanujam, J ^b  

^a Zycad Corporation   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

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

References (27)

1. 1. A. Ancourt, F. Coelho, F. Irigoin, and R. Keryell. A linear algebra framework for static HPF code distribution. Proc. of the 4th Workshop on Compilers for Parallel Computers. Delft, The Netherlands, Dec. 1993.
2. 2. S. Benkner. Handling block-cyclic distributed arrays in Vienna Fortran 90. Proc. International Conference on Parallel Architectures and Compilation Techniques. Limassol, Cyprus, June 1995.
3. 3. B. Chapman, P. Mehrotra, and H. Zima. Programming in Vienna Fortran. Sci. Programming 1(1), 31-50, 1992.
4. 4. S. Chatterjee, J. Gilbert, F. Long, R. Schreiber, and S. Teng. Generating local addresses and communication sets for data parallel programs. J. Parallel Distrib. Comput. 26, 72-84, 1995.
5. 5. G. Dantzig and B. Eaves. Fourier-Motzkin elimination and its dual. J. Combin. Theory A 14, 288-297, 1973.
6. 6. G. Fox, S. Hiranandani, K. Kennedy, C Koelbel, U. Kremer, C.-W. Tseng, and M. Wu. Fortran D language specification. Technical Report TR-91-170, Dept. of Computer Science, Rice University, Dec. 1991.
7. 7. P. M. Gruber and C. G. Lekkerkerker. Geometry of numbers. North-Holland Mathematical Library, 2nd ed., Volume 37, North-Holland, Amsterdam, 1987.
8. 8. S. Gupta, S. Kaushik, C. Huang, and P. Sadayappan. On compiling array expressions for efficient execution on distributed-memory machines. J. Parallel Distrib. Comput., to appear.
9. 9. High Performance Fortran Forum. High Performance Fortran language specification. Sci. Programming 2(1-2), 1-170, 1993.
10. 10. S. Hiranandani, K. Kennedy, J. Mellor-Crummey, and A. Sethi. Compilation techniques for block-cyclic distributions. Proc. ACM International Conference on Supercomputing, July 1994.
11. 11. K. Kennedy, N. Nedeljkovic, and A. Sethi. A linear-time algorithm for computing the memory access sequence in data-parallel programs. Proc. of Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Santa Barbara, CA, July 1995.
12. 12. C. Koelbel. Compile-time generation of communication for scientific programs. In Supercomputing '91, pp. 101-110, Nov. 1991.
13. 13. T. MacDonald, D. Pase, and A. Meltzer. Addressing in Cray Research's MPP Fortran. Proceedings of the Third Workshop on Compilers for Parallel Computers (Vienna, Austria, July 1992), Austrian Center for Parallel Computation, pp. 161-172.
14. 14. S. Midkiff. Local iteration set computation for block-cyclic distributions. Proc. International Conference on Parallel Processing, Vol. II, pp. 77-84, Aug. 1995.
15. 15. J. Ramanujam. Non-unimodular transformations of nested loops. Proc. Supercomputing 92, pp. 214-223, Nov. 1992.
16. 16. J. Ramanujam. Beyond unimodular transformations. J. Supercomputing 9(4), 365-389, 1995.
17. 17. C. van Reeuwijk, H. J. Sips, W. Denissen, and E. M. Paalvast. Implementing HPF distributed arrays on a message-passing parallel computer system. CP Technical Report series, TR9506, Delft University of Technology, 1995.
18. 18. J. M. Stichnoth. Efficient compilation of array statements for private memory multicomputers. Technical Report CMU-CS-93-109, School of Computer Science, Carnegie Mellon University, Feb. 1993.
19. 19. J. M. Stichnoth, D. O'Hallaron, and T. Gross. Generating communication for array statements: Design, implementation, and evaluation. J. Parallel Distrib. Comput. 21 150-159, 1994.
20. 20. A. Thirumalai. Code generation and optimization for High Performance Fortran. M.S. thesis, Department of Electrical and Computer Engineering, Louisiana State University, Aug. 1995.
21. 21. A. Thirumalai and J. Ramanujam. Code generation and optimization for array statements in HPF. Technical Report, Louisiana State University, Nov. 1994, revised Aug. 1995.
22. 22. A. Thirumalai and J. Ramanujam. Address sequence determination using closed forms for basis vectors of the array section lattice. Technical Report, Louisiana State University, Apr. 1995.
23. 23. A. Thirumalai and J. Ramanujam. Fast address sequence generation for data-parallel programs using integer lattices. In Languages and Compilers for Parallel Computing (C.-H. Huang et al., Eds.), Lecture Notes in Computer Science, Vol. 1033, pp. 191-208, Springer-Verlag, Berlin/New York, 1996.
24. 24. A. Thirumalai, J. Ramanujam, and A. Venkatachar. Communication generation and optimization for HPF. In Languages, Compilers, and Run-Time Systems for Scalable Computers (B. Szymanski and B. Sinharoy, Eds.), Chap. 29, pp. 311-316, Kluwer Academic, Norwell, MA, 1995.
25. 25. A. Venkatachar, J. Ramanujam, and A. Thirumalai. Generalized overlap regions for communication optimization in data-parallel programs. To appear in Languages and Compilers for Parallel Computing (U. Banerjee et al., Eds.) (Proceedings of the Ninth Workshop on Languages and Compilers for Parallel Computing, August 1996), Lecture Notes in Computer Science, Springer-Verlag, Berlin/New York, 1997.
26. 26. H. A. G. Wijshoff. Data organization in parallel computers. Kluwer Academic, Norwell, MA, 1989.
27. 28. M. Wolfe. High performance compilers for parallel computing. Addison-Wesley, Redwood City, CA, 1996.