Cantitate/Preț
Produs
Total produse
Vezi coșul
Languages and Compilers for Parallel Computing: 6th International Workshop, Portland, Oregon, USA, August 12 - 14, 1993. Proceedings de Utpal Banerjee

Languages and Compilers for Parallel Computing: 6th International Workshop, Portland, Oregon, USA, August 12 - 14, 1993. Proceedings: Lecture Notes in Computer Science, cartea 768

Editat de Utpal Banerjee, David Gelernter, Alex Nicolau, David Padua
en Limba Engleză Paperback – 28 ian 1994
This book contains papers selected for presentation at theSixth Annual Workshop on Languages and Compilers forParallel Computing. The workshop washosted by the OregonGraduate Institute of Science and Technology. All the majorresearch efforts in parallel languages and compilers arerepresented in this workshop series.The 36 papers in the volume aregrouped under nine headings:dynamic data structures, parallel languages, HighPerformance Fortran, loop transformation, logic and dataflowlanguage implementations, fine grain parallelism, scalaranalysis, parallelizing compilers, and analysis of parallelprograms. The book represents a valuable snapshot of thestate of research in the field in 1993.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (3) 32166 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 22 apr 1992 32166 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 8 dec 1993 32886 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 28 ian 1994 62906 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 62906 lei

Preț vechi: 78632 lei
-20% Nou

Puncte Express: 944
Preț estimativ în valută:
12047€ • 13037$ • 10043£

Carte tipărită la comandă

Livrare economică 09-23 decembrie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540576594
ISBN-10: 3540576592
Pagini: 676
Ilustrații: XIII, 655 p.
Dimensiuni: 155 x 235 x 35 mm
Greutate: 0.93 kg
Ediția:1994
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.