Languages and Compilers for Parallel Computing
Fourth International Workshop, Santa Clara, California, USA, August 7-9, 1991. Proceedings
Published on 22. April 1992
Book
Paperback/Softback
XI, 425 pages
978-3-540-55422-6 (ISBN)
Description
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.
More details
Series
Edition
1992 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
XI, 425 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 24 mm
Weight
657 gr
ISBN-13
978-3-540-55422-6 (9783540554226)
DOI
10.1007/BFb0038653
Schweitzer Classification
Content
Distributed execution of actor programs.- An overview of the Fortran D programming system.- The interaction of the formal and the practical in parallel programming environment development: CODE.- Hierarchical concurrency in Jade.- Experience in the automatic parallelization of four Perfect-Benchmark programs.- Programming SIMPLE for parallel portability.- Compilation of Id.- An executable representation of distance and direction.- Integrating scalar optimization and parallelization.- Optimization of data/control conditions in task graphs.- Recognizing and parallelizing bounded recurrences.- Communication-free hyperplane partitioning of nested loops.- Parallelizing loops with indirect array references or pointers.- Register allocation, renaming and their impact on fine-grain parallelism.- Data flow and dependence analysis for instruction level parallelism.- Extending conventional flow analysis to deal with array references.- Run-time management of Lisp parallelism and the Hierarchical Task Graph program representation.- A multi-grain parallelizing compilation scheme for OSCAR (optimally scheduled advanced multiprocessor).- Balanced loop partitioning using GTS.- An iteration partition approach for cache or local memory thrashing on parallel processing.- On estimating and enhancing cache effectiveness.- Reduction of cache coherence overhead by compiler data layout and loop transformation.- Loop storage optimization for dataflow machines.- Optimal partitioning of programs for data flow machines.- A foundation for advanced compile-time analysis of linda programs.- Analyzing programs with explicit parallelism.