Copyright Notice:

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Publications of SPCL

T. Hoefler, T. Mehlan, F. Mietke, W. Rehm:

 A Survey of Barrier Algorithms for Coarse Grained Supercomputers

(Chemnitzer Informatik Berichte. Vol 04, Nr. 03, presented in Chemnitz, Germany, ISSN: 0947-5152, Dec. 2004)


There are several different algorithms available to perform a synchronization of multiple processors. Some of them support only shared memory architectures or very fine grained supercomputers. This work gives an overview about all currently known algorithms which are suitable for distributed shared memory architectures and message passing based computer systems (loosely coupled or coarse grained supercomputers). No absolute decision can be made for choosing a barrier algorithm for a machine. Several architectural aspects have to be taken into account. The overview about known barrier algorithms given in this work is mostly targeted to implementors of libraries supporting collective communication (such as MPI).


download article:


  author={Torsten Hoefler and Torsten Mehlan and Frank Mietke and Wolfgang Rehm},
  title={{A Survey of Barrier Algorithms for Coarse Grained Supercomputers}},
  journal={Chemnitzer Informatik Berichte},
  institution={Technical University of Chemnitz},
  location={Chemnitz, Germany},