Dynamic-sized lock-free data structures

Authors:
Maurice Herlihy;Victor Luchangco;Paul Martin;Mark Moir
Affiliations:
Brown University, Providence, RI;Sun Microsystem Laboratories, Burlington, MA;Sun Microsystem Laboratories, Burlington, MA;Sun Microsystem Laboratories, Burlington, MA
Venue:
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Year:
2002

Lock-free reference counting

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Safe memory reclamation for dynamic lock-free objects using atomic reads and writes

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Dynamic-sized lock-free data structures

Proceedings of the twenty-first annual symposium on Principles of distributed computing

Dynamic-sized lock-free data structures

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Two-handed emulation: how to build non-blocking implementations of complex data-structures using DCAS

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Bringing practical lock-free synchronization to 64-bit applications

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Nonblocking memory management support for dynamic-sized data structures

ACM Transactions on Computer Systems (TOCS)
Integrating concurrency control and energy management in device drivers

Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Lock-free deques and doubly linked lists

Journal of Parallel and Distributed Computing
Fast local-spin abortable mutual exclusion with bounded space

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems

Hi-index	0.00