Resource-based communication placement analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1239, Issue , 1997, Pages 369-388

  Kennedy, Ken ^a   Sethi, Ajay ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; MINING ENGINEERING; PROGRAM COMPILERS;

ANALYSIS TECHNIQUES; COMMUNICATION LATENCY; COMMUNICATION PRIMITIVES; DATA PARALLEL PROGRAMS; DISTRIBUTED MEMORY; LIMITED BUFFERS; RESOURCE CONSTRAINT; RESOURCE-BASED;

FLOW MEASUREMENT;

EID: 21744462391     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0017264     Document Type: Conference Paper

References (14)

1. A. V. Aho, R. Sethi, and J. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, MA, second edition, 1986.
2. S. Amarasinghe and M. Lam. Communication optimization and code generation for distributed memory machines. In Proceedings of the SIGPLAN '93 Conference on Programming Language Design and Implementation, Albuquerque, NM, June 1993.
3. M. Garey and D. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York, NY, 1979.
4. C. Gong, R. Gupta, and R. Melhem. Compilation techniques for optimizing communication on distributed-memory systems. In Proceedings of the 1993 International Conference on Parallel Processing, St. Charles, IL, August 1993.
5. E. Granston and A. Veidenbaum. Detecting redundant accesses to array data. In Proceedings of Supercomputing '91, Albuquerque, NM, November 1991.
6. T. Gross and P. Steenkiste. Structured dataflow analysis for arrays and its use in an optimizing compiler. Software-Practice and Experience, 20(2):133-155, February 1990.
7. M. Gupta, E. Schonberg, and H. Srinivasan. A unified data-flow framework for optimizing communication. In Proceedings of the Seventh Workshop on Languages and Compilers for Parallel Computing, Ithaca, NY, August 1994.
8. R. v. Hanxleden and K. Kennedy. Give-N-Take - A balanced code placement framework. In Proceedings of the SIGPLAN '94 Conference on Programming Language Design and Implementation, Orlando, FL, June 1994.
9. K. Kennedy and A. Sethi. A communication placement framework with unified dependence and data-flow analysis. In Proceedings of the Third International Conference on High Performance Computing, Trivandrum, December 1996.
10. J. Knoop, O. Riithing, and B. Steffen. Optimal code motion: Theory and practice. ACM Transactions on Programming Languages and Systems, 16(4):1117-1155, July 1994.
11. C. Koelbel, D. Loveman, R. Schreiber, G. Steele, and M. Zosel. The High Performance Fortran Handbook. The MIT Press, Cambridge, MA, 1994.
12. T. Mowry, M. Lam, and A. Gupta. Design and evaluation of a compiler algorithm for prefetching. In Proceedings of the Fifth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-V), pages 62-73, Boston, MA, October 1992.
13. R. E. Tarjan. Testing flow graph reducibility. Journal of Computer and System Sciences, 9:355-365, 1974.
14. C. W. Tseng. An Optimizing Fortran D Compiler for MIMD Distributed-Memory Machines. PhD thesis, Dept. of Computer Science, Rice University, January 1993.