A Single-Enqueuer Wait-Free Queue Implementation

David, Matei

doi:10.1007/978-3-540-30186-8_10

Cited by 22 publications

(10 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Jayanti et al showed in [1] a multiple enqueuer and single dequeuer scenario for wait-free queues and stacks. However, our scenario requires multiple enqueuers and multiple dequeuers, which is not satisfied by [1], [20]. Furthermore, FIFO queues do not address our concerns.…”

Section: Related Workmentioning

confidence: 99%

“…There are only a few wait-free queues, such as [1], [19], [20]. Tsigas et al -who proposes in [19] wait-free queue class implementations for synchronization of real-time and non-real-time threads in an unidirectional manner.…”

Section: Related Workmentioning

confidence: 99%

“…Therefore their generic queue implementations use the priorities of the scheduler to guarantee progress. In [20] David presented a single enqueuer, multiple dequeuer approach of a wait-free queue implementation. Jayanti et al showed in [1] a multiple enqueuer and single dequeuer scenario for wait-free queues and stacks.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

A wait-free queue for multiple enqueuers and multiple dequeuers using local preferences and pragmatic extensions

Stellwag

Deisting

Schröder-Preikschat

2009

2009 IEEE International Symposium on Industrial Embedded Systems

View full text Add to dashboard Cite

Abstract-Queues are one of the most commonly used data structures in applications and operating systems [1]. Up-andcoming multi-core processors force software developers to consider data structures in order to make them thread-safe. But, in real-time systems, e.g., robotic controls, parallelization is even more complicated as such systems must guarantee to meet their mostly hard deadlines. A considerable amount of research has been carried out on wait-free objects [2] to achieve this. Waitfreedom can guarantee that each potentially concurrent thread completes its operation within a bounded number of steps. But applicable wait-free queues, which supports multiple enqueue, dequeue and read operations, do not exist yet. Therefore, we present a statically allocated and statically linked queue, which supports arbitrary concurrent operations. Our approach is also applicable in other scenarios, where unsorted queues with statically allocated elements are used. Moreover, we introduce 'local preferences' to minimize contention. But, as the response times of our enqueue operation directly depends on the fill level, the response times of a nearly filled queue still remain an issue. Moreover, our approach is jitter-prone with a varying fill level. In this paper, we also address all of these issues with an approach using a helping queue. The results show that we can decrease the worst case execution time by approximately factor twenty. Additionally, we reduce the average response times of potentially concurrent enqueue operations in our queue. To the best of our knowledge, our wait-free queue is the best known and practical solution for an unsorted thread-safe queue for multiple enqueuers, multiple dequeuers and mulitple readers.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A wait-free queue for multiple enqueuers and multiple dequeuers using local preferences and pragmatic extensions

Stellwag

Deisting

Schröder-Preikschat

2009

2009 IEEE International Symposium on Industrial Embedded Systems

View full text Add to dashboard Cite

show abstract

“…Based on this implementation, Li [14] constructed a linearizable queue in a restricted concurrency setting, where only two processes may perform dequeue operations. David [5] gave a queue implementation for any number of dequeuers but only supporting a single enqueuer. David conjectured that Common2 objects cannot even implement a three process queue.…”

Section: Related Workmentioning

confidence: 99%

Common2 extended to stacks and unbounded concurrency

2007

View full text Add to dashboard Cite

This paper extends Common2, the family of objects that implement and are wait-free implementable from 2 consensus objects, in two ways: First, the stack object is shown to be in the family, refuting a conjecture to the contrary [6]. Second, Common2 is investigated in the unbounded concurrency model, whereas until now it was considered only in an n-process model. We show that the fetch-and-add, test-and-set, and stack objects are in Common2 even with respect to this stronger notion of wait-free implementation. Our constructions rely on a wait-free implementation of immediate snapshots in the unbounded concurrency model, which was previously not known to be possible. The introduction of unbounded concurrency to the study of Common2 opens several directions of research: are there objects that have n-process implementations but are not unbounded concurrency implementable? We conjecture that swap is such an object. Additionally, the hope is that a queue impossibility proof, which eludes us in the n-process model, will be easier to establish in the unbounded concurrency model.

show abstract

“…Also, the queue in [16] is based on a statically allocated array, which essentially bounds the number of elements that the queue may contain. More recently, David [8] proposed a wait-free queue that supports multiple dequeuers, but only one concurrent enqueuer. His queue is based on infinitely large arrays.…”

Section: Introductionmentioning

confidence: 99%

Wait-free queues with multiple enqueuers and dequeuers

KoganAlex

PetrankErez

2011

SIGPLAN Not.

View full text Add to dashboard Cite

The queue data structure is fundamental and ubiquitous. Lockfree versions of the queue are well known. However, an important open question is whether practical wait-free queues exist. Until now, only versions with limited concurrency were proposed. In this paper we provide a design for a practical wait-free queue. Our construction is based on the highly efficient lock-free queue of Michael and Scott. To achieve wait-freedom, we employ a prioritybased helping scheme in which faster threads help the slower peers to complete their pending operations. We have implemented our scheme on multicore machines and present performance measurements comparing our implementation with that of Michael and Scott in several system configurations.

show abstract

A Single-Enqueuer Wait-Free Queue Implementation

Cited by 22 publications

References 4 publications

A wait-free queue for multiple enqueuers and multiple dequeuers using local preferences and pragmatic extensions

A wait-free queue for multiple enqueuers and multiple dequeuers using local preferences and pragmatic extensions

Common2 extended to stacks and unbounded concurrency

Wait-free queues with multiple enqueuers and dequeuers

Contact Info

Product

Resources

About