Lossless fault-tolerant data structures with additive overhead
Author(s)Christiano, Paul F.; Demaine, Erik D.; Kishore, Shaunak
MetadataShow full item record
We develop the first dynamic data structures that tolerate δ memory faults, lose no data, and incur only an O(δ ) additive overhead in overall space and time per operation. We obtain such data structures for arrays, linked lists, binary search trees, interval trees, predecessor search, and suffix trees. Like previous data structures, δ must be known in advance, but we show how to restore pristine state in linear time, in parallel with queries, making δ just a bound on the rate of memory faults. Our data structures require Θ(δ) words of safe memory during an operation, which may not be theoretically necessary but seems a practical assumption.
12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011. Proceedings
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Algorithms and Data Structures
Springer Berlin / Heidelberg
Christiano, Paul, Erik D. Demaine, and Shaunak Kishore. “Lossless Fault-Tolerant Data Structures with Additive Overhead.” Algorithms and Data Structures. Ed. Frank Dehne, John Iacono, & Jörg-Rüdiger Sack. LNCS Vol. 6844. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. 243–254.
Author's final manuscript