Languages and Compilers for Parallel Computing
Editat de Utpal Banerjee, David Gelernter, Alex Nicolau, David Paduaen Limba Engleză Paperback – 28 ian 1994
Preț: 643.13 lei
Preț vechi: 803.92 lei
-20%
Puncte Express: 965
Carte tipărită la comandă
Livrare economică 08-22 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540576594
ISBN-10: 3540576592
Pagini: 676
Ilustrații: XIII, 655 p.
Dimensiuni: 155 x 235 x 37 mm
Greutate: 1.01 kg
Ediția:1994
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540576592
Pagini: 676
Ilustrații: XIII, 655 p.
Dimensiuni: 155 x 235 x 37 mm
Greutate: 1.01 kg
Ediția:1994
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Early experiences with Olden.- Arbitrary order operations on trees.- Analysis of dynamic structures for efficient parallel execution.- On automatic data structure selection and code generation for sparse computations.- Synchronization issues in data-parallel languages.- ZPL: An array sublanguage.- Event-based composition of concurrent programs.- Adaptive parallelism on multiprocessors: Preliminary experience with Piranha on the CM-5.- Slicing analysis and indirect accesses to distributed arrays.- Do&Merge: Integrating parallel loops and reductions.- Automatic support for data distribution on distributed memory multiprocessor systems.- A compilation approach for Fortran 90D/HPF compilers.- A framework for exploiting data availability to optimize communication.- The alignment-distribution graph.- An overview of a compiler for scalable parallel machines.- Toward a compile-time methodology for reducing false sharing and communication traffic in shared virtual memory systems.- Program transformation for locality using affinity regions.- Maximizing loop parallelism and improving data locality via loop fusion and distribution.- Align and distribute-based linear loop transformations.- Extending software pipelining techniques for scheduling nested loops.- A methodology for generating efficient disk-based algorithms from tensor product formulas.- Loop transformations for Prolog programs.- A multithreaded implementation of Id using P-RISC graphs.- Acceleration of first and higher order recurrences on processors with instruction level parallelism.- Efficient compile-time/run-time contraction of fine grain data parallel codes.- VISTA: The Visual Interface for Scheduling Transformations and Analysis.- Efficiently computing ?-nodes on-the-fly.- Construction of thinned gatedsingle-assignment form.- Automatic array privatization.- FIAT: A framework for interprocedural analysis and transformation.- An exact method for analysis of value-based array data dependences.- Symbolic analysis: A basis for parallelization, optimization, and scheduling of programs.- Towards a non-intrusive approach for monitoring distributed computations through perturbation analysis.- Efficient computation of precedence information in parallel programs.- Trace size vs parallelism in trace-and-replay debugging of shared-memory programs.- Parallel Program Graphs and their classification.