Sciweavers

FOCS
1996
IEEE

Fault Tolerant Data Structures

13 years 7 months ago
Fault Tolerant Data Structures
We study the tolerance of data structures to memory faults. We observe that many pointerbased data structures (e.g., linked lists, trees, etc.) are highly nonresilient to faults. A single fault in a pointer in a linked list or a tree may result in the loss of an unproportionately large amount of data. In this paper we present a formal framework for studying the fault-tolerance properties of pointer-based data structures, and provide fault-tolerant versions of the stack, the linked list, and the dictionary tree.
Yonatan Aumann, Michael A. Bender
Added 07 Aug 2010
Updated 07 Aug 2010
Type Conference
Year 1996
Where FOCS
Authors Yonatan Aumann, Michael A. Bender
Comments (0)