Languages and Compilers for Parallel Computing de Utpal Banerjee

Languages and Compilers for Parallel Computing: Fourth International Workshop, Santa Clara, California, USA, August 7-9, 1991. Proceedings: Lecture Notes in Computer Science, cartea 589

Utpal Banerjee

David Gelernter

Alex Nicolau

David Padua

en Limba Engleză Paperback – 22 apr 1992

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.

Citește tot Restrânge

	Preț	Express
Paperback (1)	638^.44 lei 6-8 săpt.
Springer Berlin, Heidelberg – 28 ian 1994	638^.44 lei 6-8 săpt.
Paperback (1)	326^.55 lei 6-8 săpt.
Springer Berlin, Heidelberg – 22 apr 1992	326^.55 lei 6-8 săpt.
Paperback (1)	333^.87 lei 6-8 săpt.
Springer Berlin, Heidelberg – 8 dec 1993	333^.87 lei 6-8 săpt.

Preț

Express

Paperback (1)

638^.44 lei 6-8 săpt.

Springer Berlin, Heidelberg – 28 ian 1994

638^.44 lei 6-8 săpt.

Paperback (1)

326^.55 lei 6-8 săpt.

Springer Berlin, Heidelberg – 22 apr 1992

326^.55 lei 6-8 săpt.

Paperback (1)

333^.87 lei 6-8 săpt.

Springer Berlin, Heidelberg – 8 dec 1993

333^.87 lei 6-8 săpt.

Din seria Lecture Notes in Computer Science

20%

Preț: 323^.14 lei
20%

Preț: 461^.32 lei
20%

Preț: 460^.98 lei
20%

Preț: 390^.41 lei
20%

Preț: 526^.98 lei
15%

Preț: 388^.21 lei
20%

Preț: 461^.21 lei
20%

Preț: 390^.08 lei
20%

Preț: 496^.30 lei
20%

Preț: 461^.21 lei
20%

Preț: 389^.45 lei
15%

Preț: 461^.53 lei
20%

Preț: 389^.63 lei
20%

Preț: 496^.68 lei
20%

Preț: 461^.70 lei
20%

Preț: 251^.97 lei
20%

Preț: 390^.86 lei
20%

Preț: 532^.16 lei
20%

Preț: 461^.52 lei
20%

Preț: 255^.72 lei
20%

Preț: 498^.10 lei
20%

Preț: 497^.19 lei
20%

Preț: 499^.02 lei
20%

Preț: 389^.82 lei
20%

Preț: 390^.92 lei
20%

Preț: 390^.86 lei
20%

Preț: 390^.92 lei
20%

Preț: 390^.08 lei
20%

Preț: 461^.45 lei
20%

Preț: 392^.36 lei
20%

Preț: 460^.75 lei
20%

Preț: 461^.32 lei
20%

Preț: 389^.90 lei
20%

Preț: 639^.26 lei
20%

Preț: 390^.66 lei
20%

Preț: 391^.57 lei
20%

Preț: 389^.57 lei
20%

Preț: 497^.97 lei
20%

Preț: 462^.36 lei
20%

Preț: 460^.67 lei
20%

Preț: 423^.95 lei
5%

Preț: 515^.91 lei
15%

Preț: 535^.55 lei
20%

Preț: 531^.90 lei
20%

Preț: 403^.00 lei
20%

Preț: 535^.41 lei
20%

Preț: 461^.25 lei
20%

Preț: 498^.17 lei
20%

Preț: 461^.52 lei
20%

Preț: 249^.77 lei

Cuprins

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.