Election in asynchronous complete networks with intermittent link failures

Abu-Amara, Hosame; Lokre, Jahnavi V.

doi:10.1109/12.293257

Cited by 29 publications

(16 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…New Gossip processes register themselves with one of the wellknown sites and are announced to all other functioning Gossips. Within the Gossip pool, we use the NWS clique protocol [40] (a token-passing protocol based on leaderelection [15], [1]) to manage network partitioning and Gossip failure. The clique protocol allows a clique of processes to dynamically partition itself into subcliques (due to network or host failure) and then merge when conditions permit.…”

Section: Distributed State Exchange Servicementioning

confidence: 99%

Writing programs that run EveryWare on the Computational Grid

Wolski

Brevik

Obertelli

et al. 2001

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

AbstractÐThe Computational Grid [12] has been proposed for the implementation of high-performance applications using widely dispersed computational resources. The goal of a Computational Grid is to aggregate ensembles of shared, heterogeneous, and distributed resources (potentially controlled by separate organizations) to provide computational ªpowerº to an application program. In this paper, we provide a toolkit for the development of globally deployable Grid applications. The toolkit, called EveryWare, enables an application to draw computational power transparently from the Grid. It consists of a portable set of processes and libraries that can be incorporated into an application so that a wide variety of dynamically changing distributed infrastructures and resources can be used together to achieve supercomputer-like performance. We provide our experiences gained while building the EveryWare toolkit prototype and an explanation of its use in implementing a large-scale Grid application.

show abstract

Section: Distributed State Exchange Servicementioning

confidence: 99%

Writing programs that run EveryWare on the Computational Grid

Wolski

Brevik

Obertelli

et al. 2001

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…In the literature, three different, but related, problems were addressed: consensus [6,9,11,12,13,19], agreement or interactive consistency [7,10,24], and leader election [2,3,5,8,15,16,17,20,25]. In the consensus problem, all of the non-faulty processors in the network want to agree on a single bit, a 0 or a 1.…”

Section: Literature Surveymentioning

confidence: 99%

Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links

Sayeed

Abu-Amara²,

Abu-Amara

1995

Distrib Comput

View full text Add to dashboard Cite

We consider agreement and leader election on asynchronous complete networks when the processors are reliable, but some of the channels are subject to failure. Fischer, Lynch, and Paterson have already shown that no deterministic algorithm can solve the agreement problem on asynchronous networks if any processor fails during the execution of the algorithm. Therefore, we consider only channel failures. The type of channel failure we consider in this paper is Byzantine failure, that is, channels fail by altering messages, sending false information, forging messages, losing messages at will, and so on. There are no restrictions on the behavior of a faulty channel. Therefore, a faulty channel may act as an adversary who forges messages on purpose to prevent the successful completion of the algorithm. Because we assume an asynchronous network, the channel delays are arbitrary. Thus, the faulty channels may not be detectable unless, for example, the faulty channels cause garbage to be sent. We present the first known agreement and leader election algorithm for asynchronous complete networks in which the processors are reliable but some channels may be Byzantine faulty. The algorithm can tolerate up to [~-~] faulty channels, where n is the number of processors in the network. We show that the bound on the number of faulty channels is optimal. When the processors terminate their corresponding algorithms, all the processors in the network will have the same correct vector, where the vector contains the private values of all the processors.

show abstract

“…The first formations of the problem appeared in a variety of papers [1][2][3]. Since then the problem has been studied extensively in various models and network topologies, like rings, complete network topology, unidirectional networks, and grids.…”

Section: Introductionmentioning

confidence: 99%

The election problem in asynchronous distributed systems with bounded faulty processes

Park

2007

J Supercomput

View full text Add to dashboard Cite

Determining the "weakest" failure detectors is a central topic in solving many agreement problems such as Consensus, Non-Blocking Atomic Commit and Election in asynchronous distributed systems. So far, this has been studied extensively for several such fundamental problems. It is stated that Perfect Failure Detector P is the weakest failure detector to solve the Election problem with any number of faulty processes. In this paper, we introduce Modal failure detector M and show that to solve Election, M is the weakest failure detector to solve election when the number of faulty processes is less than n/2 . We also show that it is strictly weaker than P .

show abstract

Election in asynchronous complete networks with intermittent link failures

Cited by 29 publications

References 16 publications

Writing programs that run EveryWare on the Computational Grid

Writing programs that run EveryWare on the Computational Grid

Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links

The election problem in asynchronous distributed systems with bounded faulty processes

Contact Info

Product

Resources

About