The Paradigm Compiler for Distributed-Memory Multicomputers

Computer

Volumn 28, Issue 10, 1995, Pages 37-47

  Banerjee, Prithviraj ^a   Chandy, John A ^a   Gupta, Manish ^a   Hodges, Eugene W ^a   Holm, John G ^a   Lain, Antonio ^a   Palermo, Daniel J ^a   Ramaswamv, Shankar ^a   Su, Ernesto ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL METHODS; COMPUTER HARDWARE; COMPUTER PROGRAMMING; DATA COMMUNICATION SYSTEMS; DATA PROCESSING; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; SUPERCOMPUTERS;

DATA PARALLELISM; DATA PARTITIONING; DISTRIBUTED MEMORY MULTICOMPUTER; MULTITHREADING; PARALLEL PROGRAMMING;

PROGRAM COMPILERS;

EID: 0029394470     PISSN: 00189162     EISSN: None     Source Type: Trade Journal    
DOI: 10.1109/2.467577     Document Type: Article

References (12)

1. S. Hiranandani, K. Kennedy, and C. Tseng, “Compiling Fortran D for MIMD Distributed-Memory Machines,” Comm. ACM, Vol. 35, No. 8, Aug. 1992, pp. 66-80.
2. B. Chapman, P. Mehrotra, and H. Zima. “Programming in Vienna Fortran,” Scientific Programming, Vol. 1, No. 1, Aug. 1992, pp. 31-50.
3. C. Koelbel et al., High-Performance Fortran Handbook, MIT Press, Cambridge, Mass., 1994.
4. CD. Polychronopoulos et al., “Parafrase-2: An Environment for Parallelizing, Partitioning, Synchronizing, and Scheduling Programs on Multiprocessors,” Proc. 18th Int'l Conf. Parallel Processing, Vol. 2, Penn State Univ. Press, University Park, Pa., 1989, pp. 39-48.
5. M. Gupta and P. Banerjee, “Paradigm: A Compiler for Automated Data Partitioning on Mukicomputers,” Proc. Seventh ACM Int'l Conf. Supercomputing, ACM, New York, 1993.
6. D.J. Palermo et al., “Compiler Optimizations for Distributed-Memory Multicomputers Used in the Paradigm Compiler,” Proc. 23rd Int'l Conf. Parallel Processing, Vol. 2, CRC Press, Boca Raton, Fla., 1994, pp. 1-10.
7. A. Lain and P. Banerjee, “Exploiting Spatial Regularity in Irregular Iterative Applications,” Proc. Ninth Int 'I Parallel Processing Symp., IEEE Press, Piscataway, N.J., 1995, pp. 820-827.
8. S. Ramaswamy, S. Sapatnekar, and P. Banerjee, “A Convex Programming Approach for Exploiting Data and Functional Parallelism on Distributed-Memory Mukicomputers,” Proc. 23rd Int'l Conf. Parallel Processing, Vol. 2, CRC Press, Boca Raton, Fla., 1994, pp. 116-125.
9. J. G. Holm, A. Lain, and P. Banerjee, “Compilation of Scientific Programs into Multithreaded and Message-Driven Computation,” Proc. 1994 Scalable High-Performance Computing Conf., IEEE Press, Piscataway, N.J., 1994, pp. 518-525.
10. E. Su, D.J. Palermo, and P. Banerjee, “Processor Tagged Descriptors: A Data Structure for Compiling for Distributed-Memory Mukicomputers,” Proc. 1994 Int'l Conf. Parallel Architectures and Compilation Techniques, Elsevier Science B.V., Amsterdam, The Netherlands, 1994, pp. 123-132.
11. C. Ancourt and F. Irigoin, “Scanning Polyhedra with Do Loops,” Proc. Third ACM SIGPlan Symp. Principles and Practices of Parallel Programming, 1991, pp. 39-50.
12. R. Ponnusamy, J. Saltz, and A. Choudhary, “Runtime-Compilation Techniques for Data Partitioning and Communication Schedule Reuse,”Proc. Supercomputing 93, IEEE CS Press, Los Alamitos, Calif., Order No. 4340,1993, pp. 361-370.