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

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 als