Efficient interprocedural data placement optimisation in a parallel library

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

Volumn 1511 LNCS, Issue , 1998, Pages 123-138

  Beckmann, Olav ^a   Kelly, Paul H J ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER OPERATING SYSTEMS; PROGRAM COMPILERS;

DATA DISTRIBUTION; DISTRIBUTED MEMORY; EXECUTION PLANS; INTER-PROCEDURAL; MULTICOMPUTERS; NUMERICAL LIBRARY; PARALLEL LIBRARY; PARALLEL SPEEDUPS;

FADING (RADIO);

EID: 84886616128     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49530-4_9     Document Type: Conference Paper

References (19)

1. Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers. Addison-Wesley, Reading, Massachusetts, 1986.
2. ASCI Red Pentium Pro BLAS 1.1e. See http://www.cs.utk.edu/~ghenry/ distrib/ and http://developer.intel.com/design/perftool/perflibst/.
3. Uptal Banerjee. Unimodular transformations of double loops. Technical Report TR-1036, Center for Supercomputing Research and Development (CSRD), Uni- versity of Illinois at Urbana-Champaign, 1990.
4. Richard Barrett, Mike Berry, Tony Chan, Jim Demmel, June Donato, Jack Don-garra, Victor Eijkhout, Roldan Pozo, Chuck Romine, and Henk van der Vorst. Templates for the Solution of Linear Systems: Building Blocks for Iterative Me-thods. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, USA, 1994.
5. Olav Beckmann and Paul H J Kelly. Data distribution at run-time; re-using exe- cution plans. To appear in Euro-Par '98, Southampton, U.K., September 1st - 4th, 1998. Proceedings will be published by Springer Verlag in the LNCS Series.
6. Siegfried Benkner, Piyush Mehrotra, John Van Rosendale, and Hans Zima. High- level management of communication schedules in HPF-like languages. Technical Report TR-97-46, Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, VA 23681, USA, September 1997.
7. Michele Dion, Cyril Randriamaro, and Yves Robert. Compiling afine nested loops: How to optimize the residual communications after the alignment phase. Journal of Parallel and Distributed Computing, 38(2):176-187, November 1996. (Pubitemid 126165891)
8. Andrei P. Ershov. On programming of arithmetic operations. Communications of the ACM, 1(8):3-6, 1958.
9. CACM 1(9):16.
10. Paul Feautrier. Toward automatic distribution. Parallel Processing Letters, 4(3):233-244, 1994.
11. William D. Gropp. Performance driven programming models. In MPPM'97, Pro- ceedings of the 3rd International Working Conference on Massively Parallel Pro-gramming Models, London, U.K., November 1997. To appear.
12. William D Gropp, Ewing Lusk, and Anthony Skjellum. Using MPI: Portable Par- allel Programming with the Message-Passing Interface. MIT Press, Cambridge, MA, USA, 1994.
13. Mary W. Hall, Seema Hiranandani, Ken Kennedy, and Chau-Wen Tseng. Interpro- cedural compilation of Fortran D. Journal of Parallel and Distributed Computing, 38:114-129, 1996.
14. John L. Hennessy and David A. Patterson. Computer Architecture A Quantative Approach. Morgan Kaufman, San Mateo, California, 1st edition, 1990.
15. High Performance Fortran Forum. High Performance Fortran language specifica-tion, version 1.1. TR CRPC-TR92225, Center for Research on Parallel Computa- tion, Rice University, Houston, TX, November 1994.
16. Mary E. Mace. Storage Patterns in Parallel Processing. Kluwer Academic Press, 1987.
17. Ravi Ponnusamy, Joel Saltz, and Alok Choudhary. Runtime compilation tech- niques for data partitioning and communication schedule reuse. In Proceedings of Supercomputing '93: Portland, Oregon, November 15-19, 1993, pages 361-370, New York, NY 10036, USA, November 1993. ACM Press.
18. Joel H. Saltz, Ravi Mirchandaney, and Kay Crowley. Run-time parallelization and scheduling of loops. IEEE Transactions on Computers, 40(5):603-612, May 1991. (Pubitemid 21675674)
19. R. M. Tomasulo. An effcient algorithm for exploiting multiple arithmetic units. IBM Journal of Research and Development, 11(1):25-33, January 1967.