Languages and Compilers for Parallel Computing: 6th International Workshop Portland, Oregon, USA, August 12–14, 1993 Proceedings

Martin C. Carlisle, Anne Rogers (auth.), Utpal Banerjee, David Gelernter, Alex Nicolau, David Padua (eds.)3540576592, 9783540576594

This book contains papers selected for presentation at the Sixth Annual Workshop on Languages and Compilers for Parallel Computing. The workshop washosted by the Oregon Graduate Institute of Science and Technology. All the major research efforts in parallel languages and compilers are represented in this workshop series. The 36 papers in the volume aregrouped under nine headings: dynamic data structures, parallel languages, High Performance Fortran, loop transformation, logic and dataflow language implementations, fine grain parallelism, scalar analysis, parallelizing compilers, and analysis of parallel programs. The book represents a valuable snapshot of the state of research in the field in 1993.

---

Table of contents :
Early experiences with Olden….Pages 1-20
Arbitrary order operations on trees….Pages 21-36
Analysis of dynamic structures for efficient parallel execution….Pages 37-56
On automatic data structure selection and code generation for sparse computations….Pages 57-75
Synchronization issues in data-parallel languages….Pages 76-95
ZPL: An array sublanguage….Pages 96-114
Event-based composition of concurrent programs….Pages 115-138
Adaptive parallelism on multiprocessors: Preliminary experience with Piranha on the CM-5….Pages 139-151
Slicing analysis and indirect accesses to distributed arrays….Pages 152-168
Do&Merge: Integrating parallel loops and reductions….Pages 169-183
Automatic support for data distribution on distributed memory multiprocessor systems….Pages 184-199
A compilation approach for Fortran 90D/HPF compilers….Pages 200-215
A framework for exploiting data availability to optimize communication….Pages 216-233
The alignment-distribution graph….Pages 234-252
An overview of a compiler for scalable parallel machines….Pages 253-272
Toward a compile-time methodology for reducing false sharing and communication traffic in shared virtual memory systems….Pages 273-289
Program transformation for locality using affinity regions….Pages 290-300
Maximizing loop parallelism and improving data locality via loop fusion and distribution….Pages 301-320
Align and distribute-based linear loop transformations….Pages 321-339
Extending software pipelining techniques for scheduling nested loops….Pages 340-357
A methodology for generating efficient disk-based algorithms from tensor product formulas….Pages 358-373
Loop transformations for Prolog programs….Pages 374-389
A multithreaded implementation of Id using P-RISC graphs….Pages 390-405
Acceleration of first and higher order recurrences on processors with instruction level parallelism….Pages 406-429
Efficient compile-time/run-time contraction of fine grain data parallel codes….Pages 430-448
VISTA: The Visual Interface for Scheduling Transformations and Analysis….Pages 449-460
Efficiently computing φ-nodes on-the-fly….Pages 461-476
Construction of thinned gated single-assignment form….Pages 477-499
Automatic array privatization….Pages 500-521
FIAT: A framework for interprocedural analysis and transformation….Pages 522-545
An exact method for analysis of value-based array data dependences….Pages 546-566
Symbolic analysis: A basis for parallelization, optimization, and scheduling of programs….Pages 567-585
Towards a non-intrusive approach for monitoring distributed computations through perturbation analysis….Pages 586-601
Efficient computation of precedence information in parallel programs….Pages 602-616
Trace size vs parallelism in trace-and-replay debugging of shared-memory programs….Pages 617-632
Parallel Program Graphs and their classification….Pages 633-655