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:

 Fast Barrier Synchronization for InfiniBand

(In Proceedings of the 20th IEEE International Parallel & Distributed Processing Symposium (IPDPS), CAC'06 Workshop, presented in Rhodes, Greece, pages , ISBN: 1-4244-0054-6, Apr. 2006)


The MPI Barrier() call can be crucial for several applications and has been target of different optimizations since several decades. The best solution to the barrier problem scales with O(log2 N ) and uses the dissemination principle. A new method using an enhanced dis- semination principle and inherent network parallelism will be demonstrated in this paper. The new approach was able to speedup the barrier performance by 40% in relation to the best published algorithm. It is shown that it is possible to leverage the inherent hardware parallelism inside the InfiniBandTM network to lower the latency of the MPI Barrier() operation without additional costs. The principle of sending multiple messages in (pseudo-) parallel can be implemented into a well known algorithm to decrease the number of rounds and speed the overall operation up.


download article:
download slides:


  author={Torsten Hoefler and Torsten Mehlan and Frank Mietke and Wolfgang Rehm},
  title={{Fast Barrier Synchronization for InfiniBand}},
  booktitle={Proceedings of the 20th IEEE International Parallel \& Distributed Processing Symposium (IPDPS), CAC'06 Workshop},
  location={Rhodes, Greece},