Practical Non-blocking Unordered Lists


This paper introduces new lock-free and wait-free unordered linked list algorithms. The composition of these algorithms according to the fast-pathslow-path methodology, a recently devised approach to creating fast wait-free data structures, is nontrivial, suggesting limitations to the applicability of the fast-path-slow-path methodology. The list algorithms… (More)
DOI: 10.1007/978-3-642-41527-2_17


7 Figures and Tables

Slides referencing similar topics