Abstract
We develop the first dynamic data structures that tolerate δ memory faults, lose no data, and incur only an \(\tilde O(\delta)\) 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alstrup, S., Husfeldt, T., Rauhe, T.: Marked ancestor problems. In: Proc. 39th Annual Symposium on Foundations of Computer Science, pp. 534–543 (1998)
Aumann, Y., Bender, M.A.: Fault tolerant data structures. In: Proc. 37th Annual Symposium on Foundations of Computer Science, pp. 580–589 (1996)
Brodal, G.S., Fagerberg, R., Finocchi, I., Grandoni, F., Italiano, G.F., Jørgensen, A.G., Moruz, G., Mølhave, T.: Optimal resilient dynamic dictionaries. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 347–358. Springer, Heidelberg (2007)
Chiang, Y.-J., Goodrich, M.T., Grove, E.F., Tamassia, R., Vengroff, D.E., Vitter, J.S.: External-memory graph algorithms. In: Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 139–149 (1995)
Chiang, Y.-J., Tamassia, R.: Dynamic algorithms in computational geometry. Proc. IEEE 80(9), 1412–1434 (1992)
de Wolf, R.: Error-correcting data structure. In: Proc. 26th International Symposium on Theoretical Aspects of Computer Science, pp. 313–324 (February 2009)
Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. J. ACM 47, 987–1011 (2000)
Finocchi, I., Grandoni, F., Italiano, G.F.: Resilient search trees. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 547–553 (2007)
Finocchi, I., Grandoni, F., Italiano, G.F.: Optimal resilient sorting and searching in the presence of memory faults. Theoretical Computer Science 410(44), 4457–4470 (2009)
Finocchi, I., Grandoni, F., Italiano, G.F.: Resilient dictionaries. ACM Transactions on Algorithms 6(1) (2009)
Finocchi, I., Italiano, G.F.: Sorting and searching in faulty memories. Algorithmica 52(3), 309–332 (2008)
Li, X., Shen, K., Huang, M.C., Chu, L.: A memory soft error measurement on production systems. In: Proc. 2007 USENIX Annual Technical Conference, pp. 21:1–21:6 (2007)
Spielman, D.A.: Linear-time encodable and decodable error-correcting codes. IEEE Transactions on Information Theory 42(6), 1723–1732 (1996)
Tezzaron Semiconductor. Soft errors in electronic memory. White paper (January 2004), http://www.tezzaron.com/about/papers/soft_errors_1_1_secure.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Christiano, P., Demaine, E.D., Kishore, S. (2011). Lossless Fault-Tolerant Data Structures with Additive Overhead. In: Dehne, F., Iacono, J., Sack, JR. (eds) Algorithms and Data Structures. WADS 2011. Lecture Notes in Computer Science, vol 6844. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22300-6_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-22300-6_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22299-3
Online ISBN: 978-3-642-22300-6
eBook Packages: Computer ScienceComputer Science (R0)