D. Spielman, "Highly Fault-Tolerant Parallel Computation," in Proceedings of the 37th Annual IEEE Conference on Foundations of Computer Science 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Scalable Defect Tolerance for Molecular Electronics - Mishra, Goldstein (2002) (1 citation) (Correct)
....However, the problem we address is significantly harder because the Teramac used CMOS devices whose defect rates are much lower than those predicted for nanofabrics. An alternative approach to achieve defect tolerance would be to use techniques developed for fault tolerant circuit design (e.g. [7, 8]) Such circuit designs range from simple ones involving triple mode redundancy to more complex circuits that perform computation in an alternative, sparse code space, so that a certain number of errors in the output (up to half the minimum distance between any two code words) can be corrected. ....
D. A. Spielman, "Highly Fault-Tolerant Parallel Computation, " in Proceedings of the 37th Annual IEEE Conference on Foundations of Computer Science, pp. 154--163, 1996.
Lectures on Reliable Cellular Automata - Gács (Correct)
....problem of reliable computation with unreliable components was addressed in [40] in the context of Boolean circuits. Von Neumann s solution, as well as its improved versions in [7] and [29] rely on high connectivity and non uniform constructs. The best currently known result of this type is in [34] where redundancy has been substantially decreased for the case of computations whose computing time is larger than the storage requirement, and also all constructions have been made explicit (randomization eliminated with the help of expanders) Of particular interest to us are those ....
....can be performed with much less redundancy if the cost of the initial encoding is ignored. The nal decoding is generally not needed since we can use a code that contains the original word as its part. An important step in this direction has been made, in the clocked circuit model, in [34]. Spielman s work takes a parallel computation with time t running on w elementary processors and produces from it a reliable computation running only (log w) c times longer and using (log w) c times more processors. The failure probability will be t exp w 1=4 . This is small as long as t ....
Daniel A. Spielman. Highly fault-tolerant parallel computation. In Proc. of the 37th IEEE FOCS Symposium, pages 154-163, 1996.
Reliable Cellular Automata With Self-Organization - Gacs (1999) (Correct)
....problem of reliable computation with unreliable components was addressed in [29] in the context of Boolean circuits. Von Neumann s solution, as well as its improved versions in [9] and [23] rely on high connectivity and non uniform constructs. The best currently known result of this type is in [25] where redundancy has been substantially decreased for the case of computations whose computing time is larger than the storage requirement. Of particular interest to us are those probabilistic cellular automata in which all local transition probabilities are positive (let us call such automata ....
Daniel A. Spielman, Highly fault-tolerant parallel computation, Proc. of the 37th IEEE FOCS Symposium, 1996, pp. 154--163.
Lectures on Reliable Cellular Automata - Gacs (Correct)
....problem of reliable computation with unreliable components was addressed in [40] in the context of Boolean circuits. Von Neumann s solution, as well as its improved versions in [7] and [29] rely on high connectivity and non uniform constructs. The best currently known result of this type is in [34] where redundancy has been substantially decreased for the case of computations whose computing time is larger than the storage requirement, and also all constructions have been made explicit (randomization eliminated with the help of expanders) Of particular interest to us are those ....
....can be performed with much less redundancy if the cost of the initial encoding is ignored. The final decoding is generally not needed since we can use a code that contains the original word as its part. An important step in this direction has been made, in the clocked circuit model, in [34]. Spielman s work takes a parallel computation with time t running on w elementary processors and produces from it a reliable computation running only (log w) c times longer and using (log w) c times more processors. The failure probability will be t exp Gammaw 1=4 . This is small as long ....
Daniel A. Spielman. Highly fault-tolerant parallel computation. In Proc. of the 37th IEEE FOCS Symposium, pages 154--163, 1996.
Molecular Electronics: Devices, Systems and Tools for.. - Butts, DeHon, al. (2002) (Correct)
No context found.
D. Spielman, "Highly Fault-Tolerant Parallel Computation," in Proceedings of the 37th Annual IEEE Conference on Foundations of Computer Science 1996.
Reliable Cellular Automata With Self-Organization - Pet Er Acs (1998) (Correct)
No context found.
Daniel A. Spielman, Highly fault-tolerant parallel computation, Proc. of the 37th IEEE FOCS Symposium, 1996, pp. 154--163.
Reliable Cellular Automata with Self-Organization - Gacs (1998) (Correct)
No context found.
Daniel A. Spielman, Highly fault-tolerant parallel computation, Proc. of the 37th IEEE FOCS Symposium, 1996, pp. 154--163.
Defect Tolerant Probabilistic Design Paradigm for.. - Jacome, He, de.. (Correct)
No context found.
D. A. Spielman, "Highly fault-tolerant parallel computation," in Proc. 37th FOCS, 1996, pp. 154--163.
Defect Tolerance at the End of the Roadmap - Mahim Mishra And (2004) (2 citations) (Correct)
No context found.
D. A. Spielman, "Highly fault-tolerant parallel computation," in Proceedings of the 37th Annual IEEE Conference on Foundations of Computer Science (FOCS'96), Burlington, VA, USA, Oct. 14--16 1996, pp. 154--163.
Computation in Noisy Radio Networks - Kushilevitz, Mansour (16 citations) (Correct)
No context found.
D. A. Spielman, "Highly Fault-Tolerant Parallel Computation", Proc. of 37th FOCS, pp. 154-163, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC