DMCA
Compiler Optimizations for Eliminating Barrier Synchronization (1995)
| Venue: | In Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming |
| Citations: | 90 - 13 self |
BibTeX
@INPROCEEDINGS{Tseng95compileroptimizations,
author = {Chau-wen Tseng},
title = {Compiler Optimizations for Eliminating Barrier Synchronization},
booktitle = {In Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming},
year = {1995},
pages = {144--155}
}
Share
 |
 |
 |
 |
||
OpenURL
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 and data communication can be represented as systems of symbolic linear inequalities for high flexibility and precision. These optimizations has been implemented in the Stanford SUIF compiler. We extensively evaluate their performance using standard benchmark suites. Experimental results show barrier synchronization is reduced 29% on averageand by several orders of magnitude for certain programs. 1 Introduction Parallel machines with shared address spaces and coherent caches provide an attracti...
Keyphrases
eliminating barrier synchronization compiler optimization barrier synchronization certain program data communication novel compiler optimization fork-join model compiletime computation partition synchronization overhead compiler-parallelized scientific code coherent cache several order introduction parallel machine multiple data communication analysis standard benchmark suite hybrid programming model address space computation partition expensive form stanford suif compiler symbolic linear inequality experimental result high flexibility
