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

All-to-all broadcasting in faulty hypercubes

โœ Scribed by Park, S.; Bose, B.

Book ID
119772682
Publisher
IEEE
Year
1997
Tongue
English
Weight
165 KB
Volume
46
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Broadcasting in faulty hypercubes
Broadcasting in faulty hypercubes
โœ Jie Wu; Eduardo B. Fernandez ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science โš– 833 KB
A Note on Optimal Time Broadcast in Faul
A Note on Optimal Time Broadcast in Faulty Hypercubes
โœ D. Peleg ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 309 KB

This note describes an algorithm for broadcasting a message on the \(n\)-dimensional hypercube in optimal time ( \(n\) time units) and optimal communication ( \(2^{n}-1\) messages) in the presence of up to \(n-2\) arbitrary node or edge faults, assuming the set of faults is known to all nodes of the

Dimension Ordering and Broadcast Algorit
Dimension Ordering and Broadcast Algorithms in Faulty SIMD Hypercubes
โœ C.S Raghavendra; M.A Sridhar ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 313 KB

computing. Therefore, it is necessary to compute important primitive functions even in the presence of faults. The hypercube network is quite robust [2,20]; in fact, at least n faults are needed to disconnect Q n into two components. The symmetry and robustness of hypercube can be exploited to compu