A global communication optimization technique based on data-flow analysis and linear algebra

ACM Transactions on Programming Languages and Systems

Volumn 21, Issue 6, 1999, Pages 1251-1297

  Kandemir, M ^a   Banerjee, P ^b   Choudhary, A ^b   Ramanujam, J ^c   Shenoy, N ^b  

^a Syracuse University   (United States)

^b Northwestern University   (United States)

^c LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000529068     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/330643.330647     Document Type: Article

References (52)

1. AGRAWAL, G. AND SALTZ, J. 1997. Inter-procedural data flow based optimizations for distributed memory compilation. Software Practice and Experience, 27, 5, 519-545.
2. ADVE, V., MELLOR-CRUMMEY, J., AND SETHI, A. 1997. An integer set framework for HPF analysis and code generation. Technical Report TR97-275, Computer Science Dept., Rice University.
3. ADVE, V. AND MELLOR-CRUMMEY, J. 1998. Advanced code generation for High Performance Fortran. In Languages, Compilation techniques, and Run-time Systems for Scalable Parallel Systems, S. Pande and D. Agrawal (Eds.), Chapter 18, Lecture Notes in Computer Science Series, Springer-Verlag. To appear.
4. AHO, A. V., SETHI, R., AND ULLMAN, J. 1986. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, MA, second edition.
5. ALLEN, F. E. AND COCKE, J. 1976. A program data flow analysis procedure. Communications of the ACM, 19, 3, 137-147, March.
6. AMARASINGHE, S. AND LAM, M. 1993. Communication optimization and code generation for distributed memory machines. In Proc. SIGPLAN'93 Conference on Programming Language Design and Implementation, pages 126-138, Albuquerque, NM, June.
7. ANCOURT, A., COELHO, F., IRIGOIN, F., AND KERYELL, R. 1997. A linear algebra framework for static HPF code distribution. Scientific Programming, 6, 1, 3-28, Spring.
8. BALASUNDARAM, V., FOX, G., KENNEDY, K., AND KREMER, U. 1990. An interactive environment for data partitioning and distribution. In 5th Distributed Memory Computing Conference, Charleston, SC.
9. BANERJEE, U. 1994. Loop Parallelization. Kluwer Academic Publishers.
10. BANERJEE, P., CHANDY, J. A., GUPTA, M., HODGES IV, E. W., HOLM, J. G., LAIN, A., PALERMO, D. J., RAMASWAMY, S., AND SU, E. 1995. The PARADIGM compiler for distributed-memory multicomputers. IEEE Computer, 28, 10, 37-47, October.
11. BOZKUS, Z., CHOUDHARY, A., FOX, G., HAUPT, T., AND RANKA, S. 1994. A compilation approach for Fortran 90D/HPF compilers. Languages and Compilers for Parallel Computing, U. Banerjee et al. (Eds.), Lecture Notes in Computer Science, Volume 768, pages 200-215.
12. CALLAHAN, D. AND KENNEDY, K. 1998. Analysis of inter-procedural side effects in a parallel programming environment. Journal of Parallel and Distributed Computing, 5, 5, 517-550, October.
13. CHAKRABARTI, S., GUPTA, M., AND CHOI, J.-D. 1996. Global communication analysis and optimization. In Proc. ACM SIGPLAN'96 Conference on Programming Language Design and Implementation, pages 68-78, Philadelphia, PA, May.
14. CHATTERJEE, S., GILBERT, J., LONG, F., SCHREIBER, R., AND TENG, S. 1995. Generating local addresses and communication sets for data-parallel programs. Journal of Parallel and Distributed Computing, 26, 1, 72-84, April.
15. CREUSILLET, B. AND IRIGOIN, F. 1995. Inter-procedural array region analyses. In Proc. 8th International Workshop on Languages and Compilers for Parallel Computers, pages 46-60, Columbus, Ohio.
16. FOSTER, I. 1994. Designing and building parallel programs. Addison-Wesley Publishing Company, Reading, MA.
17. GAREY, M. AND JOHNSON, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company.
18. GONG, C., GUPTA, R., AND MELHEM, R. 1993. Compilation techniques for optimizing communication on distributed-memory systems. In Proc. International Conference on Parallel Processing, Volume II, pages 39-46, St. Charles, IL.
19. GRANSTON, E. AND VEIDENBAUM, A. 1991. Detecting redundant accesses to array data. In Proc. Supercomputing'91, pages 854-865, Albuquerque, NM.
20. GROSS, T. AND STEENKISTE, P. 1990. Structured data-flow analysis for arrays and its use in an optimizing compiler. In Software-Practice and Experience, vol 20, no 2, pages 133-155, February.
21. GUPTA, M. AND BANERJEE, P. 1992. Demonstration of automatic data partitioning techniques for parallelizing compilers on multicomputers. IEEE Transactions on Parallel and Distributed Systems, 3, 2, 179-193, March.
22. GUPTA, M., MIDKIFF, S., SCHONBERG, E., SESHADRI, V., SHIELDS, D., WANG, K., CHING, W., AND NGO, T. 1995a. An HPF compiler for the IBM SP-2. In Proc. Supercomputing 95, San Diego, CA.
23. GUPTA, M., SCHONBERG, E., AND SRINIVASAN, H. 1995b. A unified data-flow framework for optimizing communication. In Languages and Compilers for Parallel Computing, K. Pingali et al. (Eds.), Lecture Notes in Computer Science, Volume 892, pages 266-282.
24. GUPTA, S. K. S., KAUSHIK, S. D., HUANG, C.-H., AND SADAYAPPAN, P. 1996. Compiling array expressions for efficient execution on distributed-memory machines. Journal of Distributed and Parallel Computing, 32, 2, 155-172, February.
25. HALL, M. W., HIRANANDANI, S., KENNEDY, K., AND TSENG, C.-W. 1992. Inter-procedural compilation of Fortran D for MIMD distributed-memory machines. In Proc. Supercomputing'92.
26. HALL, M. W., MURPHY, B., AMARASINGHE, S., LIAO, S., AND LAM, M. 1995. Inter-procedural analysis for parallelization. In Proc. 8th International Workshop on Languages and Compilers for Parallel Computers, pages 61-80.
27. HENNESSY, J. L. AND PATTERSON, D. A. 1990. Computer Architecture: A Quantitative Approach. Morgan Kaufmann Publishers, San Mateo, CA.
28. HIRANANDANI, S., KENNEDY, K., AND TSENG, C. 1992. Compiling Fortran D for MIMD distributed-memory machines. Communications of the ACM, 35, 8, 66-80, August.
29. KELLY, W., MASLOV, V., PUGH, W., ROSSER, E., SHPEISMAN, T., AND WONNACOTT, DAVID. 1995. The Omega Library interface guide. Technical Report CS-TR-3445, CS Dept., University of Maryland, College Park.
30. KENNEDY, K. AND NEDELJKOVIC, N. 1995. Combining dependence and data-flow analyses to optimize communication. In Proc. 9th International Parallel Processing Symposium, pages 340-346.
31. KENNEDY, K. AND SETHI, A. 1995. A constrained-based communication placement framework, Technical Report CRPC-TR95515-S, CRPC, Rice University.
32. KENNEDY, K. AND SETHI, A. 1996. A communication placement framework with unified dependence and data-flow analysis. Proc. 3rd International Conference on High Performance Computing.
33. KENNEDY, K. AND SETHI, A. 1997. Resource-based communication placement analysis. In Languages and Compilers for Parallel Computing, D. Sehr et al. (Eds.), Lecture Notes in Computer Science, Volume 1239, pages 369-388, Springer-Verlag.
34. KENNEDY, K., NEDELJKOVIC, N., AND SETHI, A. 1995. A linear-time algorithm for computing the memory access sequence in data parallel programs. In Proc. the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Santa Barbara, CA, pages 102-111.
35. KENNEDY, K., NEDELJKOVIC, N., AND SETHI, A. 1996. Communication generation for cyclic(k) distributions. In Languages, Compilers, and Run-Time Systems for Scalable Computers, B. Szymanski and B. Sinharoy (Eds.), Chapter 14, Kluwer Academic Publishers.
36. KNOOP, J., RUTHING, O., AND STEFFEN, B. 1994. Optimal code motion; Theory and practice. ACM Transactions on Programming Languages and Systems, 16, 4, 1117-1155, July.
37. KOELBEL, C., LOVEMEN, D., SCHREIBER, R., STEELE, G., AND ZOSEL, M. 1994. High Performance Fortran Handbook. The MIT Press.
38. PALERMO, D. J., Su, E., CHANDY, J. A., AND BANERJEE, P. 1994. Communication optimizations used in the PARADIGM compiler for distributed-memory multicomputers. In Proc. International Conference on Parallel Processing.
39. POLYCHRONOPOULOS, C., GIRKAR, M. B., HAGHIGHAT, M. R., LEE, C. L., LEUNG, B. P., AND SCHOUTEN, D. A. 1989. Parafrase-2: An environment for parallelizing, partitioning, synchronizing, and scheduling programs on multiprocessors. In Proc. the International Conference on Parallel Processing, St. Charles IL, August 1989, pages II 39-48.
40. PUGH, W. 1992. A practical algorithm for exact array dependence analysis. Communications of the ACM, 35, 8, 102-114, August.
41. SU, E., LAIN, A., RAMASWAMY, S., PALERMO, D. J., HODGES IV, E. W., AND BANERJEE, P. 1995. Advanced compilation techniques in the PARADIGM compiler for distributed-memory multicomputers. In Proc. 9th ACM International Conference on Supercomputing, pages 424-433.
42. SU, E., PALERMO, D. J., AND BANERJEE, P. 1994. Processor tagged descriptors: a data structure for compiling for distributed-memory multicomputers. In Proc. Conf. on Parallel Architectures and Compilation Techniques.
43. TARJAN, R. E. 1974. Testing flow graph reducibility. Journal of Computer and System Sciences, 9:355-365.
44. THIRUMALAI, A. AND RAMANUJAM, J. 1996. Efficient computation of address sequences in data-parallel programs using closed forms for basis vectors. Journal of Parallel and Distributed Computing, 38, 2, 188-203, November.
45. VAN HANXLEDEN, R. AND KENNEDY, K. 1993. A code placement framework and its application to communication generation. Technical Report CRPC-TR93337-S, CRPC, Rice University.
46. VAN HANXLEDEN, R. AND KENNEDY, K. 1994. Give-n-take - a balanced code placement framework. In Proc. ACM SIGPLAN'94 Conference on Programming Language Design and Implementation.
47. VENKATACHAR, A., RAMANUJAM, J., AND THIRUMALAI, A. 1997. Communication generation for block-cyclic distributions. Parallel Processing Letters, 7, 2, 195-202, June.
48. WOLFE, M. 1996. High Performance Compilers for Parallel Computing, Addison-Wesley Publishing Company.
49. YUAN, X., GUPTA, R., AND MELHEM, R. 1997a. An array data flow analysis based communication optimizer. In Proc. 10th Annual Workshop on Languages and Compilers for Parallel Computing.
50. YUAN, X., GUPTA, R., AND MELHEM, R. 1997b. Demand-driven data flow analysis for communication optimization. Parallel Processing Letters, 7, 4, 359-370, December.
51. GERNDT, M. 1990. Updating distributed variables in local computations. Concurrency -Practice and Experience, 2, 3, pages 171-193, September.
52. ZIMA, H. AND CHAPMAN, B. 1991. Supercompilers for Parallel and Vector Computers, ACM Press.