Languages and Compilers for Parallel Computing
10th International Workshop, LCPC'97, Minneapolis, Minnesota, USA, August 7-9, 1997. Proceedings
Published on 29. April 1998
Book
Paperback/Softback
XII, 440 pages
978-3-540-64472-9 (ISBN)
Description
This book constitutes the thoroughly refereed post-workshop proceedings of the 10th International Workshop on Languages and Compilers for Parallel Computing, LCPC'97, held in Minneapolis, Minnesota, USA in August 1997
The book presents 28 revised full papers together with four posters; all papers were carefully selected for presentation at the workshop and went through a thorough reviewing and revision phase afterwards. The papers are organized in topical sections on data locality, program analysis, automatic parallelization, HPF extensions and compilers, synchronization and communication, parallel programming models and language extensions, and instruction level parallelism.
The book presents 28 revised full papers together with four posters; all papers were carefully selected for presentation at the workshop and went through a thorough reviewing and revision phase afterwards. The papers are organized in topical sections on data locality, program analysis, automatic parallelization, HPF extensions and compilers, synchronization and communication, parallel programming models and language extensions, and instruction level parallelism.
More details
Series
Edition
1998 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
XII, 440 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 25 mm
Weight
674 gr
ISBN-13
978-3-540-64472-9 (9783540644729)
DOI
10.1007/BFb0032679
Schweitzer Classification
Content
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.