A highly-efficient wait-free universal construction

Fatourou, Panagiota; Kallimanis, Nikolaos D.

doi:10.1145/1989493.1989549

Cited by 103 publications

(115 citation statements)

References 29 publications

Supporting

Mentioning

113

Contrasting

Order By: Relevance

“…Nevertheless, despite the significant amount of research dedicated to the design of wait-free CSDSs [2,16,27,37,38,57,58], these algorithms exhibit low throughput, roughly half of that of a state-of-the-art blocking or lock-free search data structure (as we show experimentally in the paper). Essentially, the reason for the difference in throughput between wait-free algorithms on the one hand, and lock-free and blocking algorithms one the other hand, is related to the amount of concurrency-related information that needs to be associated with the data.…”

Section: Introductionmentioning

confidence: 91%

Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free

David

Guerraoui

2016

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

We argue that there is virtually no practical situation in which one should seek a "theoretically wait-free" algorithm at the expense of a state-of-the-art blocking algorithm in the case of search data structures: blocking algorithms are simple, fast, and can be made "practically wait-free".We draw this conclusion based on the most exhaustive study of blocking search data structures to date. We consider (a) different search data structures of different sizes, (b) numerous uniform and non-uniform workloads, representative of a wide range of practical scenarios, with different percentages of update operations, (c) with and without delayed threads, (d) on different hardware technologies, including processors providing HTM instructions.We explain our claim that blocking search data structures are practically wait-free through an analogy with the birthday paradox, revealing that, in state-of-the-art algorithms implementing such data structures, the probability of conflicts is extremely small. When conflicts occur as a result of context switches and interrupts, we show that HTM-based locks enable blocking algorithms to cope with them.

show abstract

Section: Introductionmentioning

confidence: 91%

Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free

David

Guerraoui

2016

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

show abstract

“…Several papers discuss how to build correct and high-performant single-producer single-consumer queues using arrays [11,14,15] and linked lists [12,16,17].…”

Section: Queue Segmentsmentioning

confidence: 99%

Deterministic scale-free pipeline parallelism with hyperqueues

Vandierendonck

Chronaki

Nikolopoulos

2013

Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis

View full text Add to dashboard Cite

Ubiquitous parallel computing aims to make parallel programming accessible to a wide variety of programming areas using deterministic and scale-free programming models built on a task abstraction. However, it remains hard to reconcile these attributes with pipeline parallelism, where the number of pipeline stages is typically hard-coded in the program and defines the degree of parallelism.This paper introduces hyperqueues, a programming abstraction that enables the construction of deterministic and scale-free pipeline parallel programs. Hyperqueues extend the concept of Cilk++ hyperobjects to provide thread-local views on a shared data structure. While hyperobjects are organized around private local views, hyperqueues require shared concurrent views on the underlying data structure. We define the semantics of hyperqueues and describe their implementation in a work-stealing scheduler. We demonstrate scalable performance on pipeline-parallel PARSEC benchmarks and find that hyperqueues provide comparable or up to 30% better performance than POSIX threads and Intel's Threading Building Blocks. The latter are highly tuned to the number of available processing cores, while programs using hyperqueues are scale-free.

show abstract

“…As a running example, we use the lock-free linked-list based queue by Michael and Scott [22], since it is a classic, simple construction that can be efficiently implemented in several platforms. More complex designs deploying flat-combining techniques [11], or allowing modify operations to spuriously fail [23], show interesting directions for future work.…”

Section: B Iterating Concurrent Queuesmentioning

confidence: 99%

A Consistency Framework for Iteration Operations in Concurrent Data Structures

Nikolakopoulos

Gidenstam

Papatriantafilou

et al. 2015

2015 IEEE International Parallel and Distributed Processing Symposium

View full text Add to dashboard Cite

Abstract-Concurrent data structures provide the means to multi-threaded applications to share data. Data structures come with a set of predefined operations, specified by the semantics of the data structure. In the literature and in several contemporary commonly used programming environments, the notion of iteration has been introduced for collection data structures, as a bulk operation enhancing the native set of operations. Iterations in several of these contexts have been treated as sequential in nature and may provide weak consistency guarantees when running concurrently with the native operations of the data structures.In this work we study iterations in concurrent data structures in the context of concurrency with the native operations and the guarantees that they provide. Besides linearizability, we propose a set of consistency specifications for such bulk operations, including also concurrency-aware properties by building on Lamport's systematic definitions for registers. Furthermore, by using queues and composite registers as casestudies of underlying objects, we provide a set of constructions of iteration operations, satisfying the properties and showing containment relations. Besides the trade-off between consistency and throughput, we point out and study tradeoff between the overhead of the bulk operation and possible support (helping) by the native operations of the data structure.

show abstract

A highly-efficient wait-free universal construction

Cited by 103 publications

References 29 publications

Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free

Concurrent Search Data Structures Can Be Blocking and Practically Wait-Free

Deterministic scale-free pipeline parallelism with hyperqueues

A Consistency Framework for Iteration Operations in Concurrent Data Structures

Contact Info

Product

Resources

About