Issue No. 06 - June (1998 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.689440
<p><b>Abstract</b>—In this paper, we consider a tree-based routing scheme for supporting barrier synchronization on scalable parallel computers with a 2D mesh network. Based on the characteristics of a standard programming interface, the scheme builds a <it>collective synchronization</it> (CS) tree among the participating nodes using a distributed algorithm. When the routers are set up properly with the CS tree information, barrier synchronization can be accomplished very efficiently by passing simple messages. Performance evaluations show that our proposed method performs better than previous path-based approaches and is less sensitive to variations in group size and startup delay. However, our scheme has the extra overhead of building the CS tree. Thus, it is more suitable for parallel iterative computations in which the same barrier is invoked repetitively.</p>
Barrier synchronization, collective communication, interconnection network, message passing interface, multicast.
J. Yang and C. King, "Designing Tree-Based Barrier Synchronization on 2D Mesh Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 9, no. , pp. 526-534, 1998.