Message routing schemes in a hypercube machine

Authors:
D. Raghupathy;M. R. Leuze;S. R. Schach
Affiliations:
Computer Science Department, Vanderbilt University, Box 1679, Station B, Nashville, TN;Computer Science Department, Vanderbilt University, Box 1679, Station B, Nashville, TN;Computer Science Department, Vanderbilt University, Box 1679, Station B, Nashville, TN
Venue:
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Year:
1988

Citing 1
Cited 2

A VLSI architecture for concurrent data structures

A VLSI architecture for concurrent data structures

A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks

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

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this study is to determine efficient routing schemes for message passing in a hypercube machine. Two different algorithms are considered, namely static routing in which the path of a message is predetermined by the addresses of the source and destination nodes, and dynamic routing where the decision as to the next node in the path is made by the current node on the basis of local information regarding queue lengths. In addition, various different prioritization schemes are compared for both static and dynamic routing. The results show that dynamic routing can be up to twice as efficient as static routing, provided priority is given to messages which have only a few hops to traverse or were transmitted early in the computation sequence.