A Simple Optimistic Skiplist Algorithm

Herlihy, Maurice; Lev, Yossi; Luchangco, Victor; Shavit, Nir

doi:10.1007/978-3-540-72951-8_11

Cited by 64 publications

(59 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To make things even worse, if validation in step (iv) fails, the thread has acquired the lock, possibly after contending for it, just to fail the validation and restart. To the best of our knowledge, most existing state-of-the-art lock-based algorithms, such as the linked-list by Heller et al [22] and the skip list by Herlihy et al [29], include exclusively the overhead for step (iv), namely for validating that the optimistic results are still consistent. 2 Consequently, implementing the OPTIK pattern as described above, would not only include the same overheads as existing algorithms, but also the ones for keeping track of and incrementing the version numbers.…”

Section: Introductionmentioning

confidence: 94%

“…Consequently, validating the node with OPTIK results in false conflicts. Still, using OPTIK in skip lists results in simpler designs than the existing state-of-the-art ones [15,29]. We first simplify validation in the optimistic skip list by Herlihy et al [29], using optik lock version.…”

Section: Optik In Skip Listsmentioning

confidence: 99%

“…Still, using OPTIK in skip lists results in simpler designs than the existing state-of-the-art ones [15,29]. We first simplify validation in the optimistic skip list by Herlihy et al [29], using optik lock version. If the validation is successful, then the corresponding node has not been modified, thus we do not need to validate the optimistic results in another way.…”

Section: Optik In Skip Listsmentioning

confidence: 99%

“…For example, one can design a linked list protected by a global lock in a few minutes, but inevitably, this list will be non-scalable. Accordingly, optimistic concurrency is deployed in every state-of-the-art data structure (e.g., lists [19,29], hash tables [8,37], trees [4,41], queues [39,40]). With optimistic concurrency, operations perform some non-synchronized work, before employing synchronization (i) for validating this optimistic work, and (ii) for possibly modifying the data structure.…”

Section: Introductionmentioning

confidence: 99%

“…Additionally, we design a new concurrent array map and use it in a hash table, and we employ OPTIK locks in optimizing existing hash tables. Furthermore, we use OPTIK locks to simplify validation in the optimistic skip-list algorithm [29] and we design a novel, simple skip-list algorithm based on the OPTIK pattern. Finally, we design three variants of the classic Michael-Scott queues [39] and we also introduce the concept of victim queues for reducing enqueue contention.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Optimistic concurrency with OPTIK

GuerraouiRachid

TrigonakisVasileios

2016

SIGPLAN Not.

View full text Add to dashboard Cite

We introduce OPTIK, a new practical design pattern for designing and implementing fast and scalable concurrent data structures. OPTIK relies on the commonly-used technique of version numbers for detecting conflicting concurrent operations. We show how to implement the OPTIK pattern using the novel concept of OPTIK locks. These locks enable the use of version numbers for implementing very efficient optimistic concurrent data structures. Existing state-of-the-art lock-based data structures acquire the lock and then check for conflicts. In contrast, with OPTIK locks, we merge the lock acquisition with the detection of conflicting concurrency in a single atomic step, similarly to lock-free algorithms. We illustrate the power of our OPTIK pattern and its implementation by introducing four new algorithms and by optimizing four state-of-the-art algorithms for linked lists, skip lists, hash tables, and queues. Our results show that concurrent data structures built using OPTIK are more scalable than the state of the art.

show abstract

Section: Introductionmentioning

confidence: 94%

Section: Optik In Skip Listsmentioning

confidence: 99%

Section: Optik In Skip Listsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Optimistic concurrency with OPTIK

GuerraouiRachid

TrigonakisVasileios

2016

SIGPLAN Not.

View full text Add to dashboard Cite

show abstract

A concurrent van Emde Boas array as a fast and simple concurrent dynamic set alternative

Kułakowski

2013

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYIncreasing demand for computationally efficient algorithms and processors has turned the attention of researchers toward parallel and concurrent solutions. Because the frequency of contemporary processors cannot be tweaked infinitely, the only hopes for squeezing more performance from computers are parallel processing and parallel computation. The important part of every parallel solution is concurrent data structures, which allow multithread programming environments to be taken advantage of. In this article, a new concurrent dynamic set structure is proposed. It is based on the van Emde Boas trees concept, where on every node of a tree, an array of the node's children is stored. The structure is equipped with a simple but effective locking algorithm, which allows it to be used concurrently by any number of threads. The presented algorithm idea is accompanied by an experimental implementation written in JAVA 6. Preliminary tests prove that, especially for moderately larger data sets with a predominance of read operations, the concurrent van Emde Boas array proposed in this article may be a viable alternative for other structures providing a similar functionality.

show abstract

A skip list for multicore

Dick

Fekete

Gramoli

2016

Concurrency and Computation

View full text Add to dashboard Cite

Summary In this paper, we introduce the Rotating skip list, the fastest concurrent skip list to date. Existing concurrent data structures experience limited scalability with the growing core count for two main reasons: threads contend while accessing the same shared data, and they require off‐chip communication to synchronize. Our solution combines the rotation of a tree to maintain logarithmic complexity deterministically, a skip list structure to avoid the tree root bottleneck, and no locks to limit cache line bouncing. This combination requires us to trade usual skip list towers for wheels, a novel algorithmic design that favors spatial locality and allows for a constant‐time restructuring operation. We evaluate the performance of our skip list on AMD Opteron and Intel Xeon multicores, show that its rotations guarantee its balance and compare its performance against seven state‐of‐the‐art skip lists and trees using four different synchronisation techniques. The Rotating skip list shows an unprecedented peak performance of 200 Mops/second. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

A Simple Optimistic Skiplist Algorithm

Cited by 64 publications

References 4 publications

Optimistic concurrency with OPTIK

Optimistic concurrency with OPTIK

A concurrent van Emde Boas array as a fast and simple concurrent dynamic set alternative

A skip list for multicore

Contact Info

Product

Resources

About