An improved algorithm for decentralized extrema-finding in circular configurations of processes

Chang, Ernest; Roberts, Rosemary

doi:10.1145/359104.359108

Cited by 284 publications

(121 citation statements)

References 0 publications

Supporting

Mentioning

116

Contrasting

Unclassified

Order By: Relevance

“…Leader election is a fundamental problem in distributed computing. Not surprisingly, there are numerous protocols for this problem (see, e.g., [Chang and Roberts 1979;Dolev, Klawe, and Rodeh 1982;Le Lann 1977;Lynch 1997;Peterson 1982]) if we assume that no agents have been corrupted; there have also been extensions that deal with corrupted agents [Feldman and Micali 1997;Katz and Koo 2006]. Much of this work focuses on leader election in a ring (e.g., [Chang and Roberts 1979;Dolev, Klawe, and Rodeh 1982;Le Lann 1977;Lynch 1997;Peterson 1982]).…”

Section: Introductionmentioning

confidence: 99%

Distributed Protocols for Leader Election: A Game-Theoretic Perspective

Abraham

Dolev

Halpern

2013

Lecture Notes in Computer Science

133

View full text Add to dashboard Cite

We do a game-theoretic analysis of leader election, under the assumption that each agent prefers to have some leader than to have no leader at all. We show that it is possible to obtain a fair Nash equilibrium, where each agent has an equal probability of being elected leader, in a completely connected network, in a bidirectional ring, and a unidirectional ring, in the synchronous setting. In the asynchronous setting, Nash equilibrium is not quite the right solution concept. Rather, we must consider ex post Nash equilibrium; this means that we have a Nash equilibrium no matter what a scheduling adversary does. We show that ex post Nash equilibrium is attainable in the asynchronous setting in all the networks we consider, using a protocol with bounded running time. However, in the asynchronous setting, we require that n > 2. We can get a fair -Nash equilibrium if n = 2 in the asynchronous setting, under some cryptographic assumptions (specifically, the existence of a pseudo-random number generator and polynomially-bounded agents), using ideas from bit-commitment protocols. We then generalize these results to a setting where we can have deviations by a coalition of size k. In this case, we can get what we call a fair k-resilient equilibrium if n > 2k; under the same cryptographic assumptions, we can a get a k-resilient equilibrium if n = 2k. Finally, we show that, under minimal assumptions, not only do our protocols give a Nash equilibrium, they also give a sequential equilibrium [Kreps and Wilson 1982], so players even play optimally off the equilibrium path.

show abstract

Section: Introductionmentioning

confidence: 99%

Distributed Protocols for Leader Election: A Game-Theoretic Perspective

Abraham

Dolev

Halpern

2013

Lecture Notes in Computer Science

133

View full text Add to dashboard Cite

show abstract

“…Several authors [4], [5], [6], etc. have proposed algorithms for the leader election problem for nodes organized in a logical ring.…”

Section: Leader Electionmentioning

confidence: 99%

“…A node wishing to become the leader sends a claim message ( TOKEN ) which will travel along the ring according to the comparison and transmission rules of the algorithm. For instance, in Chang and Roberts' algorithm [4], a claim message is transmitted from node to node in the ring until it is received by a node which is a better leader candidate. A node considers itself the new leader when it receives its own claim message.…”

Section: Leader Electionmentioning

confidence: 99%

“…The latter are based on the principle of the uniqueness of a token which travels along a logical ring that comprises all the nodes of the system. Examples of such algorithms are mutual exclusion [1], termination detection [2] [3], leader election [4], [5], [6], moving sequencer or privilege-based total order broadcast algorithms [7], group membership [8], etc.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Easily Rendering Token-Ring Algorithms of Distributed and Parallel Applications Fault Tolerant

Arantes

Sopena

2013

2013 25th International Symposium on Computer Architecture and High Performance Computing

View full text Add to dashboard Cite

Abstract:We propose in this paper a new algorithm that, when called by existing token ring-based algorithms of parallel and distributed applications, easily renders the token tolerant to losses in presence of node crashes. At most k consecutive node crashes are tolerated in the ring. Our algorithm scales very well since a node monitors the liveness of at most k other nodes and neither a global election algorithm nor broadcast primitives are used to regenerate a new token. It is thus very effective in terms of latency cost. Finally, a study of the probability of having at most k consecutive node crashes in the presence of f failures and a discussion of how to extend our algorithm to other logical topologies are also presented.

show abstract

“…Software design problems, in contrast to these mathematical problems, tend to have less regular structure, despite the grounding out of quantifiers. We compared Kodkod to Alloy 3 on three design problems: Dijkstra's mutual exclusion scheme [38], leader election in a ring [39], and the transfer protocol of the Mondex smart card [40].…”

Section: Resultsmentioning

confidence: 99%

Kodkod: A Relational Model Finder

Torlak¹,

Jackson²

Lecture Notes in Computer Science

342

261

View full text Add to dashboard Cite

Abstract. The key design challenges in the construction of a SAT-based relational model finder are described, and novel techniques are proposed to address them. An efficient model finder must have a mechanism for specifying partial solutions, an effective symmetry detection and breaking scheme, and an economical translation from relational to boolean logic. These desiderata are addressed with three new techniques: a symmetry detection algorithm that works in the presence of partial solutions, a sparse-matrix representation of relations, and a compact representation of boolean formulas inspired by boolean expression diagrams and reduced boolean circuits. The presented techniques have been implemented and evaluated, with promising results.

show abstract

An improved algorithm for decentralized extrema-finding in circular configurations of processes

Cited by 284 publications

References 0 publications

Distributed Protocols for Leader Election: A Game-Theoretic Perspective

Distributed Protocols for Leader Election: A Game-Theoretic Perspective

Easily Rendering Token-Ring Algorithms of Distributed and Parallel Applications Fault Tolerant

Kodkod: A Relational Model Finder

Contact Info

Product

Resources

About