Compiling array expressions for efficient execution on distributed-memory machines

Journal of Parallel and Distributed Computing

Volumn 32, Issue 2, 1996, Pages 155-172

  Gupta, S K S ^a   Kaushik, S D ^b   Huang, C H ^c   Sadayappan, P ^c  

^a Duke University   (United States)

^b INTEL CORPORATION   (United States)

^c OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (21)

1. 1. Ahmad, I., Bordawekar, R., Bozkus, Z., Choudhary, A., Fox, G., Parasuram, K., Ponnusamy, R., Ranka, S., and Thakur, R. Implementation and scalability of Fortan-90D intrinsic functions on distributed memory machines. Technical Report SCCS-256, Northeast Parallel Architectures Center, June 1992.
2. 2. Burton, D. Elementary Number Theory. Allyn & Bacon, Boston, revised printing edition, 1984.
3. 3. Chapman, B. M., Mehrotra, P., and Zima, H. P. Vienna Fortran - A Fortran language extension for distributed memory multiprocessors. In Saltz, J., and Mehrotra, P., editors, Language, Compilers and Runtime Environments for Distributed Memory Machines, 1992, pp. 39-62.
4. 4. Chatterjee, S., Gilbert, J. R., Long, F. J. E., Schreiber, R., and Teng, S.-H. Generating local addresses and communication sets for data parallel programs. In Proc. of ACM Symposium on Principles and Practices of Parallel Programming, May 1993, pp. 149-158.
5. 5. High Performance Fortran Forum. High Performance Fortran language specification version 1.0. Technical Report CRPC-TR92225, Rice University, May 1993.
6. 6. Fox, G., Hiranandani, S., Kennedy, K., Koelbel, C., Kremer, U., Tseng, C.-W., and Wu, M. Fortran-D language specification. Technical Report TR-91-170, Dept. of Computer Science, Rice University, Dec. 1991.
7. 7. Gupta, S. K. S., Kaushik, S. D., Mufti, S., Sharma, S., Huang, C.-H., and Sadayappan, P. On the generation of efficient data communication for distributed-memory machines. Proc. of Intl. Computing Symposium. Dec. 1992, pp. 504-513.
8. 8. Gupta, S. K. S., Kaushik, S. D., Mufti, S., Sharma, S., Huang, C-H., and Sadayappan, P. On compiling array expressions for efficient execution on distributed-memory machines. Proc. of Intl. Conf. on Parallel Processing, Vol. II. Aug. 1993, pp. 301-305.
9. 9. Hiranandani, S., Kennedy, K., Mellor-Crummey, J., and Sethi, A. Advanced compilation techniques for Fortran D. Technical Report CRPC-TR-93-338, Center for Research on Parallel Computation, Rice University, Oct. 1993.
10. 10. Hiranandani, S., Kennedy, K., Mellor-Crummey, J., and Sethi, A. Compilation techniques for block-cyclic distributions. Proc. of Intl. Conf. on Supercomputing, July 1994, pp. 392-403.
11. 11. Kaushik, S. D. Compile-time and run-time strategies for array statement execution on distributed-memory machines. Ph.D. thesis, Department of Computer and Information Science, the Ohio State University, Mar. 1995.
12. 12. Kennedy, K., Nedeljkovic', N., and Sethi, A. Efficient address generation for block-cyclic distributions. Technical Report CRPC-TR94487-S, Center for Research on Parallel Computation, Rice University, Dec. 1994.
13. 13. Kennedy, K., Nedeljkovic', N., and Sethi, A. A linear-time algorithm for computing the memory access sequence in data-parallel programs. Technical Report CRPC-TR94485-S, Center for Research on Parallel Computation, Rice University, Oct. 1994.
14. 14. Knuth, D. Seminumerical Algorithms, 2nd ed., The Art of Computer Programming, Vol. 2. Addison-Wesley, Reading, MA, second edition, 1981.
15. 15. Koelbel, C. Compile-time generation of communication for scientific programs. Proc. of Supercomputing '91. Nov. 1991, pp. 101-110.
16. 16. Merlin, J. Techniques for automatic parallelisation of 'Distributed Fortran 90'. Technical Report SNARC 92-02, Southampton Novel Architecture Research Center, June 1992.
17. 17. Paalvast, E. M., Sips, H. J., and van Gemund, A. J. Automatic parallel program generation and optimization from data decompositons. Proc. of Intl. Conf. on Parallel Processing, Vol. 2. Aug. 1991, pp. 124-131.
18. 18. Saltz, J., Crowley, K., Mirchandaney, R., and Berryman, H. Runtime scheduling and execution of loops on message passing machines. J. Parallel Distrib. Comput. 8, 4 (Apr. 1990), 303-312.
19. 19. Stichnoth, J., O'Hallaron, D., and Gross, T. Generating communication for array statements: Design, implementation, and evaluation. J. Parallel Distrib. Comput., 21, 2 (May 1994), 150-159.
20. 20. Stichnoth, J. Efficient compilation of array statements for private memory multicomputer. Technical Report CMU-CS-93-109, School of Computer Science, Carnegie Mellon University, Feb. 1993.
21. 21. Zima, H., and Chapman, B. Supercompilers for Parallel and Vector Computers. ACM Press, Frontier Series. Addison-Wesley Publishing Company, New York, 1990.