Languages, compilers, and run-time environments for distributed memory machines
β Scribed by Joel Saltz; Piyush Mehrotra
- Publisher
- North Holland
- Year
- 1992
- Tongue
- English
- Leaves
- 329
- Series
- Advances in Parallel Computing 3
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
Papers presented within this volume cover a wide range of topics related to programming distributed memory machines. Distributed memory architectures, although having the potential to supply the very high levels of performance required to support future computing needs, present awkward programming problems. The major issue is to design methods which enable compilers to generate efficient distributed memory programs from relatively machine independent program specifications. This book is the compilation of papers describing a wide range of research efforts aimed at easing the task of programming distributed memory machines
β¦ Table of Contents
Content: SUPERB: Experiences and Future Research (M. Gerndt and H.P. Zima). Scientific Programming Languages for Distributed Memory Multiprocessors: Paradigms and Research Issues (M. Rosing, R.B. Schnabel and R.P. Weaver). Vienna Fortran - A Fortran Language Extension for Distributed Memory Multiprocessors (B.M. Chapman, P. Mehrotra and H.P. Zima). Compiler Parallelization of SIMPLE for a Distributed Memory Machine (K. Pingali and A. Rogers). Applications of the ''Phase Abstractions'' for Portable and Scalable Parallel Programming (L. Snyder). Nicke - C Extensions for Programming on Distributed Memory Machines (D. Malki and M. Snir). A Static Performance Estimator in the Fortran D Programming System (V. Balasundaram, G. Fox, K. Kennedy and U. Kremer). Compiler Support for Machine-Independent Parallel Programming in Fortran D (S. Hiranandani, K. Kennedy and Chau-Wen Tseng). PANDORE: A System to Manage Data Distribution (F. Andre, J.-L. Pazat and H. Thomas). Distributed Memory Compiler Methods for Irregular Problems - Data Copy Reuse and Runtime Partitioning (R. Das, R. Ponnusamy, J. Saltz and D. Mavriplis). Scheduling EPL Programs for Parallel Processing (B. Sinharoy, B. McKenney and B.K. Szymanski). Parallelizing Programs for Distributed-Memory Machines using the Crystal System (Marina Chen, Dong-Yuan Chen, Yu Hu, M. Jacquemin, Cheng-Yee Lin and Jan-Jan Wu). Iteration Space Tiling for Distributed Memory Machines (J. Ramanujam and P. Sadayappan). Systolic Loops (M. Wolfe). An Optimizing C Compiler for a Hypercube Multicomputer (L.H. Hamel, P.J. Hatcher and M.J. Quinn). The Paragon Programming Paradigm and Distributed Memory Multicomputers (A.P. Reeves and C.M. Chase).
π SIMILAR VOLUMES
<p><em>Language, Compilers and Run-time Systems for Scalable Computers</em> contains 20 articles based on presentations given at the third workshop of the same title, and 13 extended abstracts from the poster session. <br/> Starting with new developments in classical problems of parallel compiler de
<p>Scalable parallel systems or, more generally, distributed memory systems offer a challenging model of computing and pose fascinating problems regarding compiler optimization, ranging from language design to run time systems. Research in this area is foundational to many challenges from memory hie
<p>Scalable parallel systems or, more generally, distributed memory systems offer a challenging model of computing and pose fascinating problems regarding compiler optimization, ranging from language design to run time systems. Research in this area is foundational to many challenges from memory hie
<p><span>This book brings together two important trends: graph algorithms and high-performance computing. Efficient and scalable execution of graph processing applications in data or network analysis requires innovations at multiple levels: algorithms, associated data structures, their implementatio