Languages and Compilers for Parallel Computing

Fourth International Workshop, Santa Clara, California, USA, August 7-9, 1991. Proceedings

AvUtpal Banerjee,David Gelernter

Häftad, Engelska, 1992

Del i serien Lecture Notes in Computer Science

581 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This volume contains the proceedings of the Fourth Workshopon Languages andCompilers for Parallel Computing, held inSanta Clara, California, in August1991. The purpose of theworkshop, held every year since 1988, is to bring togetherthe leading researchers on parallel programming languagedesignand compilation techniques for parallel computers.The papers in this book cover several important topicsincluding: (1) languages and structures to representprograms internally in the compiler, (2) techniques toanalyzeand manipulate sequential loops in order to generatea parallel version, (3)techniques to detect and extractfine-grain parallelism, (4) scheduling and memory-managementissues in automatically generated parallel programs, (5)parallel programming language designs, and (6) compilationof explicitly parallel programs.Together, the papers give a good overview of the researchprojects underway in 1991 in this field.

Produktinformation

Utgivningsdatum:1992-04-22
Mått:155 x 233 x 24 mm
Vikt:657 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:425
Upplaga:1992
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540554226

Utforska kategorier

Innehållsförteckning

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.