A Lazy Concurrent List-Based Set Algorithm-Reference-Cited by-同舟云学术

A Lazy Concurrent List-Based Set Algorithm

Published:2007-12 Issue:04 Volume:17 Page:411-424
ISSN:0129-6264
Container-title:Parallel Processing Letters
language:en
Short-container-title:Parallel Process. Lett.

Author:

HELLER STEVE¹,HERLIHY MAURICE²,LUCHANGCO VICTOR¹,MOIR MARK¹,SCHERER WILLIAM N.³,SHAVIT NIR⁴

Affiliation:

1. Sun Microsystems Laboratories, 35 Network Drive, Burlington, MA 01083, USA

2. Computer Science Department, Brown University, 115 Waterman Street, Providence, RI 02912, USA

3. Department of Computer Science, Rice University, 6100 Main Street, Houston, TX 77005, USA

4. Computer Science Department, Tel Aviv University, Ramat Aviv 68878, Israel

Abstract

We present a novel “lazy” list-based implementation of a concurrent set object. It is based on an optimistic locking scheme for inserts and removes and includes a simple wait-free membership test. Our algorithm improves on the performance of all previous such algorithms.

Publisher

World Scientific Pub Co Pte Lt

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129626407003125

Reference7 articles.

1. A Pragmatic Implementation of Non-blocking Linked-lists

2. Wait-free synchronization

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Concurrent Wait-Free Graph Snapshots Using Multi-versioning;Lecture Notes in Computer Science;2024

2. Dynamic Skyline Computation with LSD Trees;Analytics;2023-02-09

3. An efficient approach to achieve compositionality using optimized multi-version object based transactional systems;Information and Computation;2021-01

4. Achieving Starvation-Freedom with Greater Concurrency in Multi-Version Object-based Transactional Memory Systems;Lecture Notes in Computer Science;2019

5. Efficient Means of Achieving Composability Using Object Based Semantics in Transactional Memory Systems;Networked Systems;2019