A Fast Tree-Based Barrier Synchroization on Switch-Based Irregular Networks

Authors:
Sangman Moh;Chansu Yu;Hee Yong Youn;Dongsoo Han;Ben Lee;Dongman Lee
Affiliations:
-;-;-;-;-;-
Venue:
HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
Year:
2000

Citing 13
Cited 0

Multicasting protocols for high-speed, wormhole-routing local area networks

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Parallel programming with MPI

Parallel programming with MPI
System area network mapping

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
In search of clusters (2nd ed.)

In search of clusters (2nd ed.)
A Cost and Speed Model for k-ary n-Cube Wormhole Routers

IEEE Transactions on Parallel and Distributed Systems
Efficient techniques for nested and disjoint barrier synchronization

Journal of Parallel and Distributed Computing - Special issue on compilation and architectural support for parallel applications
High Performance Cluster Computing: Architectures and Systems

High Performance Cluster Computing: Architectures and Systems
A Survey of Wormhole Routing Techniques in Direct Networks

Computer
Myrinet: A Gigabit-per-Second Local Area Network

IEEE Micro
Where to Provide Support for Efficient Multicasting in Irregular Networks: Network Interface or Switch?

ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
Multicast on Irregular Switch-based Networks with Wormhole Routing

HPCA '97 Proceedings of the 3rd IEEE Symposium on High-Performance Computer Architecture
Characterization of Deadlocks in Irregular Networks

ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
Tree-Based Multicasting in Wormhole-Routed Irregular Topologies

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a Barrier Tree for Irregular Networks (BTIN) and a barrier synchronization scheme using BTIN for switch-based cluster systems. The synchronization latency of the proposed BTIN scheme is asymptotically O(log n) while that of the fastest scheme reported in the literature is bounded by O(n), where n is the number of member nodes. Extensive simulation study shows that, for the group size of 256, the BTIN scheme improves the synchronization latency by a factor of 3.3 ∼ 3.8, and is more scalable than conventional schemes with less network traffic.