Global communication analysis and optimization

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 31, Issue 5, 1996, Pages 68-78

  Chakrabarti, Soumen ^a   Gupta, Manish ^b   Choi, Jong Deok ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17144418556     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/249069.231391     Document Type: Article

References (31)

1. G. Agarwal, J. Saltz, and R. Das. Interprocedural partial redundancy elimination and its application to distributed memory compilation. In Programming Language Design and Implementation (PLDI), La Jolla, CA, June 1995.
2. F. Allen, M. Burke, P. Charles, R. Cytron, and J. Ferrante. An overview of the ptran analysis system for multiprocessing. Proc. ACM 1987 International Conference on Supercomputing, 1987. Also published in Journal of Parallel and Distributed Computing, Oct., 1988, 5(5) pages 617-640.
3. F. Allen, M. Burke, P. Charles, R. Cytron, and J. Ferrante. An overview of the ptran analysis system for multiprocessing. Proc. ACM 1987 International Conference on Supercomputing, 1987. Also published in Journal of Parallel and Distributed Computing, Oct., 1988, 5(5) pages 617-640.
4. S. P. Amarasinghe and M. S. Lam. Communication optimization and code generation for distributed memory machines. In Programming Language Design and Implementation (PLDI), Albuquerque, NM, June 1993. ACM SIGPLAN.
5. Z. Bozkus, A. Choudhary, G. Fox, T. Haupt, and S. Ranka. A compilation approach for Fortran 90D/HPF compilers on distributed memory MIMD computers. In Proc. Sixth Annual Workshop on Languages and Compilers for Parallel Computing, Portland, Oregon, Aug. 1993.
6. T. Brandes. ADAPTOR: A compilation system for data-parallel Fortran programs. In C. W. Kessler, editor, Automatic parallelization - new approaches to code generation, data distribution, and performance prediction. Vieweg Advanced Studies in Computer Science, Vieweg, Wiesbaden, Jan. 1994.
7. J.-D. Choi, R. Cytron, and J. Ferrante. On the efficient engineering of ambitious program analysis. IEEE Transactions on Software Engineering, 20(2):105-114, Feb. 1994.
8. C. Click. Global code motion global value numbering. In Programming Language Design and Implementation (PLDI), pages 246-257. ACM SIGPLAN, 1995.
9. R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and F. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451-490, Oct. 1991.
10. H. P. F. Forum. High Performance Fortran language specification, version 1.0. Technical Report CRPC-TR92225, Rice University, May 1993.
11. E. Granston and A. Veidenbaum. Detecting redundant accesses to array data. In Proc. Supercomputing '91, pages 854-965, 1991.
12. M. Gupta and P. Banerjee. A methodology for high-level synthesis of communication on multicomputers. In Proc. 6th ACM International Conference on Supercomputing, Washington D.C., July 1992.
13. M. Gupta, S. Midkiff, E. Schonberg, V. Seshadri, K. Wang, D. Shields, W.-M. Ching, and T. Ngo. An HPF compiler for the IBM SP2. In Proc. Supercomputing '95, San Diego, CA, Dec. 1995.
14. M. Gupta and E. Schonberg. Static analysis to reduce synchronization costs in data-parallel programs. In Principles of Programming Languages (POPL), St. Petersburg Beach, FL, Jan. 1996.
15. M. Gupta, E. Schonberg, and H. Srinivasan. A unified framework for optimizing communication in data-parallel programs. Technical Report RC 19872(87937) 12/14/94, IBM Research, 1994. To appear in IEEE Transactions on Parallel and Distributed Systems.
16. S. Hiranandani, K. Kennedy, and C. Tseng. Compiling Fortran D for MIMD distributed-memory machines. Communications of the ACM, 35(8):66-80, Aug. 1992.
17. K. Keeton, T. Anderson, and D. Patterson. LogP quantified: The case for low-overhead local area networks. In Proc. Hot Interconnects III: A Symposium on High Performance Interconnects, Stanford, CA, Aug. 1995.
18. K. Kennedy and N. Nedeljkovic. Combining dependence and data-flow analyses to optimize communication. In International Parallel Processing Symposium. IEEE, 1995.
19. K. Kennedy and A. Sethi. A constraint-based communication placement framework. Technical Report CRPC-TR95515-S, CRPC, Rice University, 1995.
20. J. Knoop, O. Rüthing, and B. Steffen. Lazy code motion. In Programming Language Design and Implementation (PLDI), San Francisco, CA, June 1992.
21. J. Li and M. Chen. Compiling communication-efficient programs for massively parallel machines. IEEE Transactions on Parallel and Distributed Systems, 2(3):361-376, July 1991.
22. T. Mowry, M. Lam, and A. Gupta. Design and evaluation of a compiler algorithm for prefetching. In Fifth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pages 62-73. ACM SIGPLAN, 1992.
23. M. O'Boyle and F. Bodin. Compiler reduction of synchronization in shared virtual memory systems. In Proc. 9th ACM International Conference on Supercomputing, Barcelona, Spain, July 1995.
24. V. Sarkar. The PTRAN parallel programming system. Parallel Functional Programming Languages and Compilers, pages 309-391, 1991.
25. M. Snir et al. The communication software and parallel environment of the IBM SP2. IBM Systems Journal, 34(2):205-221, 1995.
26. C. Stunkel et al. The SP2 high performance switch. IBM Systems Journal, 34(2):185-204, 1995.
27. C.-W. Tseng. Compiler optimizations for eliminating barrier synchronization. In Principles and Practice of Parallel Programming (PPoPP), Santa Barbara, CA, July 1995.
28. R. v Hanxleden and K. Kennedy. Give-n-Take - a balanced code placement framework. In Programming Language Design and Implementation (PLDI), Orlando, FL, June 1994. ACM SIGPLAN.
29. M. Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley, 1996.
30. M. Wolfe and U. Banerjee. Data dependence and its application to parallel processing. International Journal of Parallel Programming, 16(2):137-178, Apr. 1987.
31. H. Zima, H. Bast, and M. Gerndt. SUPERB: A tool for semi-automatic MIMD/SIMD parallelization. Parallel Computing, 6:1-18, 1988.