Lossless fault-tolerant data structures with additive overhead

Authors:
Paul Christiano;Erik D. Demaine;Shaunak Kishore
Affiliations:
MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA;MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA;MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA
Venue:
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Year:
2011

Citing 11
Cited 0

External-memory graph algorithms

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On the sorting-complexity of suffix tree construction

Journal of the ACM (JACM)
Marked Ancestor Problems

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Fault tolerant data structures

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Resilient search trees

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A memory soft error measurement on production systems

ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
Sorting and Searching in Faulty Memories

Algorithmica
Optimal resilient sorting and searching in the presence of memory faults

Theoretical Computer Science
Resilient dictionaries

ACM Transactions on Algorithms (TALG)
Optimal resilient dynamic dictionaries

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Linear-time encodable and decodable error-correcting codes

IEEE Transactions on Information Theory - Part 1

Quantified Score

Hi-index	0.01

Visualization

Abstract

We develop the first dynamic data structures that tolerate δ memory faults, lose no data, and incur only an Õ(δ) 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.