The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures
- 24 October 2002
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 339-353
- https://doi.org/10.1007/3-540-36108-1_23
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Dynamic-sized lock-free data structuresPublished by Association for Computing Machinery (ACM) ,2002
- Safe memory reclamation for dynamic lock-free objects using atomic reads and writesPublished by Association for Computing Machinery (ACM) ,2002
- A Pragmatic Implementation of Non-blocking Linked-listsLecture Notes in Computer Science, 2001
- Lock-free reference countingPublished by Association for Computing Machinery (ACM) ,2001
- Even Better DCAS-Based Concurrent DequesLecture Notes in Computer Science, 2000
- Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory MultiprocessorsJournal of Parallel and Distributed Computing, 1998
- Using local-spin k -exclusion algorithms to improve wait-free object implementationsDistributed Computing, 1997
- Practical implementations of non-blocking synchronization primitivesPublished by Association for Computing Machinery (ACM) ,1997
- Simple, fast, and practical non-blocking and blocking concurrent queue algorithmsPublished by Association for Computing Machinery (ACM) ,1996
- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess ProgramsIEEE Transactions on Computers, 1979