Abstract
We investigate the coded model of fault-tolerant computations introduced by D. Spielman. In this model the input and the output of a computational circuit is treated as words in some error-correcting code. A circuit is said to compute some function correctly if for an input which is a encoded argument of the function, the output, been decoded, is the value of the function on the given argument.
We consider two models of faults. In the first one we suppose that an elementary processor at each step can be corrupted with some small probability, and faults of different processors are independent. For this model, we prove that a parallel computation running on n elementary non-faulty processors in time t = poly(n) can be simulated on O(nlogn / log log n) faulty processors in time O(tlog log n). Note that we get a sub-logarithmic blow up of the memory, which cannot be achieved in the classic model of faulty boolean circuit, where the input is not encoded.
In the second model, we assume that at each step some fixed fraction of elementary processors can be corrupted by an adversary, who is free to chose these processors arbitrarily. We show that in this model any computation can be made reliable with an exponential blow up of the memory.
Our method employs a sort of mixing mappings, which enjoy some properties of expanders. Based on mixing mappings, we implement an effective self-correcting procedure for an array of faulty processors.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
von Neuman, J.: Probabilistic logics and the synthesis of reliable organisms from unreliable components. In: Shannon, C., McCarthy, J. (eds.) Automata Studies, Princeton University Press, Princeton (1956)
Kuznetsov, A.V.: Information storage in a memory assembled from unreliable components. Problems of Information Transmission 3, 254–264 (1973)
Dobrushin, R.L., Ortyukov, S.L.: Upper bound for the redundancy of self-correcting arrangement of unreliable functional elements. Problems for Information Transmission 13(1), 203–218 (1977)
Dobrushin, R.L., Ortyukov, S.L.: Lower bound on the redundancy of self-correcting arrangement of unreliable functional elements. Problems for Information Transmission 13(1), 201–208 (1977)
Pippenger, N.: On Networks of Noisy gates. In: Proc. of the 26-th IEEE FOCS Symposium, pp. 30–38 (1985)
Pippenger, N., Stamoulis, G.D., Tsitsikilis, J.N.: On a lower bound on for the redundancy of reliable networks with noisy gates. IEEE Trans. Inform. Theory 37(3), 639–643 (1991)
Reischuk, R., Schmeltz, B.: Reliable computation with noisy circuits and decision trees – a general nlogn lower bound. In: Proc. of the 32-th IEEE FOCS Symposium, pp. 602–611 (1991)
Gács, P., Gál, A.: Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates. IEEE Transactions Information Theory 40, 579–583 (1994)
Gál, A., Szegedy, M.: Fault Tolerant Circuits and Probabilistically Checkable proofs. In: Proc. of 10th Annual Structure in Complexity Theory Conference, pp. 65–73 (1995)
Spielman, D.A.: Highly fault-Tolerant parallel Computation. In: Proc. of the 37-th IEEE FOCS Symposium, pp. 154–163 (1996)
Goldreich, A., Wigderson, A.: Tiny Families of Functions with Random Properties: a Quality-Size Trade-off for Hashing. Random Struct. Algorithms 11(4), 315–343 (1997)
Reingold, O., Vadhan, S., Wigderson, A.: Entropy waves, the zig-zag product, and new constant degree expanders. Annals of Mathematics 155(1), 157–187 (2002)
Goldreich, O., Karloff, H.J., Schulman, L.J., Trevisan, L.: Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval. IEEE Conference on Computational Complexity, 175–183 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Romashchenko, A. (2006). Reliable Computations Based on Locally Decodable Codes. In: Durand, B., Thomas, W. (eds) STACS 2006. STACS 2006. Lecture Notes in Computer Science, vol 3884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11672142_44
Download citation
DOI: https://doi.org/10.1007/11672142_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32301-3
Online ISBN: 978-3-540-32288-7
eBook Packages: Computer ScienceComputer Science (R0)