Proceedings ArticleDOI
An optimal fault-tolerant broadcasting algorithm for a hypercube multiprocessor
Jai Eun Jang
- pp 96-102
TLDR
An optimal fault-tolerant broadcasting algorithm in the presence of n-1 faulty processors in the hypercube multiprocessor that takes log2(N)+1 steps to broadcast the message to all other processors.Abstract:
In this paper we describe an optimal fault-tolerant broadcasting algorithm in the presence of n-1 faulty processors in the hypercube multiprocessor. This algorithm takes log2(N)+1 steps to broadcast the message to all other processors. Our broadcasting algorithm is a procedure by which a processor can pass a message to all other processors in the network non-redundantly.read more
Citations
More filters
Proceedings ArticleDOI
An Autonomic Implementation of Reliable Broadcast Based on Dynamic Spanning Trees
TL;DR: This work introduces an autonomic strategy to implement reliable broadcast that employs spanning trees that are dynamically built embedded in the overlay of processes self-organize themselves on an overlay based on a hypercube-like topology.
Proceedings ArticleDOI
An optimal fault-tolerant broadcasting algorithm for a cube-connected cycles multiprocessor
TL;DR: The author develops a novel broadcasting algorithm in cube-connected-cycles (CCC) multiprocessors using a binomial tree and describes an optimal fault-tolerant broadcasting algorithms in the CCC which tolerates s-1 processors or s- 1 ring failures.
Dissertation
Descubrimiento de servicios tolerante a fallos basado en hipercubos para sistemas distribuidos de gran escala
TL;DR: This thesis proposes a Resource Discovery Service (of services or resources) for large-scale distributed systems that are able to adapt to failures that occur in the system, based on an overlay that has a hypercube topology that interconnects nodes / intermediaries (brokers).
References
More filters
Journal ArticleDOI
The Byzantine Generals Problem
TL;DR: The Albanian Generals Problem as mentioned in this paper is a generalization of Dijkstra's dining philosophers problem, where two generals have to come to a common agreement on whether to attack or retreat, but can communicate only by sending messengers who might never arrive.
Book ChapterDOI
The Byzantine generals problem
TL;DR: In this article, a group of generals of the Byzantine army camped with their troops around an enemy city are shown to agree upon a common battle plan using only oral messages, if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals.
Journal ArticleDOI
Parallel Processing with the Perfect Shuffle
TL;DR: Given a vector of N elements, the perfect shuffle of this vector is a permutation of the elements that are identical to aperfect shuffle of a deck of cards.
Journal ArticleDOI
Topological properties of hypercubes
Y. Saad,M.H. Schultz +1 more
TL;DR: The authors examine the hypercube from the graph-theory point of view and consider those features that make its connectivity so appealing and propose a theoretical characterization of the n-cube as a graph.