International Journal of Parallel Programming

, Volume 17, Issue 1, pp 1–17

Two algorithms for barrier synchronization

  • Debra Hensgen
  • Raphael Finkel
  • Udi Manber
Article

DOI: 10.1007/BF01379320

Cite this article as:
Hensgen, D., Finkel, R. & Manber, U. Int J Parallel Prog (1988) 17: 1. doi:10.1007/BF01379320

Abstract

We describe two new algorithms for implementing barrier synchronization on a shared-memory multicomputer. Both algorithms are based on a method due to Brooks. We first improve Brooks' algorithm by introducing double buffering. Our dissemination algorithm replaces Brook's communication pattern with an information dissemination algorithm described by Han and Finkel. Our tournament algorithm uses a different communication pattern and generally requires fewer total instructions. The resulting algorithms improve Brook's original barrier by a factor of two when the number of processes is a power of two. When the number of processes is not a power of two, these algorithms improve even more upon Brooks' algorithm because absent processes need not be simulated. These algorithms share with Brooks' barrier the limitation that each of then processes meeting at the barrier must be assigned identifiersi such that 0≤i<n.

Key words

Barrierbroadcastdistributedparallelsynchronizationshared memory

Copyright information

© Plenum Publishing Corporation 1988

Authors and Affiliations

  • Debra Hensgen
    • 1
  • Raphael Finkel
    • 1
  • Udi Manber
    • 2
  1. 1.University of KentuckyLexington
  2. 2.University of ArizonaTucson