Languages and Compilers for Parallel Computing 10th International Workshop, LCPC'97, Minneapolis, Minnesota, USA, August 7-9, 1997. Proceedings - neues Buch

EAN (ISBN-13): 9783540644729
ISBN (ISBN-10): 3540644725
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1998
Herausgeber: Springer Berlin
448 Seiten
Gewicht: 0,672 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-06-03T18:18:24+02:00 (Zurich)
Detailseite zuletzt geändert am 2024-03-14T16:53:44+01:00 (Zurich)
ISBN/EAN: 9783540644729

ISBN - alternative Schreibweisen:
3-540-64472-5, 978-3-540-64472-9
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: chatterjee, huang huang, siddharta, chung, pen
Titel des Buches: proceedings international workshop, 10th august, language usa, minnesota, languages compilers for parallel computing, international 1997, lecture notes computer science, siddharta, compiler, international volume

---

Daten vom Verlag:

Autor/in: Zhiyuan Li; Pen-Chung Yew; Siddharta Chatterjee; Chua-Huang Huang; P. Sadayappan; David Sehr
Titel: Lecture Notes in Computer Science; Languages and Compilers for Parallel Computing - 10th International Workshop, LCPC'97, Minneapolis, Minnesota, USA, August 7-9, 1997. Proceedings
Verlag: Springer; Springer Berlin
440 Seiten
Erscheinungsjahr: 1998-04-29
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XII, 440 p.

BC; Hardcover, Softcover / Informatik, EDV/Programmiersprachen; Compiler und Übersetzer; Verstehen; Java; Lex; Performance; Scala; compiler; data structures; parallel programming; programming; Compilers and Interpreters; Computer System Implementation; Programming Techniques; Theory of Computation; Arithmetic and Logic Structures; Systemanalyse und -design; Computerprogrammierung und Softwareentwicklung; Theoretische Informatik; Computerhardware; EA

Quantifying the multi-level nature of tiling interactions.- Reuse-driven tiling for data locality.- Table-lookup approach for compiling two-level data-processor mappings in HPF.- Code generation for complex subscripts in data-parallel programs.- Automatic data decomposition for message-passing machines.- Program analysis of overlap area usage in self-similar parallel programs.- Analysis and optimization of explicity parallel programs using the parallel program graph representation.- Concurrent static single assignment form and constant propagation for explicitly parallel programs.- Identifying DEF/USE information of statements that construct and traverse dynamic recursive data structures.- Program optimization for concurrent multithreaded architectures.- Interactive compilation and performance analysis with URSA MINOR.- The SPNT test: A new technology for run-time speculative parallelization of loops.- Lowering HPF procedure interface to a canonical representation.- PCRC-based HPF compilation.- Data parallel language extensions for exploiting locality in irregular problems.- Simplifying control flow in compiler-generated parallel code.- Reducing synchronization overhead for compiler-parallelized codes on software DSMs (extended abstract).- An array data flow analysis based communication optimizer.- A compiler abstraction for machine independent parallel communication generation.- The aggregate function API: It's not just for PAPERS anymore.- Definition of the F?? extension to fortran 90.- Exploiting parallelism through directives on the nano-threads programming model.- “Optimal” parallelism through integration of data and control parallelism: A case study in complete parallelization.- Java as a language for scientific parallel programming.- Experiences with loopparallelization in javar (A prototype restructuring compiler for java).- NAMD: A case study in multilingual parallel programming.- A unified software pipeline construction scheme for modulo scheduled loops.- A systematic approach to branch speculation.- Integrating automatic data alignment and array operation synthesis to optimize data parallel programs.- A compiler for the ibm scalable shared memory project machine — extended abstract.- Automatic data layout with read-only replication and memory constraints.- Static analysis of recursive data structures.