Non quia difficilia sunt non audemus, sed quia non audemus difficilia sunt
Home -> Publications
Home
  Publications
    
all years
    2017
    2016
    2015
    2014
    2013
    2012
    2011
    2010
    2009
    2008
    2007
    2006
    2005
    2004
    theses
    techreports
    presentations
    edited volumes
    conferences
  Awards
  Research
  Teaching
  BLOG
  Miscellaneous
  Full CV [pdf]






  Events








  Past Events





Publications of Torsten Hoefler
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.

T. Hoefler, L. Cerquetti, T. Mehlan, F. Mietke and W. Rehm:

 A practical approach to the rating of barrier algorithms using the LogP model and Open-MPI

(In Proceedings of the 2005 International Conference on Parallel Processing Workshops, presented in Oslo, Norway, pages 562--569, ISBN: 0-7659-2381-1, Jun. 2005)

Abstract

Large-scale parallel applications performing global syn- chronization may spend a significant amount of execution time waiting for the completion of a barrier operation. Consequently, numerous research works have focused on reduc- ing the communication costs of synchronization primitives. However, so far there has been no exhaustive comparison of barrier algorithms. This paper will investigate significant representatives of this family of algorithms and evaluate their diverging characteristics, with the purpose of assessing their properties within the context of a specific scenario. The first part of this work will introduce four run time complexity classes, to which all barrier algorithms are known to belong. Then, the LogP model will be used to analyze the behavior and predict the running time of a representative algorithm of each class. As these performance predictions will be scrutinized with the help of measurements conducted on original implementations based on the Open MPI framework, this work will show how to leverage the flexible component architecture of this new MPI implementation, which has proved to be an ideal research tool.

Documents

download article:
download slides:
 

BibTeX

@inproceedings{hoefler-icpp-05,
  author={T. Hoefler and L. Cerquetti and T. Mehlan and F. Mietke and W. Rehm},
  title={{A practical approach to the rating of barrier algorithms using the LogP model and Open-MPI}},
  year={2005},
  month={Jun.},
  pages={562--569},
  booktitle={Proceedings of the 2005 International Conference on Parallel Processing Workshops},
  location={Oslo, Norway},
  isbn={0-7659-2381-1},
  source={http://www.unixer.de/~htor/publications/},
}

serving: 54.144.194.161:37428© Torsten Hoefler