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

Highly fault-tolerant hypercube multicomputer

โœ Scribed by Izadi, B.A.; Ozguner, F.; Acan, A.

Book ID
114448371
Publisher
The Institution of Electrical Engineers
Year
1999
Tongue
English
Weight
664 KB
Volume
146
Category
Article
ISSN
1350-2387

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Highly Fault-Tolerant Routings and Fault
Highly Fault-Tolerant Routings and Fault-Induced Diameter for Generalized Hypercube Graphs
โœ Koichi Wada; Takaharu Ikeo; Kimio Kawaguchi; Wei Chen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 130 KB

Consider a communication network G in which a limited number of link and/or node faults F might occur. A routing ฯ for the network (a fixed path between each pair of nodes) must be chosen without knowing which components might become faulty. The diameter of the surviving route graph R(G, ฯ)/F, where

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

Fault-tolerant cycle embedding in the hy
Fault-tolerant cycle embedding in the hypercube
โœ Jung-Sheng Fu ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 205 KB

Almost all the previous fault-tolerant cycle embedding research could not tolerate the faulty nodes more than the degree of the network. In this paper, we have broken this limitation: a recursive method of embedding a longest cycle into an n-dimensional hypercube (n-cube), which can tolerate atmost