Error models for robust storage structures

The error models which have appeared in the literature are described and compared. The comparison includes an informal discussion and comparison of detectability and correctability results obtainable with the various models. The ideal comparison basis would be errors produced by real faults in real systems. No such data are available, and an experiment to obtain such data would be extremely costly. One particular case can be used: the errors resulting from crashes (partially completed updates of storage structures) are easily determined and are used as the final basis of comparison.<<ETX>>

[1]  W. Kent Fuchs,et al.  Local Concurrent Error Detection and Dorrection in Data Structures Using Virtual Backpointers , 1989, IEEE Trans. Computers.

[2]  Krishna Kant,et al.  Fault identification in robust data structures , 1989, [1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[3]  J. Ian Munro,et al.  Fault Tolerance and Storage Reduction in Binary Search Trees , 1984, Inf. Control..

[4]  David J. Taylor,et al.  Redundancy in Data Structures: Some Theoretical Results , 1980, IEEE Transactions on Software Engineering.

[5]  James P. Black,et al.  Redundancy in Data Structures: Improving Software Fault Tolerance , 1980, IEEE Transactions on Software Engineering.

[6]  Carl-Johan H. Seger,et al.  Robust Storage Structures for Crash Recovery , 1986, IEEE Transactions on Computers.

[7]  Krishna Kant,et al.  Synthesizing Robust Data STructures - An Introduction , 1990, IEEE Trans. Computers.