Repeat Offender Problem: A Mechanism for Supporting Dynamic-sized Lock-free Data Structures, The

Author(s):
Maurice Herlihy, Victor Luchangco and Mark Moir
Report Number:	Date Published:	Available Formats:
TR-2002-112	July 2002	Portable Document Format (PDF) Postscript (PS) Request Hard Copy
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.

Repeat Offender Problem: A Mechanism for Supporting Dynamic-sized Lock-free Data Structures, The