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.
Cite
CITATION STYLE
Herlihy, M., Luchangco, V., & Moir, M. (2002). The repeat offender problem: A mechanism for supporting dynamic-sized,lo ck-free data structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2508, pp. 339–353). Springer Verlag. https://doi.org/10.1007/3-540-36108-1_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
