Communication Optimization and Code Generation for Distributed Memory Machines

ACM SIGPLAN Notices

Volumn 28, Issue 6, 1993, Pages 126-138

  Amarasinghe, Saman P ^a   Lam, Monica S ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976724523     PISSN: 03621340     EISSN: 15581160     Source Type: Journal    
DOI: 10.1145/173262.155102     Document Type: Article

References (28)

1. C. Ancourt and F. Irigoin. Scanning Polyhedra with DO Loops. In Third ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP, p. 3950, April 1991.
2. M. Ancourt. Generation automatique de codes de transfert pour multiprocesseurs a memoires locales. PhD thesis, University of Paris VI, March 1991.
3. J. M. Anderson and M. S. Lam. Global Optimizations for Parallelism and Locality on Scalable Parallel Machines. In Proceedings of the SIGPLAN ‘93 Conference on Program Language Design and Implementation, June 1993.
4. F. André, O. Chéron and J.-L. Pazat. Compiling Sequential Programs for Distributed Memory Parallel Computers with Pandore II. In Third Workshop on Compilers for Parallel Computers, p. 231242, July 1992.
5. U. Banerjee. Dependence Analysis for Supercomputing. Kluwer Academic, 1988.
6. W. Blume and R. Eigenmann. Performance Analysis of Parallelizing Compilers on the Perfect Benchmarks Programs. In IEEE Transactions on Parallel and Distributed Systems, vol. 3, no. 6, pp. 643-656, November 1992.
7. M. Bromley, S. Heller, T. McNerney and G. L. Steele Jr. Fortran at Ten Gigaflops: The Connection Machine Convolution Compiler. In Proceedings of ACM Conference on Programming Language Design and Implementation, p. 145164, June 1991.
8. B. Chapman, P. Mehrotra, and H. Zima. Programming in Vienna Fortran. In Third Workshop on Compilers for Parallel Computers, p. 121160, July 1992.
9. C. Koelbel. Compile-time generation of regular communication patterns. In Proceedings of Supercomputing ‘91, pp. 101-110, November 1991.
10. P. Feautrier, Array expansion. In International Conference on Supercomputing, p. 429442, 1988.
11. P. Feautrier, Parametric integer programming. Technical Report 209, Laboratoire Methodologie and Architecture Des Systems Informatiques, January 1988.
12. P. Feautrier. Dataflow analysis of array and scalar references. In International Journal of Parallel Programming, 20(1):23-52, February 1991.
13. G. Gannon, W. Jalby and K Gallivan. Strategies for cache and local memory management by global program transformation. In Journal of Parallel and Distributed Computing, 5:587-616, 1988.
14. G. R. Gao, R. Olsen, V. Sarkar and R. Thekkath. Collective loop fusion for array contraction. In Proceedings of the Fifth Workshop on Programming Languages and Compilers for Parallel Computing, p. 171181, August 1992.
15. P. Havlak and K. Kennedy. An implementation of interprocedural bounded regular section analysis. In IEEE Transactions on Parallel and Distributed Systems, vol. 2, no. 3, pp. 350-360, July 1991.
16. S. Hiranandani, K. Kennedy and C. Tseng. Compiling Fortran D for MIMD Distributed-Memory Machines. In Communications of ACM, vol. 35, no. 8, pp. 66-80, August 1992.
17. L. G. C. Hamey, J. A. Webb and I. C. Wu. An architecture independent programming language for low-level vision. Computer Vision, Graphics, and Image Processing, vol. 48, no. 2, pp. 246-264, November 1989.
18. J. Li and M. Chen. Index domain alignment: Minimizing cost of cross-referencing between distributed arrays. In Proceedings of Frontiers ‘90: The Third Symposium on the Frontiers of Massively Parallel Computation. pp. 424-432. October 1990.
19. D. E. Maydan, S. P. Amarasinghe and M. S. Lam. Array Data-Flow Analysis and its Use in Array Privatization. In Proceedings of ACM Conference on Principles of Programming Languages, p. 215. January 1993.
20. D. E. Maydan, Accurate Analysis of Array References. PhD thesis, Stanford University, September 1992. Published as CSL-TR-92-547.
21. P. Mehrotra and J. Van Rosendale. High Level Programming of Distributed Memory Architectures. In A. Nicolau, D. Gelernter, T. Gross and D. Padua editors, Advances in Languages and Compilers for Parallel Processing, p. 364384, The MIT Press, Cambridge, Massachusetts, 1991.
22. K. Pingali and A. Rogers. Process decomposition through locality of reference. In Proceedings of the SIGPLAN ‘89 Conference on Program Language Design and Implementation, p. 6980, June 1989.
23. A. Schrijver, Theory of Linear and Integer Programming, Wiley, Chichester’ 1986.
24. G. L. Steele. Proposal for alignment and distribution directives in HPF. Draft presented at HPF Forum meeting, June 1992.
25. S. Tjiang, M. Wolf, M. Lam, K. Pieper and J. Hennessy. Integrating scalar optimizations and parallelization. In U. Banerjee, D. Gelernter, A. Nicolau and D. Padua editors, Languages and Compilers for Parallel Computing, p. 137151, Springer-Verlag, Berlin, Germany, 1992.
26. C.-W. Tseng. An Optimizing Fortran D Compiler for MIMD Distributed-Memory Machines. PhD thesis, Rice University, January 1993. Published as Rice COMP TR93-199.
27. M. E. Wolf and M. S. Lam. A data locality optimizing algorithm. In SIGPLAN Notices, vol. 26, no. 6, pp. 30-44, June 1991.
28. M. E. Wolf. Improving locality and parallelism in nested loops. PhD thesis, Stanford University, August 1992. Published as CSL-TR-92-538.