|
Published Articles >> Table of Contents >> Abstract
37th Annual Symposium on Foundations of Computer Science (FOCS '96)
p. 580
Fault tolerant data structures
Y. Aumann, Dept. of Math. & Comput. Sci., Bar-Ilan Univ., Ramat-Gan, Israel
M.A. Bender, Dept. of Math. & Comput. Sci., Bar-Ilan Univ., Ramat-Gan, Israel
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1996.548517
Send link to a friend
| Abstract |
|
The authors consider the tolerance of data structures to memory faults. They observe that many pointer-based data structures (e.g. linked lists, trees, etc.) are highly nonresilient to faults. A single fault in a linked list or tree may result in the loss of the entire set of data. They 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.
|
 Additional Information
|
Index Terms- tree data structures; fault tolerant data structures; memory faults; pointer-based data structures; linked list; trees; stack; dictionary tree
Citation:
Y. Aumann, M.A. Bender,
"Fault tolerant data structures,"
focs,
p. 580,
37th Annual Symposium on Foundations of Computer Science (FOCS '96),
1996
|
|
