Wait-free linked-lists

Shahar Timnat; Anastasia Braginsky; Alex Kogan; Erez Petrank

doi:10.1145/2370036.2145869

Wait-free linked-lists

Shahar Timnat, Anastasia Braginsky, Alex Kogan, Erez Petrank

Computer Science

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

The linked-list data structure is fundamental and ubiquitous. Lockfree versions of the linked-list are well known. However, the existence of a practical wait-free linked-list has been open. In this work we designed such a linked-list. To achieve better performance, we have also extended this design using the fast-path-slow-path methodology. The resulting implementation achieves performance which is competitive with that of Harris's lock-free list, while still guaranteeing non-starvation via wait-freedom. We have also developed a proof for the correctness and the wait-freedom of our design.

Original language	English
Pages (from-to)	309-310
Number of pages	2
Journal	ACM SIGPLAN Notices
Volume	47
Issue number	8
DOIs	https://doi.org/10.1145/2370036.2145869
State	Published - Aug 2012

All Science Journal Classification (ASJC) codes

General Computer Science

Access to Document

10.1145/2370036.2145869

Cite this

@article{a2af3725ba6845568e5797af843c844e,

title = "Wait-free linked-lists",

abstract = "The linked-list data structure is fundamental and ubiquitous. Lockfree versions of the linked-list are well known. However, the existence of a practical wait-free linked-list has been open. In this work we designed such a linked-list. To achieve better performance, we have also extended this design using the fast-path-slow-path methodology. The resulting implementation achieves performance which is competitive with that of Harris's lock-free list, while still guaranteeing non-starvation via wait-freedom. We have also developed a proof for the correctness and the wait-freedom of our design.",

author = "Shahar Timnat and Anastasia Braginsky and Alex Kogan and Erez Petrank",

year = "2012",

month = aug,

doi = "10.1145/2370036.2145869",

language = "الإنجليزيّة",

volume = "47",

pages = "309--310",

journal = "ACM SIGPLAN Notices",

issn = "1523-2867",

publisher = "Association for Computing Machinery (ACM)",

number = "8",

}

TY - JOUR

T1 - Wait-free linked-lists

AU - Timnat, Shahar

AU - Braginsky, Anastasia

AU - Kogan, Alex

AU - Petrank, Erez

PY - 2012/8

Y1 - 2012/8

N2 - The linked-list data structure is fundamental and ubiquitous. Lockfree versions of the linked-list are well known. However, the existence of a practical wait-free linked-list has been open. In this work we designed such a linked-list. To achieve better performance, we have also extended this design using the fast-path-slow-path methodology. The resulting implementation achieves performance which is competitive with that of Harris's lock-free list, while still guaranteeing non-starvation via wait-freedom. We have also developed a proof for the correctness and the wait-freedom of our design.

AB - The linked-list data structure is fundamental and ubiquitous. Lockfree versions of the linked-list are well known. However, the existence of a practical wait-free linked-list has been open. In this work we designed such a linked-list. To achieve better performance, we have also extended this design using the fast-path-slow-path methodology. The resulting implementation achieves performance which is competitive with that of Harris's lock-free list, while still guaranteeing non-starvation via wait-freedom. We have also developed a proof for the correctness and the wait-freedom of our design.

UR - http://www.scopus.com/inward/record.url?scp=84878559003&partnerID=8YFLogxK

U2 - 10.1145/2370036.2145869

DO - 10.1145/2370036.2145869

M3 - مقالة

SN - 1523-2867

VL - 47

SP - 309

EP - 310

JO - ACM SIGPLAN Notices

JF - ACM SIGPLAN Notices

IS - 8

ER -

Wait-free linked-lists

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this