Wait-free consensus with infinite arrivals

Aspnes, James; Shah, G. L.; Shah, Jatin P.

doi:10.1145/509978.509983

Cited by 19 publications

(32 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…See [12] for a survey of many such impossibility results. More recent work targeted specifically at anonymity has studied what problems are solvable in message-passing systems under various assumptions about the initial knowledge of the processes [6,7,22], or in anonymous shared-memory systems where the properties of the supplied shared objects can often (but not always, depending on the details of the model) be used to break symmetry and assign identities [4,5,8,11,15,[17][18][19][20]23]. This work has typically assumed few limits on the power of the processes in the system other than the symmetry imposed by the model.…”

Section: Anonymous Communication and Fairnessmentioning

confidence: 99%

“…In the delayed or queued models, the transition rule becomes a partial function whose domain is Q S × Q R , where Q R = Q for delayed transmission or delayed observation and Q R ⊆ Q for queued transmission. 4 Separating message transmission and receipt creates the possibility that an agent may receive its own message. This can be thought of as including self-loops in the interaction graph controlling which agents can communicate, which we otherwise take to be complete.…”

Section: One-way Communication In Population Protocolsmentioning

confidence: 99%

See 1 more Smart Citation

On the Power of Anonymous One-Way Communication

Angluin

Aspnes

Eisenstat

et al. 2006

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract.We consider a population of anonymous processes communicating via anonymous message-passing, where the recipient of each message is chosen by an adversary and the sender is not identified to the recipient. Even with unbounded message sizes and process states, such a system can compute only limited predicates on inputs held by the processes. In the finite-state case, we show how the exact strength of the model depends critically on design choices that are irrelevant in the unbounded-state case, such as whether messages are delivered immediately or after a delay, whether a sender can record that it has sent a message, and whether a recipient can queue incoming messages, refusing to accept new messages until it has had a chance to send out messages of its own. These results may have implications for the design of distributed systems where processor power is severely limited, as in sensor networks.

show abstract

Section: Anonymous Communication and Fairnessmentioning

confidence: 99%

Section: One-way Communication In Population Protocolsmentioning

confidence: 99%

On the Power of Anonymous One-Way Communication

Angluin

Aspnes

Eisenstat

et al. 2006

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Surprisingly, Buhrman et al [8] show that randomized wait-free consensus can nonetheless be solved in this model, giving an algorithm based on Chandra's [9]. The upper bound for consensus has since been extended to an anonymous model with infinitely many processes by Aspnes, Shah, and Shah [3].…”

Section: Related Workmentioning

confidence: 99%

Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems

Aspnes

Fich

Ruppert

2004

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

We study the power of reliable anonymous distributed systems, where processes do not fail, do not have identifiers, and run identical programmes. We are interested specifically in the relative powers of systems with different communication mechanisms: anonymous broadcast, read-write registers, or read-write registers plus additional shared-memory objects. We show that a system with anonymous broadcast can simulate a system of shared-memory objects if and only if the objects satisfy a property we call idemdicence; this result holds regardless of whether either system is synchronous or asynchronous. Conversely, the key to simulating anonymous broadcast in anonymous shared memory is the ability to count: broadcast can be simulated by an asynchronous shared-memory system that uses only counters, but readwrite registers by themselves are not enough. We further examine the relative power of different types and sizes of bounded counters and conclude with a non-robustness result.

show abstract

“…To relate this to the previous work on models with infinite arrivals of processes and infinitely many shared registers, see [13,34,40]; our model assumes finitely many processes but infinitely many registers. For no fixed integer i can one guarantee in a wait-free manner that i is eventually assigned to be a name in an instance of Unbounded-Naming, so some integers may never be used.…”

Section: Introductionmentioning

confidence: 99%

Asynchronous exclusive selection

Chlebus

Kowalski

2008

Proceedings of the Twenty-Seventh ACM Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

An asynchronous system of n processes prone to crashes, along with a number of shared readwrite registers, is the distributed setting. We consider assigning integer numbers to processes in an exclusive manner, in the sense that no integer is assigned to two distinct processes. In the problem called Renaming, any k ≤ n processes, which hold original names from a range [N ] = {1, . . . , N }, contend to acquire unique integers in a smaller range [M ] as new names using some r auxiliary shared registers. We develop a wait-free (k, N )-renaming solution operating in O(log k(log N + log k log log N )) local steps, for M = O(k), and with r = O(k log(N/k)) auxiliary registers. Our approach is based on having processes traverse paths in graphs with suitable expansion properties, where names represent nodes and processes compete for the name of each visited node. We develop a wait-free k-renaming algorithm operating in O(k) time, with M = 2k − 1 and with r = O(k 2 ) registers. We develop an almost adaptive wait-free N -renaming algorithm, with N known, operating in O(log 2 k(log N + log k log log N )) time, with M = O(k) and with r = O(n log(N/n)) registers. We give a fully adaptive solution of Renaming, with neither k nor N known, having M = 8k − lg k − 1 as the bound on new names, operating in O(k) steps and using O(n 2 ) registers. As regards lower bounds, we show that a wait-free solution of Renaming requires 1 + min{k − 2, log 2r N 2M } steps in the worst case. We apply renaming algorithms to obtain solutions to a problem called Store&Collect, which is about operations of storing and collecting under additional requirements. In particular, when both k and N are known, then storing can be performed in O(log k(log N + log k log log N )) steps and collecting in O(k) steps, with r = O(k log(N/k)) registers. Additionally, when N = poly(n) is known but k is not, then storing takes O(log 2 k(log n + log k log log n)) steps and collecting O(k) steps, with O(n log n) registers. We consider the problem called Unbounded-Naming in which processes may repeatedly request new names, while no name can be reused once assigned, so that infinitely many integers need to be exclusively assigned as names in an execution. In such circumstances, for no fixed integer i can one guarantee in a wait-free manner that i is eventually assigned to be a name, so some integers may never be used; the upper bound on the number of such unused integers is used as a measure of quality of a solution. We show that UnboundedNaming is solvable in a non-blocking way such that at most n − 1 nonnegative integers are never assigned as names, which is best possible, and in a wait-free manner such that at most n(n − 1) nonnegative integers are never assigned as names.

show abstract

Wait-free consensus with infinite arrivals

Cited by 19 publications

References 0 publications

On the Power of Anonymous One-Way Communication

On the Power of Anonymous One-Way Communication

Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems

Asynchronous exclusive selection

Contact Info

Product

Resources

About