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

Distributed fault-tolerant embeddings of rings in hypercubes

โœ Scribed by Mee Yee Chan; Shiang-Jen Lee

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
881 KB
Volume
11
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A distributed algorithm for embedding tr
A distributed algorithm for embedding trees in hypercubes with modifications for run-time fault tolerance
โœ Foster J. Provost; Rami Melhem ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 588 KB

In this paper we present a distributed algorithm for embedding binary trees in hypercubes. Starting with the root (invoked in some cube node by a host), each node is responsible for determining the addresses of its children, and for invoking the embedding algorithm for the subtree rooted at each chi

Fault-tolerant cycles embedded in hyperc
Fault-tolerant cycles embedded in hypercubes with mixed link and node failures
โœ Chang-Hsiung Tsai ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 282 KB

Let f e (respectively, f v ) denote the number of faulty edges (respectively, vertices) of an n-dimensional hypercube Q n . In this paper, we prove that every fault-free edge of Q n for n โ‰ฅ 3 lies on a fault-free cycle of every even length from 4 to 2 n -2 f v inclusive if f e + f v โ‰ค n -2. Furtherm