scientific article; zbMATH DE number 2013841
From MaRDI portal
Publication:4437136
zbMATH Open1029.68540MaRDI QIDQ4437136FDOQ4437136
Victor Luchangco, Maurice Herlihy, Mark Moir
Publication date: 7 December 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2508/25080339.htm
Title of this publication is not available (Why is that?)
Recommendations
- Safe memory reclamation for dynamic lock-free objects using atomic reads and writes
- How lock-free data structures perform in dynamic environments: models and analyses
- Are Lock-Free Concurrent Algorithms Practically Wait-Free?
- Computer Aided Verification
- Characterizing the performance of algorithms for lock-free objects
Cited In (8)
- Reuse, don't recycle: transforming lock-free algorithms that throw away descriptors
- A scalable lock-free stack algorithm
- Lock-free deques and doubly linked lists
- Nonblocking \(k\)-compare-single-swap
- NB{\texttt{malloc}}: Allocating memory in a lock-free manner
- Lock-free reference counting
- An optimistic approach to lock-free FIFO queues
- A general lock-free algorithm using compare-and-swap
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4437136)
