Title :
Fault tolerant data structures
Author :
Aumann, Yonatan ; Bender, Michael A.
Author_Institution :
Dept. of Math. & Comput. Sci., Bar-Ilan Univ., Ramat-Gan, Israel
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
Keywords :
fault tolerant computing; tree data structures; dictionary tree; fault tolerant data structures; linked list; memory faults; pointer-based data structures; stack; trees; Application software; Computer science; Data structures; Dictionaries; Fault tolerance; Laboratories; Mathematics; Resilience; Tail; Tree data structures;
Conference_Titel :
Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on
Conference_Location :
Burlington, VT
Print_ISBN :
0-8186-7594-2
DOI :
10.1109/SFCS.1996.548517
