scientific article; zbMATH DE number 2013841

zbMATH Open1029.68540MaRDI QIDQ4437136FDOQ4437136

Authors Victor Luchangco, Mark Moir, Maurice Herlihy 

Publication date 7 December 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2508/25080339.htm

Mathematics Subject Classification ID

Searching and sorting (68P10)

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
• Computer Aided Verification
• Characterizing the performance of algorithms for lock-free objects

Cited in

(9)

• An optimistic approach to lock-free FIFO queues
• Lock-free deques and doubly linked lists
• NB{\texttt{malloc}}: Allocating memory in a lock-free manner
• A scalable lock-free stack algorithm
• Reuse, don't recycle: transforming lock-free algorithms that throw away descriptors
• Safe memory reclamation for dynamic lock-free objects using atomic reads and writes
• Lock-free reference counting
• Nonblocking \(k\)-compare-single-swap
• 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)