Languages and Compilers for Parallel Computing: Fourth International Workshop Santa Clara, California, USA, August 7–9 1991 Proceedings

✍ Scribed by G. Agha, C. Houck, R. Panwar (auth.), Utpal Banerjee, David Gelernter, Alex Nicolau, David Padua (eds.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 1992
• Tongue: English
• Leaves: 428
• Series: Lecture Notes in Computer Science 589
• Edition: 1
• Category: Library

✦ Synopsis

This volume contains the proceedings of the Fourth Workshop on Languages andCompilers for Parallel Computing, held in Santa Clara, California, in August1991. The purpose of the workshop, held every year since 1988, is to bring together the leading researchers on parallel programming language designand compilation techniques for parallel computers. The papers in this book cover several important topics including: (1) languages and structures to represent programs internally in the compiler, (2) techniques to analyzeand manipulate sequential loops in order to generate a parallel version, (3)techniques to detect and extract fine-grain parallelism, (4) scheduling and memory-management issues in automatically generated parallel programs, (5) parallel programming language designs, and (6) compilation of explicitly parallel programs. Together, the papers give a good overview of the research projects underway in 1991 in this field.

✦ Table of Contents

Distributed execution of actor programs....Pages 1-17
An overview of the Fortran D programming system....Pages 18-34
The interaction of the formal and the practical in parallel programming environment development: CODE....Pages 35-49
Hierarchical concurrency in Jade....Pages 50-64
Experience in the automatic parallelization of four Perfect-Benchmark programs....Pages 65-83
Programming SIMPLE for parallel portability....Pages 84-98
Compilation of Id....Pages 99-121
An executable representation of distance and direction....Pages 122-136
Integrating scalar optimization and parallelization....Pages 137-151
Optimization of data/control conditions in task graphs....Pages 152-168
Recognizing and parallelizing bounded recurrences....Pages 169-185
Communication-free hyperplane partitioning of nested loops....Pages 186-200
Parallelizing loops with indirect array references or pointers....Pages 201-217
Register allocation, renaming and their impact on fine-grain parallelism....Pages 218-235
Data flow and dependence analysis for instruction level parallelism....Pages 236-250
Extending conventional flow analysis to deal with array references....Pages 251-265
Run-time management of Lisp parallelism and the Hierarchical Task Graph program representation....Pages 266-282
A multi-grain parallelizing compilation scheme for OSCAR (optimally scheduled advanced multiprocessor)....Pages 283-297
Balanced loop partitioning using GTS....Pages 298-312
An iteration partition approach for cache or local memory thrashing on parallel processing....Pages 313-327
On estimating and enhancing cache effectiveness....Pages 328-343
Reduction of cache coherence overhead by compiler data layout and loop transformation....Pages 344-358
Loop storage optimization for dataflow machines....Pages 359-373
Optimal partitioning of programs for data flow machines....Pages 374-388
A foundation for advanced compile-time analysis of linda programs....Pages 389-404
Analyzing programs with explicit parallelism....Pages 405-419

✦ Subjects

Computation by Abstract Devices; Programming Techniques; Programming Languages, Compilers, Interpreters; Arithmetic and Logic Structures; Computer Graphics