Banerjee / Padua / Gelernter | Languages and Compilers for Parallel Computing | Buch | 978-3-540-55422-6 | sack.de

Buch, Englisch, Band 589, 425 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1350 g

Reihe: Lecture Notes in Computer Science

Banerjee / Padua / Gelernter

Languages and Compilers for Parallel Computing

Fourth International Workshop, Santa Clara, California, USA, August 7-9, 1991. Proceedings
1992
ISBN: 978-3-540-55422-6
Verlag: Springer Berlin Heidelberg

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

Buch, Englisch, Band 589, 425 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1350 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-540-55422-6
Verlag: Springer Berlin Heidelberg


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.

Banerjee / Padua / Gelernter Languages and Compilers for Parallel Computing jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


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.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.