A Linear-Time Algorithm for Computing the Memory Access Sequence in Data-Parallel Programs

ACM SIGPLAN Notices

Volumn 30, Issue 8, 1995, Pages 102-111

  Kennedy, Ken ^a   Nedeljkovic, Nenad ^a   Sethi, Ajay ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976831884     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/209937.209948     Document Type: Article

References (16)

1. C. Ancourt, F. Coelho, F. Irigoin, and R. Keryell. A linear algebra framework for static HPF code distribution. In Proceedings of the Fourth Workshop on Compilers for Parallel Computers, Delft, The Netherlands, December 1993.
2. B. Chapman, P. Mehrotra, and H. Zima. Programming in Vienna Fortran. Scientific Programming, l(l):31-50, Fall 1992.
3. S. Chatterjee. Private communication, October 1994.
4. S. Chatterjee, J. Gilbert, F. Long, R. Schreiber, and S. Teng. Generating local addresses and communication sets for data-parallel programs. In Proceedings of the Fourth ACM SJG-PLAN Symposium on Principles and Practice of Parallel Programming, San Diego, CA, May 1993.
5. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, MA, 1990.
6. J. Dongarra, R. van de Geijn, and D. Walker. A look at scalable dense linear algebra libraries. In Proceedings of the 1992 Scalable High Performance Computing Conference, pages 372–379, Williamsburg, VA, April 1992.
7. S.K.S. Gupta, S.D. Kaushik, C.-H. Huang, and P. Sadayappan. On compiling array expressions for efficient execution on distributed-memory machines. Teclmical Report OSE-CISRC-4/94-TR19, Department of Computer and Information Science, The Ohio State University, April 1994.
8. High Performance Fortran Forum. High Performance Fortran language specification. Scientific Programming, 2(1) :1—170, 1993.
9. S. Hiranandani, K. Kennedy, J. Mellor-Crummey, and A. Sethi. Compilation techniques for block-cyclic distributions. In Proceedings of the 1994 ACM International Conference on Supercomputing, Manchester, England, July 1894.
10. S. Hiranandani, K. Kemiedy, and C.-W. Tseng. Compiling Fortran D for MIMD distributed-memory machines. Communications of the ACM, 35(8):66—80, August 1992.
11. R. Kannan. Algorithmic geometry of numbers. In J. Traub, editor, Annual Review of Computer Science. Annual Reviews Inc., Palo Alto, CA, 1987.
12. K. Kennedy, N. Nedeljkovic, and A. Sethi. Efficient address generation for block-cyclic distributions. In Proceedings of the 1995 ACM International Conference on Supercomputing, Barcelona, Spain, July 1995.
13. A. Knies, M. O'Keefe, and T. MacDonald. High Performance Fortran: A practical analysis. Scientific Programming, 3(3):187-199, Fall 1994.
14. C. Koelbel, D. Loveman, R. Schreiber, G. Steele, Jr., and M. Zosel. The High Performance Fortran Handbook. The MIT Press, Cambridge, MA, 1994.
15. C. van Reeuwijk, H. J. Sips, W. Denissen, and E. M. Paal-vast. Implementing HPF distributed arrays on a mesage-passing parallel computer. Technical report, Advanced School of Computing and Imaging, Delft University of Technology, February 1995.
16. J. Stichnoth, D. O'Hallaron, and T. Gross. Generating communication for array statements: Design, implementation, and evaluation. Journal of Parallel and Distributed Computing, 21 (1):150—159, April 1994.