Languages and Compilers for Parallel Computing
Editat de Utpal Banerjee, David Gelernter, Alex Nicolau, David Paduaen Limba Engleză Paperback – 22 apr 1992
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (3) | 329.14 lei 6-8 săpt. | |
| Springer – 22 apr 1992 | 329.14 lei 6-8 săpt. | |
| Springer – 8 dec 1993 | 337.30 lei 6-8 săpt. | |
| Springer – 28 ian 1994 | 643.13 lei 6-8 săpt. |
Preț: 329.14 lei
Preț vechi: 411.42 lei
-20%
Puncte Express: 494
Preț estimativ în valută:
58.20€ • 66.74$ • 50.30£
58.20€ • 66.74$ • 50.30£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540554226
ISBN-10: 354055422X
Pagini: 436
Ilustrații: XI, 425 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354055422X
Pagini: 436
Ilustrații: XI, 425 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:1992
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.