Efficient distribution analysis via graph contraction

International Journal of Parallel Programming

Volumn 24, Issue 6, 1996, Pages 599-620

  Sheffler, Thomas J ^a   Schreiber, Robert ^a   Pugh, William ^a   Gilbert, John R ^a   Chatterjee, Siddhartha ^a  

^a RAMBUS INC   (United States)

Author keywords

Array distribution; Graph algorithms; Optimizing compilers; Parallel computing

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING; PROGRAM COMPILERS;

GRAPH CONTRACTION;

PARALLEL PROCESSING SYSTEMS;

EID: 0030420792     PISSN: 08857458     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF03356761     Document Type: Article

References (14)

1. R. Bixby, K. Kennedy, and U. Kremer, Automatic Data Layout Using 0-1 Integer Programming. Technical Report CRPC-TR93349-S, Center for Research on Parallel Computation, Rice University, Houston, Texas (November 1993).
2. J. M. Anderson and M. S. Lam, Global Optimizations for Parallelism and Locality on Scalable Parallel Machines. Proc. ACM S1GPLAN '93 Conf. PLD1, Albuquerque, New Mexico, pp. 112-125 (June 1993).
3. S. Chatterjee, J. R. Gilbert, R. Schreiber, and T. J. Shefller, Array Distribution in DataParallel Programs. In K. Pingali, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, (eds)., Proc. of the Seventh Ann. Workshop on Languages and Compilers for Parallel Computing, Ithaca, New York, Springer-Verlag, Lecture Notes in Computer Science, 892:76-91, (August 1994). Also available as RIACS Technical Report 94.09.
4. J. Li and M. Chen, The Data Alignment Phase in Compiling Programs for DistributedMemory Machines. J. of Parallel and Distrib. Comput. 13(2):213-221 (October 1991).
5. S. Wholey, Automatic Data Mapping for Distributed-Memory Parallel Computers. Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania (May 1991). Available as Technical Report CMU-CS-91-121.
6. M. Gupta, Automatic Data Partitioning on Distributed Memory MultiComputers. Ph.D. Thesis, University of Illinois at Urbana-Champaign, Urbana, Illinois (September 1992). Available as Technical Reports UILU-ENG-92-2237 and CRHC-92-19.
7. D. J. Palermo and P. Banerjee, Automatic Selection of Dynamic Data Partitioning Schemes for Distributed-Memory Multicomputers. Talk presented at the Workshop on Automatic Data Layout and Performance Prediction. Center for Research on Parallel Computing, Rice University. (April 1995).
8. U. Kremer, NP-CompIeteness of Dynamic Remapping. Technical Report CRPC-TR93330-S, Center for Research on Parallel Computation, Rice University, August 1993. Appears in the Proc. of the Fourth Workshop on Compilers for Parallel Computers, Delft, The Netherlands (December 1993).
9. S. Chatterjee, J. R. Gilbert, and R. Schreiber, Mobile and Replicated Alignment of Arrays in Data-Parallel Programs. Proc. of Siipercoinpiiling '93, Portland, Oregon, pp. 420-429, (November 1993).
10. T. J. Shefiler, R. Schreiber, J. R. Gilbert, and S. Chatterjee, Aligning Parallel Arrays to Reduce Communication. Proc. of Frontiers '95: The Fifth Symp. on the Frontiers of Massively Parallel Computation pp. 324-331 (February 1995).
11. S. Chatterjee, J. R. Gilbert, R. Schreiber, and T. J. Shefiler, Modeling Data-Parallel programs with the Alignment-Distribution Graph. J. Programming Languages, 2:227-258 (1994). Special issue on compiling and run-time issues for distributed address space machines.
12. P. Hough and T. J. Sheffler, A Performance Analysis of Collective Communication on the CM-5. Excalibur project meeting note.
13. J. R. Gilbert, C. Moler, and R. Schreiber, Sparse Matrices in MATLAB: Design and Implementation. SIAM J. Matrix Anal. Appl. 13(l):333-356 (January 1992).
14. A. V. Goldberg and R. E. Tarjan, A New Approach to the Maximum-Flow Problem. J. ACM, 35(4):921-940 (October 1988).