Robust parallel computations through randomization

Theory of Computing Systems

Volumn 33, Issue 5-6, 2000, Pages 427-464

  Kontogiannis, S C ^a,b   Pantziou, G E ^b,c   Spirakis, P G ^a,b   Yung, M ^d  

^a UNIVERSITY OF PATRAS   (Greece)

^b University of Patras and Computer Technology Institute   (Greece)

^c UNIVERSITY OF WEST ATTICA   (Greece)

^d CertCo   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL PROCESSING SYSTEMS;

COMPUTATIONAL PARADIGM; DISTRIBUTED MEMORY SYSTEMS; MULTIPLICATIVE FACTORS; NETWORK OF WORKSTATIONS; PARALLEL COMPUTATION; ROBUST COMPUTATION; SIMULATION STRATEGIES; VIRTUAL PARALLEL MACHINES;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0034562610     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s002240010009     Document Type: Article

References (35)

1. N. Alon and J. Spencer. The Probabilistic Method. Wiley Interscience, New York, 1992.
2. Y. Aumann, M. Bender, and L. Zhang. Efficient execution of non-deterministic parallel programs on asynchronous systems. In Proc. of the 8th ACM Symposium on Parallel Algorithms and Architectures, 1996, pp. 270-276.
3. Y. Aumann, Z. Kedem, K. Palem, and M. Rabin. Highly efficient asynchronous execution of large-grained parallel programs. In Proc. of the 34th Annual Symposium on Foundations of Computer Science, 1993, pp. 271-280.
4. A. Baumker, W. Dittrich, and F. meyer auf der Heide. Truly efficeint parallel algorithms: c-optimal multisearch for an extension of the BSP model. In Proc. of the 3rd Annual European Symposium on Algorithms, LNCS 979, Springer-Verlag, Berlin, 1995, pp. 17-30.
5. P. Berenbrink, F. Meyer auf der Heide, and V. Stemann. Fault-tolerant shared memory simulations. In Proc. of the 13th Annual Symposium on Theoretical Aspects of Computer Science (STACS '96), Springer-Verlag, Berlin, 1996, pp. 181-192.
6. R. Blumofe and C. Leiserson. Scheduling multithreaded computations by work stealing. In Proc. of the 35th Annual Symposium on Foundations of Computer Science, 1994, pp. 356-368.
7. B. Chlebus, A. Gambin, and P. Indyk. PRAM computations resilient to memory faults. In Proc. of the 2nd Annual European Symposium on Algorithms (ESA '94), LNCS 855, Springer-Verlag, Berlin, 1994, pp. 401-412.
8. B. Chlebus, A. Gambin, and P. Indyk. Shared-memory simulations on a faulty DMM. In Proc. of the International Colloquium on Automata, Languages and Programming, 1996, pp. 586-597.
9. B. Chlebus, L. Gasieniec, and A. Pelc. Fast deterministic simulation of computations on faulty parallel machines. In Proc. of the 3rd Annual European Symposium on Algorithms, LNCS 979, Springer-Verlag, Berlin, 1995, pp. 89-101.
10. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
11. P. Dasgupta, Z. Kedem, and M. Rabin. Parallel processing on networks of workstations: a fault tolerant, high performance approach. In Proc. of the 15th International Conference on Distributed Systems, 1995, pp. 467-474.
12. R. De Prisco, A. Mayer, and M. Yung. Time-optimal message-efficient work performance in the presence of faults. In Proc. of the ACM Symposium of Distributed Computing, 1994, pp. 161-171.
13. D. Dubhashi, V. Priebe, and D. Ranjan. Negative Dependence through the FKG Inequality. BRICS Report Series, RS-96-27, ISSN 0909-0878.
14. D. Dubhashi and D. Ranjan. Balls and Bins: a Study in Negative Dependence. BRICS Report Series, RS-96-25, ISSN 0909-0878.
15. C. Dwork, J. Halpern, and O. Waarts. Performing work efficiently in the presence of faults. In Proc. of the 11th ACM Symposium on Principles of Distributed Computing, 1992, pp. 91-102.
16. Z. Galil, A. Mayer, and M. Yung. Resolving message complexity of Byzantine agreement and beyond. In Proc. of the 36th IEEE Annual symposium on Foundations of Computer Science, 1995, pp. 724-733.
17. J. Garofalakis, S. Rajsbaum, P. Spirakis, and B. Tampakas. Tentative and definite distributed computations: an optimistic approach to network synchronization. Journal of Theoretical Computer Science, 128(1-2):63-74, 1994.
18. A. Gerbessiotis and C. Siniolakis. Communication Efficient Data Structures on the BSP Model with Applications. Technical Report PRG-TR-13-96, Oxford University, May 1996.
19. A. Gerbessiotis and L. Valiant. Direct bulk-synchronous parallel algorithms. Journal of Parallel and Distributed Computing, 22:251-267, 1994.
20. M. Gereb-Graus and T. Tsantilas. Efficient optical communication in parallel computers. In Proc. of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '92), 1992, pp. 41-48.
21. A. Kamath, R. Motwani, K. Palem, and P. Spirakis. Tail bound for occupancy and the satisfiability threshold conjecture. In Proc. of the 35th IEEE Annual Symposium on Foundations of Computer Science, 1994, pp. 592-603.
22. P. Kanellakis and A. Shvartsman. Efficient parallel algorithms on restartable fail-stop processors. In Proc. of the 10th Annual ACM Symposium on Principles of Distributed Computing, 1991, pp. 23-36.
23. P. Kanellakis and A. Shvartsman. Efficient parallel algorithms can be made robust. Distributed Computing, 5:201-217, 1992.
24. P. Kanellakis and A. Shvartsman. Fault-Tolerant Parallel Computation. Kluwer Academic, Dordrecht, ISBN 0-7923-992-6, 1997.
25. Z. Kedem, K. Palem, A. Raghunathan, and P. Spirakis. Combining tentative and definite executions for very fast dependable parallel computing. In Proc. of the 23rd Annual ACM Symposium on Theory of Computing, 1991, pp. 381-390.
26. Z. Kedem, K. Palem and P. Spirakis. Efficient robust parallel computations. In Proc. of the 22nd Annual ACM Symposium on Theory of Computing, 1990, pp. 138-148.
27. S. Kontogiannis, G. Pantziou, and P. Spirakis. Efficient computations on fault-prone BSP machines. In Proc. of the 9th ACM Symposium on Parallel Algorithms and Architectures, 1997, pp. 84-93. Full version at http://www.ceid.upatras.gr/~kontog/bsp/spaa97/
28. S. Kontogiannis, G. Pantziou, P. Spirakis, and M. Yung. Dynamic-fault-prone BSP: a paradigm for robust computations in changing environments. In Proc. of the 10th ACM Symposium on Parallel Algorithms and Architectures, Puerto Vallarta, Mexico, June 28-July 2, 1998, pp. 31-46. Full version at http://www.ceid/upatras.gr/~kontog/bsp/spaa98/
29. F. T. Leighton, B. M. Maggs, and R. K. Sitaraman. On the fault tolerance of some popular bounded-degree networks. SIAM Journal on Computing, 27(5):1303-1333, 1998.
30. W. F. McColl. Scaleable parallel computing: a grand unified theory and its practical development. In Proc. of IFIP World Congress, Hamburg, August, 1994, Vol. 1, pp. 539-546.
31. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, 1995.
32. M. Rabin. Efficient dispersal of information for security, load balancing and fault tolerance. Journal of the Association for Computing Machinery, 36(2): 335-348, April 1989.
33. M. Sipser and D. Spielman. Expander codes. In Proc. of 35th Annual Symposium on Foundations of Computer Science, 1994, pp. 566-576.
34. L. Valiant. A bridging model of parallel computation. Communications of the ACM, 33(8): 103-111, August 1990.
35. L. Valiant. General purpose parallel architectures. In Handbook of Theoretical Computer Science, J. van Leeuwen ed. North-Holland, Amsterdam, 1990, pp. 943-972.