Optimizing Parallel Programs with Explicit Synchronization (1995)
| Venue: | In Proceedings of the ACM SIGPLAN '95 Conference on Programming Language Design and Implementation |
| Citations: | 32 - 1 self |
BibTeX
@INPROCEEDINGS{Krishnamurthy95optimizingparallel,
author = {Arvind Krishnamurthy and Katherine Yelick},
title = {Optimizing Parallel Programs with Explicit Synchronization},
booktitle = {In Proceedings of the ACM SIGPLAN '95 Conference on Programming Language Design and Implementation},
year = {1995},
pages = {196--204}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
: We present compiler analyses and optimizations for explicitly parallel programs that communicate through a shared address space. Any type of code motion on explicitly parallel programs requires a new kind of analysis to ensure that operations reordered on one processor cannot be observed by another. The analysis, based on work by Shasha and Snir, checks for cycles among interfering accesses. We improve the accuracy of their analysis by using additional information from post-wait synchronization, barriers, and locks. We demonstrate the use of this analysis by optimizing remote access on distributed memory machines. The optimizations include message pipelining, to allow multiple outstanding remote memory operations, conversion of two-way to one-way communication, and elimination of communication through data re-use. The performance improvements are as high as 20-35% for programs running on a CM-5 multiprocessor using the Split-C language as a global address layer. 1 Introduction Opti...
