Fast Collective Communication Algorithms for Reflective Memory Network Clusters (original) (raw)

2000

Abstract

In this paper, we present algorithms for efficiently implementing three collective communication operations on reflective memory network clusters: Broadcast, Barrier Synchronization and All-Reduce. These algorithms have been implemented as an extension to the Bill-Board Protocol, a low-latency communication protocol for reflective memory networks that we previously developed [6,7]. Simulated performance results are presented for these algorithms. The performance of the algorithms is evaluated in detail. A comparative study with Myrinet, a popular point-to-point switched interconnect for clusters is also presented.

Vijay Moorthy hasn't uploaded this paper.

Let Vijay know you want this paper to be uploaded.

Ask for this paper to be uploaded.