Practical Non-blocking Unordered Lists
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 239-253
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Universal constructions that ensure disjoint-access parallelism and wait-freedom2012
- A highly-efficient wait-free universal construction2011
- Locality-Conscious Lock-Free Linked ListsLecture Notes in Computer Science, 2011
- Non-blocking binary search trees2010
- Formal Verification of a Lazy Concurrent List-Based Set Algorithm2006
- Built-In Coloring for Highly-Concurrent Doubly-Linked Lists2006
- A Lazy Concurrent List-Based Set Algorithm2006
- Lock-free linked lists and skip lists2004
- A Pragmatic Implementation of Non-blocking Linked-lists2001
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991