A New Communication Mechanism for Cluster Computing

Authors:
Andres Ibañez;Valentin Puente;José A. Gregorio;Ramón Beivide
Affiliations:
-;-;-;-
Venue:
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Year:
2001

Citing 5
Cited 0

The Chaos Router

IEEE Transactions on Computers
A Necessary and Sufficient Condition for Deadlock-Free Routing in Cut-Through and Store-and-Forward Networks

IEEE Transactions on Parallel and Distributed Systems
A Comparison of Router Architectures for Virtual Cut-Through and Wormhole Switching in a NOWEnvironment

IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Efficient Adaptive Routing in Networks of Workstations with Irregular Topology

CANPC '97 Proceedings of the First International Workshop on Communication and Architectural Support for Network-Based Parallel Computing
Adaptive Bubble Router: A Design to Improve Performance in Torus Networks

ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new fully adaptive routing algorithm for irregular networks is proposed in this paper. When compared to the most relevant routing proposals for networks of workstations with irregular topology, our routing algorithm has the characteristic of avoiding the existence of packet deadlock without using virtual channels. For a 256-node network, uniform traffic, and virtual cut-through flow control, our mechanism can outperform the classic up*/down* algorithm by a factor of 10. In fact, for medium size networks, the new technique can obtain better performance than its virtual channel-based counterparts even though it has a lower hardware complexity.