Data Recovery / Security White Papers
The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized Lock-Free Data Structures
Overview This paper presents a mechanism for supporting memory management in dynamic-sized lock-free data structures (i.e., those that can grow and shrink). Lock-free data structures avoid many problems associated with the use of locking, including convoying, susceptibility to failures and delays, and, in real-time systems, priority inversion. A lock free data structure guarantees that after a finite number of steps of any operation on the data structure, some operation completes.
| Publisher | Sun Microsystems | File Format | PDF, requires Acrobat Rdr 5 |
|---|---|---|---|
| Date Published | July 2002 | Downloads | 6 |
| Format | White Papers | ||
| Topics | |||



