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.

Further White Paper Details
PublisherSun Microsystems File FormatPDF, requires Acrobat Rdr 5
Date PublishedJuly 2002 Downloads6
FormatWhite Papers   
Topics
E4 embraces web 2.0 audience

E4 embraces web 2.0 audience

Case study: How the Channel 4's teen channel put its mind to building a community website... more

Cheat Sheet: Cloud computing

Cheat Sheet: Cloud computing

A tech storm is brewing...  more


Quick Sitemap Links: