Implementing Split-Mode Barriers in OpenSHMEM

  • Michael A. Raymond
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8356)


Barriers synchronize the state of many processing elements working in parallel. No worker may leave a barrier before all the others have arrived. High performance applications hide latency by keeping a large number of operations in progress asynchronously. Since barriers synchronize all these operations, maximum performance requires that barriers have as little overhead as possible. When some workers arrive at a barrier much later than others, the early arrivers must sit idle waiting for them. Split-mode barriers provide barrier semantics while also allowing the early arrivers to make progress on other tasks. In this paper we describe the process and several challenges in developing split-mode barriers in the OpenSHMEM programming environment.


OpenSHMEM barrier split-mode 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
  2. 2.
    MPI Forum: MPI: A Message Passing Interface. In: Proceedings of Supercomputing (1993) Google Scholar
  3. 3.
    UPC Consortium, UPC Language Specifications, v1.2. Lawrence Berkeley National Lab, Tech. Rep. LBNL-59208 (2005) Google Scholar
  4. 4.
    Hengsen, D., Finkel, R., Manber, U.: Two Algorithms for Barrier Synchronization. International Journal of Parallel Programming 17, 1–17 (1988)CrossRefGoogle Scholar
  5. 5.
    Message Passing Interface Forum: MPI: A Message-Passing Interface Standard Version 3.0 (2012)Google Scholar
  6. 6.
  7. 7.
    Hoefler, T., Siebert, C., Lumsdaine, A.: Scalable Communication Protocols for Dynamic Sparse Data Exchange. In: Principles and Practice of Parallel Programming. ACM (2010)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Michael A. Raymond
    • 1
  1. 1.Silicon Graphics InternationalUSA

Personalised recommendations