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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
