๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Adaptive Wormhole Routing in Hypercube Multicomputers

โœ Scribed by X. Lin; A-H. Esfahanian; A. Burago

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
186 KB
Volume
48
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fault-tolerant wormhole routing for hype
Fault-tolerant wormhole routing for hypercube networks
โœ Jau-Der Shih ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 145 KB

We present an adaptive fault-tolerant wormhole routing algorithm for hypercubes by using 3 virtual networks. The routing algorithm can tolerate at least n -1 faulty nodes and can route a message via a path of length no more than the shortest path plus four. Previous algorithms which achieve the same

Performance Tuning of Adaptive Wormhole
Performance Tuning of Adaptive Wormhole Routing through Selection Function Choice
โœ Loren Schwiebert; Renelius Bell ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 300 KB

Many adaptive routing algorithms have been proposed for wormholerouted interconnection networks. Comparatively little work, however, has been done on determining how the selection function (routing policy) affects the performance of an adaptive routing algorithm. In this paper, we present a detailed