Restricted Stack Implementations

David, Matei; Brodsky, Alex; Fich, Faith E.

doi:10.1007/11561927_12

Cited by 8 publications

(8 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The exploration of consensus power 2 objects was initiated by Afek, Weisberger and Weisman in [3], where they defined the Common2 class of objects. Subsequently Common2 was shown to contain the stack object [2], various restricted versions of the FIFO queue [6-8, 16, 17], and the blurred history object [7]. In [3] Afek, Weisberger and Weisman sketched a wait-free swap implementation from 2-consensus objects, and the full construction appears in [21].…”

Section: Related Workmentioning

confidence: 99%

From bounded to unbounded concurrency objects and back

Afek

Morrison

Wertheim

2011

Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may increase without bound. By studying this model we obtain new results and observations that are relevant and meaningful to the standard bounded concurrency model.First we resolve an open problem from 2006 and provide, contrary to what was conjectured, an unbounded concurrency wait-free implementation of a swap object from 2-consensus objects. This construction resolves another puzzle that has eluded us for a long time, that of considerably simplifying a 16 year old complicated bounded concurrency swap construction.A further insight to the traditional bounded concurrency model that we obtain by studying the unbounded concurrency model, is a refinement of the top level of the waitfree hierarchy, the class of infinite-consensus number objects. First we resolve an open question of Merritt and Taubenfeld from 2003, showing that having n-consensus objects for all n does not imply consensus under unbounded concurrency. I.e., consensus alone, treated as a black box, cannot be "boosted" in this way. We continue to show an infinitenumber consensus object that while able to perform consensus for any n-bounded concurrency (n unknown in advance) cannot solve consensus in the face of unbounded concurrency. This divides the infinite-consensus class of objects into two, those that can solve consensus for unbounded concurrency, and those that cannot.

show abstract

Section: Related Workmentioning

confidence: 99%

From bounded to unbounded concurrency objects and back

Afek

Morrison

Wertheim

2011

Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

show abstract

“…David et al [3] proposed another class of restricted stack implementations. Their implementation can support a maximum of two concurrent push operations.…”

Section: Related Workmentioning

confidence: 99%

“…Wait-free stacks have not received a lot of attention in the past, and we are not aware of algorithms that are particularly tailored to creating a generalized wait-free stack. However, approaches have been proposed to create wait-free stacks with certain restrictions [1], [3], [7], [8], and with universal constructions [10], [5]. The main reason that it has been difficult to create a wait-free stack is because there is a lot of contention at the stack top between concurrent push and pop operations.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Wait-Free Stack

Goel

Aggarwal

Sarangi

2015

Distributed Computing and Internet Technology

View full text Add to dashboard Cite

In this paper, we describe a novel algorithm to create a concurrent wait-free stack. To the best of our knowledge, this is the first wait-free algorithm for a general purpose stack. In the past, researchers have proposed restricted wait-free implementations of stacks, lock-free implementations, and efficient universal constructions that can support wait-free stacks. The crux of our wait-free implementation is a fast pop operation that does not modify the stack top; instead, it walks down the stack till it finds a node that is unmarked. It marks it but does not delete it. Subsequently, it is lazily deleted by a cleanup operation. This operation keeps the size of the stack in check by not allowing the size of the stack to increase beyond a factor of W as compared to the actual size. All our operations are wait-free and linearizable.

show abstract

“…The question whether queues belong to Common2 has been open for many years and has received a considerable amount of attention [2,4,5,6,8,14]. It essentially asks if there is an n-process linearizable wait-free implementation of a queue from Test&Set, for every n ≥ 3.…”

Section: Introductionmentioning

confidence: 99%

Nontrivial and universal helping for wait-free queues and stacks

Attiya

Castañeda²,

Hendler

2018

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

This paper studies two approaches to formalize helping in wait-free implementations of shared objects. The first approach is based on operation valency, and it allows us to make the important distinction between trivial and nontrivial helping. We show that a wait-free implementation of a queue from common2 objects (e.g., Test&Set) requires nontrivial helping. In contrast, there is a wait-free implementation of a stack from Common2 objects with only trivial helping. This separation might shed light on the difficulty of implementing a queue from Common2 objects. The other approach formalizes the helping mechanism employed by Herlihy's universal waitfree construction and is based on having an operation by one process restrict the possible linearizations of operations by other processes. We show that objects possessing such universal helping can be used to solve consensus.

show abstract

Restricted Stack Implementations

Cited by 8 publications

References 5 publications

From bounded to unbounded concurrency objects and back

From bounded to unbounded concurrency objects and back

A Wait-Free Stack

Nontrivial and universal helping for wait-free queues and stacks

Contact Info

Product

Resources

About