Issue No. 06 - June (2001 vol. 12)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.932712
<p><b>Abstract</b>—In this paper, we propose an efficient barrier synchronization scheme on networks with arbitrary topologies. We first present a distributed method in building a barrier routing tree. The barrier messages can be delivered adaptively according to the hierarchy of the established barrier tree to void congestion and faulty nodes in the network. We then propose a new technique, called <it>bandwidth-preempting</it> technique, for a blocked barrier message to preempt a channel occupied by a data message so that the latency of a barrier message can be controlled without affecting much of the overall system performance. We also propose an analytical performance model and present simulation results for the performance evaluation of the proposed scheme. Performance evaluations show that the proposed scheme outperforms the existing algorithms for barrier synchronization.</p>
Barrier synchronization, network topology, tree-based routing, data message, barrier message, bandwidth-preempting technique.
Y. Sun, X. Lin and P. Y. Cheung, "Barrier Synchronization on Wormhole-Routed Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 12, no. , pp. 583-597, 2001.