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, D. Moor:

 Energy, Memory, and Runtime Tradeoffs for Implementing Collective Communication Operations

(Journal of Supercomputing Frontiers and Innovations. Vol 1, Nr. 2, pages 58--75, SuperFri Open Journal, ISSN: , Oct. 2014, )

Publisher Reference


Collective operations are among the most important communication operations in shared- and distributed-memory parallel applications. In this paper, we analyze the tradeoffs between energy, mem- ory, and runtime of different algorithms that implement such operations. We show that existing algo- rithms have varying behavior and that no known algorithm is optimal in all three regards. We also demonstrate examples where of three different algorithms solving the same problem, each algorithm is best in a different metric. We conclude by posing the challenge to explore the resulting tradeoffs in a more structured manner.


download article:
download slides:


  author={Torsten Hoefler and D. Moor},
  title={{Energy, Memory, and Runtime Tradeoffs for Implementing Collective Communication Operations}},
  journal={Journal of Supercomputing Frontiers and Innovations},
  publisher={SuperFri Open Journal},