(Enter summary)
Abstract: This paper presents novel compiler optimizations for reducing synchronization overhead in compiler-parallelized scientific codes. A hybrid programming model is employed to combine the flexibility of the fork-join model with the precision and power of the singleprogram, multiple data (SPMD) model. By exploiting compiletime computation partitions, communication analysis can eliminate barrier synchronization or replace it with less expensive forms of synchronization. We show computation partitions ... (Update)
Cited by: More
Auto-CFD: Efficiently Parallelizing CFD Applications on Clusters - Li Xiao Xiaodong
(Correct)
Compile Time Barrier Synchronisation Minimisation - O'Boyle, Stöhr
(Correct)
Lock Coarsening: Eliminating Lock Overhead in Automatically.. - Diniz, Rinard (1996)
(Correct)
Active bibliography (related documents): More All
0.8: Efficient Machine-Independent Programming of High-Performance.. - Tseng (1995)
(Correct)
0.7: Communication Analysis for Shared and Distributed Memory Machines - Tseng
(Correct)
0.4: Reducing Synchronization Overhead for Compiler-Parallelized .. - Han, Tseng, Keleher (1997)
(Correct)
Similar documents based on text: More All
0.2: Memory Referencing Behavior in Compiler-Parallelized.. - Torrie, Martonosi..
(Correct)
0.1: Compile-time Synchronization Optimizations for Software DSMs - Han, Tseng (1998)
(Correct)
0.1: SUIF: An Infrastructure for Research on.. - Wilson, French.. (1994)
(Correct)
Related documents from co-citation: More All
22: for MIMD distributed-memory machines (context) - Hiranandani, Kennedy et al. - 1992
19: Detecting coarse-grain parallelism using an interprocedural parallelizing compil..
- Hall, Amarasinghe et al. - 1995
12: Compiler algorithm for Synchronization (context) - Midkiff, Padua - 1987
BibTeX entry: (Update)
C. Tseng. Compiler optimizations for eliminating barrier synchronization. In Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 144--155, Santa Barbara, CA, July 1995. http://citeseer.ist.psu.edu/tseng95compiler.html More
@inproceedings{ tseng95compiler,
author = "Chau-Wen Tseng",
title = "Compiler Optimizations for Eliminating Barrier Synchronization",
booktitle = "Proc. 5th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP'95",
address = "Santa Barbara, California",
pages = "144--155",
year = "1995",
url = "citeseer.ist.psu.edu/tseng95compiler.html" }
Citations (may not include all citations):
294
A loop transformation theory and an algorithm to maximize pa.. (context) - Wolf, Lam - 1991
277
Advanced compiler optimizations for supercomputers (context) - Padua, Wolfe - 1986
240
for MIMD distributed-memory machines (context) - Hiranandani, Kennedy et al. - 1992
237
Global optimizations for parallelism and locality on scalabl..
- Andersonand, Lam - 1993
173
SUIF: An infrastructure for research on parallelizing and op..
- Wilson - 1994
169
Data-parallel Programming on MIMD Computers (context) - Hatcher, Quinn - 1991
169
Scanning polyhedra with do loops
- Ancourt, Irigoin - 1991
146
Demonstration of automatic data partitioning techniques for ..
- Gupta, Banerjee - 1992
134
Communication optimization and code generation for distribut.. (context) - Amarasinghe, Lam - 1993
121
Using processor affinity in loop scheduling on shared-memory..
- Markatos, LeBlanc - 1994
113
Data and computation transformation for multiprocessors
- Anderson, Amarasinghe et al. - 1995
106
Automatic array privatization
- Tu, Padua - 1993
66
Automatic data layout using 0-1 integer programming
- Bixby, Kennedy et al. - 1994
37
Polaris: The next generation in parallelizing compilers
- Blume - 1994
35
The impact of synchronization and granularity on parallel sy..
- Chen, Su et al. - 1990
20
Compiler generated synchronization for DO loops (context) - Midkiff, Padua - 1986
19
Relaxing SIMD control flow constraints using loop transforma..
- Hanxleden, Kennedy - 1992
15
Automatic synchronization elimination in synchronous FORALLs
- Philippsen, Heinz - 1995
14
Synchronization issues in data-parallel languages
- Prakash, Dhagat et al. - 1993
14
Interprocedural analysis for parallelization: Design and exp.. (context) - Hall, Amarasinghe et al. - 1995
12
Synchronization minimization in a SPMD execution model
- Bodin, Kervella et al. - 1994
11
Automatic code distribution
- Ancourt, Irigoin - 1992
11
Compiler algorithms for event variable synchronization
- Li - 1991
11
Compiler techniques for data synchronization in nested paral.. (context) - Tang, Yew et al. - 1990
11
Static analysis of barrier synchronization in explicitly par..
- Jeremiassen, Eggers - 1994
10
A compiler-assisted approach to SPMD execution
- Cytron, Lipkis et al. - 1990
8
An evaluation of software distributed shared memory for next.. (context) - Dwarkadas, Keleher et al. - 1993
8
Optimizing parallel programs using affinity regions (context) - Appelbe, Lakshmanan - 1993
1
An iteration partition approachfor cache or local memory thr.. (context) - Fangand, Lu - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.umd.edu/~tseng/papers.html): More
Reducing Synchronization Overhead for Compiler-Parallelized .. - Han, Tseng, Keleher (1997)
(Correct)
Unified Compilation Techniques for Shared and.. - Tseng, Anderson.. (1995)
(Correct)
Eliminating Conflict Misses for High Performance Architectures - Rivera, Tseng (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC