Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Fault-Tolerant Data Structures Yonatan Aumann
 

Summary: Fault-Tolerant Data Structures
Yonatan Aumann
Department of Computer Science
Bar-Ilan University
Ramat-Gan 52900
Israel
aumann@cs.biu.ac.il
Michael A. Bender
Department of Computer Science
State University of New York
Stony Brook, NY 11794-4400
USA
bender@cs.sunysb.edu
Abstract
We study the tolerance of data structures to memory faults. We observe that many pointer-
based 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.

  

Source: Aumann, Yonatan - Computer Science Department, Bar Ilan University

 

Collections: Computer Technologies and Information Sciences