Analyses and Optimizations for Shared Address Space Programs

@article{Krishnamurthy1996AnalysesAO,
  title={Analyses and Optimizations for Shared Address Space Programs},
  author={A. Krishnamurthy and K. Yelick},
  journal={J. Parallel Distributed Comput.},
  year={1996},
  volume={38},
  pages={130-144}
}
  • A. Krishnamurthy, K. Yelick
  • Published 1996
  • Computer Science
  • J. Parallel Distributed Comput.
  • We present compiler analyses and optimizations for explicitly parallel programs that communicate through a shared address space. [...] Key Method We improve the accuracy of their analysis by using additional information fromsynchronization analysis, which handles post?wait synchronization, barriers, and locks. We also make the analysis efficient by exploiting the common code image property of SPMD programs. We make no assumptions on the use of synchronization constructs: our transformations preserve program…Expand Abstract
    Analysis and optimization of explicitly parallel programs
    11
    Analysis of Partitioned Global Address Space Programs
    5
    Analyzing threads for shared memory consistency
    3
    Optimizing partitioned global address space programs for cluster architectures
    7
    DRFX: a simple and efficient memory model for concurrent programming languages
    90

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 35 REFERENCES
    Compiling for Distributed Memory Architectures
    45
    Static analysis of low-level synchronization
    105
    Distributed data access in AC
    43
    Weak ordering—a new definition
    408
    Empirical evaluation of the CRAY-T3D: a compiler perspective
    96
    Parallel programming in Split-C
    475
    The directory-based cache coherence protocol for the DASH multiprocessor
    626