New Wormhole Routing Algorithms for Multicomputers

Abstract. Development of wormhole routing techniques so far has been largely independent of the results available for store-and-forward routing in literature. In this paper, we provide a general result which enables us to design deadlock-free wormhole routing algorithms from store-and-forward routing algorithms that satisfy certain criteria. We illustrate this result by developing fully-adaptive deadlock-free wormhole routing algorithms from two well-known storeand-forward algorithms: the positive- and negativehop algorithms based on the number of hops taken by messages. We compare the negative-hop algorithm with the commonly used non-adaptive e-cube and recently proposed partially adaptive north-last algorithm.

• Type: Conference
• Year: 1993
• Where: IPPS
• Authors: Rajendra V. Boppana, Suresh Chalasani
• Keywords: Distributed And Parallel Computing, IPPS 1993, Store-and-forward Routing, Wormhole Routing, Wormhole Routing Algorithms