The repeat offender problem: A mechanism for supporting dynamic-sized, lock-free data structures

The repeat offender problem: A mechanism for supporting dynamic-sized, lock-free data structures (2002)

by Maurice Herlihy , Victor Luchangco , Mark Moir , Maurice Herlihy , Victor Luchangco , Mark Moir , Maurice Herlihy

Venue:	In Proceedings of the 16th International Symposium on Distributed Computing
Citations:	44 - 10 self

Datum	Value	Source
TITLE	The repeat offender problem: A mechanism for supporting dynamic-sized, lock-free data structures	INFERENCE
AUTHOR NAME	Maurice Herlihy	SVM HeaderParse 0.2
AUTHOR NAME	Victor Luchangco	SVM HeaderParse 0.2
AUTHOR NAME	Mark Moir	SVM HeaderParse 0.2
AUTHOR NAME	Maurice Herlihy	SVM HeaderParse 0.2
AUTHOR AFFIL	email addresses:	SVM HeaderParse 0.2
AUTHOR NAME	Victor Luchangco	SVM HeaderParse 0.2
AUTHOR NAME	Mark Moir	SVM HeaderParse 0.2
AUTHOR AFFIL	email addresses:	SVM HeaderParse 0.2
AUTHOR NAME	Maurice Herlihy	SVM HeaderParse 0.2
AUTHOR AFFIL	Computer Science Depart...	SVM HeaderParse 0.2
ABSTRACT	We define the Repeat Offender Problem (ROP). Elsewhere, we have presented the first dynamic-sized lock-free data structures that can free memory to any standard memory allocator—even after thread failures—without requiring special support from the operating system, the memory allocator, or the hardware. These results depend on a solution to the ROP problem. Here we present the first solution to the ROP problem and its correctness proof. Our solution is implementable in most modern shared memory multiprocessors. M/S MTV29-01	SVM HeaderParse 0.2
YEAR	2002	SVM HeaderParse 0.2
VENUE	In Proceedings of the 16th International Symposium on Distributed Computing	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	339--353	INFERENCE
VOLUME	2508	INFERENCE
CITATIONS	15 found	ParsCit 1.0