✦ LIBER ✦

Broadcasting in faulty hypercubes

✍ Scribed by Jie Wu; Eduardo B. Fernandez

Publisher: Elsevier Science
Year: 1993
Weight: 833 KB
Volume: 39
Category: Article
ISSN: 0165-6074
DOI: 10.1016/0165-6074(93)90260-r

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On optimal broadcasting in faulty hyperc

On optimal broadcasting in faulty hypercubes

✍ Jehoshua Bruck 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 727 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

Optimal Broadcasting in Faulty Trees

✍ Petrişor Panaite; Andrzej Pelc 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 291 KB

We consider broadcasting a message from one node of a tree to all other nodes. In the presence of up to k link failures the tree becomes disconnected, and only nodes in the connected component C containing the source can be informed. The maximum ratio between the time used by a broadcasting scheme B

Broadcasting in Faulty Binary Jumping Ne

Broadcasting in Faulty Binary Jumping Networks

✍ Y.J. Han; Y. Igarashi; K. Kanai; K. Miura 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 520 KB

We discuss the fault tolerance of an information disseminating scheme in a processor network called a binary jumping network. The following results are shown. Let \(N\) be the number of processors in the network. When \(N\) is a power of \(2, \log _{2} N+f+1\) rounds suffice for broadcasting in the

Reconfiguration of Rings and Meshes in F

Reconfiguration of Rings and Meshes in Faulty Hypercubes

✍ P.J. Yang; S.B. Tien; C.S. Raghavendra 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 953 KB