An implementation framework for HPF distributed arrays on message-passing parallel computer systems

IEEE Transactions on Parallel and Distributed Systems

Volumn 7, Issue 9, 1996, Pages 897-914

  Van Reeuwijk, Kees ^a   Denissen, Will ^b   Sips, Henk J ^a   Paalvast, Edwin M R M ^b  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b TNO   (Netherlands)

Author keywords

Distributed arrays; HPF; Message aggregation; Message passing; Parallel computers

Indexed keywords

CELLULAR ARRAYS; DATA COMMUNICATION SYSTEMS; FORTRAN (PROGRAMMING LANGUAGE); PARALLEL PROCESSING SYSTEMS; PROGRAM COMPILERS;

DISTRIBUTED ARRAYS; HIGH PERFORMANCE FORTRAN; MESSAGE AGGREGATION; MESSAGE PASSING PARALLEL COMPUTER SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0030247075     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.536935     Document Type: Article

References (34)

1. "High Performance Fortran Forum," High Performance Fortran Language Specification, ver. 1.1, Nov. 1994.
2. A.H. Veen and M. de Lange, Overview of the PREPARE Project," Proc. Fourth Int'l Workshop Compilers for Parallel Computers, H.J. Sips, ed., pp. 365-371, Dec. 1993.
3. F. Andre, P. Brezany, O. Chéron, W. Denissen, J.L. Pazat, and K. Sanjari, "A New Compiler Technology for Handling HPF Data Parallel Constructs," Proc. Third Workshop on Languages, Compilers, and Run-time Systems, B.K. Szymanski and B. Sinharoy, eds., pp. 279-282, 1995.
4. A. Choudhary R. Ponnusamy, and J. Saltz, "Runtime-Compilation for Data Partitioning and Communication Schedule Reuse," Proc. Supercomputing 1993, pp. 361-370, Nov. 1993. Also available as University of Maryland Technical Report CS-TR-3055 UMIACS-TR-93-32.
5. P. Brezany, O. Chéron, K. Sanjari, and E. van Konijnenburg, "Processing Irregular Codes Containing Arrays with Multi-Dimensional Distributions by the PREPARE IIPF Compiler," HPCN Europe '95, pp. 526-531. Springer-Verlag, 1995.
6. 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," J. Parallel and Distributed Computing, vol. 26, no. 1, pp. 72-84, April 1995. First presented at PPoPP'93.
7. D. Callahan and K. Kennedy, "Compiling Programs for Distributed-Memory Multiprocessors," J. Supercomputing, vol. 2, no. 2, pp. 151-169, Oct. 1988.
8. M. Gerndt, "Array Distribution in SUPERB," Proc. Third Int'l Conference on Supercomputing, Crete, Greece, June 1989.
9. A. Rogers and K. Pingali, "Process Decomposition Through Locality of Reference," Proc. ACM SIGPLAN Int'l Conf. Program Language Design and Implementation, June 1989.
10. E.M. Paalvast, A.J. van Gemund, and H.J. Sips, "A Method for Parallel Program Generation with an Application to the Booster Language," Proc. 1990 Int'l Conf. Supercomputing, pp. 457-469, June 11-15 1990.
11. C. Koelbel and P. Mehrotra, "Compiling Global Name-Space Parallel Loops for Distributed Execution," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 4, pp. 440-451, Oct. 1991.
12. M. Le Fur, J.-L Pazat, and F. Andre, "Static Domain Analysis for Compiling Commutative Loop Nests," Publication interne 757, IRISA, Campus Universitaire de Beaulieu - 35042 Rennes Cedex, France, Sept 1993. URL: ftp//irisa.irisa.fr/techreports/1993/PI-757.ps.Z.
13. C.-W. Tseng, "An Optimizing Fortran D Compiler for MIMD Distributed Memory Machines," PhD thesis, Rice Univ., Houston, Tex., Jan. 1993.
14. J.M. Stichnoth, "Efficient Compilation of Array Statements for Private Memory Multicomputers," Technical Report CMU-CS-93-109, School of Computer Science, Carnegie Mellon Univ., Feb. 1993.
15. J.M. Stichnoth, D. O'Hallaron, and T.R. Gross, "Generating Communication for Array Statements: Design, Implementation and Evaluation," J. Parallel and Distributed Computing, vol. 21, pp. 150-159, 1994.
16. 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," Proc. Int'l Conf. Parallel Processing, vol. II, pp. 301-305, Aug. 1993.
17. S.K.S. Gupta, S.D. Kaushik, C.-H. Huang, and P. Sadayappan, "On Compiling Array Expressions for Efficient Execution on Distributed-Memory Machines," Technical Report OSU-CISRC-4/94-TR19, Ohio State Univ., Columbus, OH 43210, 1994. URL: ftp://archive.cis.ohio-state.edu/pub/tech-report/1994/TR19.ps.gz.
18. S.D. Kaushik, C.-H. Huang, and P. Sadayappan, "Incremental Generation of Index Sets for Array Statement Execution on Distributed-Memory Machines," Proc. Seventh Ann. Workshop Languages and Compilers for Parallel Computing, pp. 17.1-17.18, Cornell Univ., Aug. 1994. Also published in LNCS 892, pp 251-265, 1995, Springer Verlag,.
19. S. Benkner, P. Brezany, and H. Zima, "Processing Array Statements and Procedure Interfaces in the PREPARE High Performance Fortran Compiler," Compiler Construction, Proc. Fifth Int'l Conf., P.A. Fritzon, ed., vol. 786 of LNCS. Springer-Verlag, pp. 324-338, Apr. 1994.
20. C. Ancourt, F. Irigoin, F. Coelho, and R. Keryell, "A Linear Algebra Framework for Static HPF Code Distribution," Technical Report A-278-CRI, Ecole des Mines, Paris, Nov. 1995. An earlier version was presented at the Fourth Int'l Workshop on Compilers for Parallel Computers, Delft, The Netherlands, pp. 117-132, Dec. 1993.
21. S. Hiranandani, K. Kennedy, J. Mellor-Crummey, and A. Sethi, "Compilation Techniques for Block-Cyclic Distributions," Proc. Intl. Conf. Supercomputing, pp. 392-403, July 1994.
22. A. Thirumalai and J. Ramanujam, "Fast Address Sequence Generation for Data-Parallel Programs Using Integer Lattices," Proc. Eighth Int'l Workshop Languages and Compilers for Parallel Computing, pp. 13.1-13.19, 1995.
23. K. Kennedy, N. Nedeljkovic', and A. Sethi, "A Linear-Time Algorithm for Computing the Memory Access Sequence in Data-Parallel Programs," Proc. Fifth ACM SIGPLAN Symp. Principles and Practice of Parallel Programming, 1995.
24. S.D. Kaushik, C.-H. Huang, and P. Sadayappan, "Compiling Array Statements for Efficient Execution on Distributed Memory Machines: Two-Level Mappings," Proc. Eighth Ann. Workshop Languages and Compilers for Parallel Computing, pp. 14.1-14.15, Ohio State Univ., Aug. 1995.
25. K. Kennedy, N. Nedeljkovic', and A. Sethi, "A Linear Time Algorithm for Computing the Memory Access Sequence in Data-Parallel Programs," Proc. Symp. Principles and Practice of Parallel Programming, pp. 102-111, ACM, 1995. Proceedings also published as Sigplan Notices, vol. 30, no. 8.
26. K. Kennedy, N. Nedeljkovic', and A. Sethi, "Efficient Address Generation for Block-Cyclic Distributions," Proc. Intl. Conf. Supercomputing, pp. 180-184, June 1995.
27. C. Koelbel, "Compile-Time Generation of Regular Communication Patterns," Proc. Supercomputing 1991, pp. 101-110, ACM, 1991.
28. E.M. Paalvast, H.J. Sips, and L.C. Breebaart, "Booster: A High-Level Language for Portable Parallel Algorithms," Applied Numerical Mathematics, vol. 8, no. 6, pp. 177-192, 1991.
29. E.M. Paalvast, "Programming for Parallelism and Compiling for Efficiency," PhD thesis, Delft Univ. of Technology, June 1992.
30. E.M. Paalvast, H.J. Sips, and A.J. van Gemund, "Automatic Parallel Program Generation and Optimization from Data Decompositions," Proc. 1991 Int'l Conf. Parallel Processing, pp. II 124-131, Aug. 1991.
31. Y. Mahéo and J.-L. Pazat, "Distributed Array Management for HPF Compilers," Publication interne 787, IRISA, Campus Universitaire de Beaulieu-35042 Rennes Cedex, France, Dec. 1993. URL: ftp://irisa.irisa.fr/techreports/1993/PI-787.ps.Z.
32. K.H. Rosen, Elementary Number Theory And Its Applications. Addison Wesley, 1984.
33. H. Zima and B. Chapman, Supercompilers for Parallel and Vector Computers. ACM Press, Frontier Series, 1991.
34. M. Wolfe, High Performance Compilers for Parallel Computing. Addison-Wesley, 1995.