Runtime performance of parallel array assignment: An empirical study

Proceedings of the International Conference on Supercomputing

Volumn 1996-November, Issue , 1996, Pages

  Wang, Lei ^a   Stichnoth, James M ^b   Chatterjee, Siddhartha ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b Carnegie Mellon University   (United States)

Author keywords

Array assignment; Block cyclic distribution; Code generation; High Performance Fortran; Performance evaluation

Indexed keywords

FORTRAN (PROGRAMMING LANGUAGE);

ARRAY ASSIGNMENT; BLOCK-CYCLIC DISTRIBUTION; CODEGENERATION; DATA ARRAY; EMPIRICAL STUDIES; HIGH PERFORMANCE FORTRANS; PARALLEL ARRAYS; PERFORMANCE DATA; PERFORMANCES EVALUATION; RUNTIME PERFORMANCE;

CODES (SYMBOLS);

EID: 85117316599     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SUPERC.1996.183512     Document Type: Conference Paper

References (14)

1. C. Ancourt, F. Coelho, F. Irigoin, and R. Keryell. A linear algebra framework for static HPF code distribution. In Workshop on Compilers for Parallel Computers, Delft, The Netherlands, Dec. 1993.
2. S. Chatterjee, J. R. Gilbert, F. J. E. Long, R. Schreiber, and S.-H. Teng. Generating local addresses and communication sets for data-parallel programs. Journal of Parallel and Distributed Computing, 26(1):72–84, Apr. 1995.
3. J. J. Dongarra and D. W. Walker. Software libraries for linear algebra computations on high performance computers. SIAM Review, 37(2):151–180, June 1995.
4. S. K. S. Gupta, S. D. Kaushik, S. Mufti, S. Sharma, C.-H. Huang, and P. Sadayappan. On compiling array expressions for efficient execution on distributed-memory machines. In A. N. Choudhary and P. B. Berra, editors, Proceedings of the 1993 International Conference on Parallel Processing, volume II, pages 301–305. CRC Press, Inc., Aug. 1993.
5. High Performance Fortran Forum. High Performance Fortran language specification. Scientific Programming, 2(1–2):1–170, 1993.
6. K. Kennedy, N. Nedeljković, and A. Sethi. Efficient address generation for block-cyclic distributions. In Proceedings of the 1995 International Conference on Supercomputing, pages 180–184, Barcelona, Spain, July 1995.
7. K. Kennedy, N. Nedeljković, and A. Sethi. A linear-time algorithm for computing the memory access sequence in data-parallel programs. In Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 102–111, Santa Barbara, CA, July 1995.
8. K. Kennedy, N. Nedeljković, and A. Sethi. Communication generation for cyclic(k) distributions. In B. Szymanski and B. Sinharoy, editors, Languages, Compilers, and Run-Time Systems for Scalable Computers, pages 185–197. Kluwer Academic Publishers, 1996.
9. C. Koelbel. Compile-time generation of regular communication patterns. In Proceedings of Supercomputing’91, pages 101–110, Albuquerque, NM, Nov. 1991.
10. C. Koelbel and P. Mehrotra. Compiling global name-space parallel loops for distributed execution. IEEE Transactions on Parallel and Distributed Systems, 2(4):440–451, Oct. 1991.
11. T. MacDonald, D. Pase, and A. Meltzer. Addressing in Cray Research’s MPP Fortran. In Proceedings of the Third Workshop on Compilers for Parallel Computers, pages 161–172, Vienna, Austria, July 1992. Austrian Center for Parallel Computation.
12. S. Midkiff. Local iteration set computation for block-cyclic distributions. In C. Polychronopoulos, editor, Proceedings of the 24th International Conference on Parallel Processing, pages 77–84. CRC Press, Aug. 1995.
13. 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, Pittsburgh, PA, Feb. 1993.
14. A. Thirumalai and J. Ramanujam. Fast address sequence generation for data-parallel programs using integer lattices. In C.-H. Huang, P. Sadayappan, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Languages and Compilers for Parallel Computing (LNCS 1033), pages 191–208. Springer, 1995.