Computing with faulty arrays

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 162-169

  Aumann, Yonatan ^a   Ben Or, Michael ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

MESH GENERATION; ARRAYS; COMPUTER ARCHITECTURE; COMPUTER SYSTEM RECOVERY; FAULT TOLERANT COMPUTER SYSTEMS; PARALLEL PROCESSING SYSTEMS; PROBABILITY; RANDOM PROCESSES;

MEMORY MODULES;

COMPUTATION THEORY; COMPUTATIONAL METHODS;

FAULTY MESH; SLACK; SLOWDOWN EMULATION;

EID: 0026993994     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129729     Document Type: Conference Paper

References (11)

1. Y. Aumann and M. Ben-Or. Asymptotically optimal PRAM emulation on faulty hypercubes. In Proceedings of the 32nd Annual Symposium on the Foundations of Computer Science, pages 440-446, 1991.
2. G. Grimmet. Percolation. Springer-Verlag, 1989.
3. C. Kaklamanis, A.R. Karlin, F.T. Leighton, V. Milenkovoc, P. Raghavan, S. Roa, C. Thomborson, and A. Tsanti-las. Asymptotically tight bounds for computing with faulty arrays of processors. In Proceedings of the 31st Annual Symposium on the Foundations of Computer Science, pages 285-296, 1990.
4. R. Koch, T. Leighton, B. Maggs, S. Rao, and A. Rosenberg. Work-preserving emulations of fixed-connection networks. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, Seattle, Washington, pages 227-240, May 1989. To appear.
5. Z.M. Kedem, K.V. Palem, A. Raghu-nathan, and P.G. Spirakis. Combining tentative and definite executions for very fast dependable parallel computing. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pages 381-390, May 1991.
6. Z.M. Kedem, K.V. Palem, and P.G. Spirakis. Efficient robust parallel computations. In Proceedings of the 22rd Annual ACM Symposium on Theory of Computing, pages 138-148, 1990.
7. P.C. Kanellakis and A.A. Shvartsman. Efficient parallel algorithms can be made robust. In Proceedings of the 8th ACM Symposium on Principles of Distributed Computing, pages 211-222, 1989.
8. C. Martel, R. Subramonian, and A. Park. Asynchronous PRAMs are (almost) as good as synchronous PRAMs. In Proceedings of the 31th Annual Symposium on the Foundations of Computer Science, pages 590-599,1990.
9. M. O. Rabin. Efficient dispeisal of information for security, load balancing and fault tolerance. Journal of the ACM, 36(2):335-348, April 1989.
10. P. Raghavan. Robust algorithms for packet routing in the mesh. In Proceedings of the 1st ACM Symposium on Parallel Algorithms and Architectures, June 1989.
11. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, August 1990.