Fully Scalable Fault-Tolerant Simulations for BSP and CGM

Journal of Parallel and Distributed Computing

Volumn 60, Issue 12, 2000, Pages 1531-1560

  Kim, Sung Ryul ^a   Park, Kunsoo ^a  

^a Seoul National University   (South Korea)

Author keywords

Fault tolerance; BSP; CGM; generalized butterfly; distance tree

Indexed keywords

EID: 0345851308     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.2000.1659     Document Type: Article

References (32)

1. Berenbrink P., Meyer auf der Heide F., Stemann V. Fault-tolerant shared memory simulations. Proc. 13-th Annual Symp. on Theoretical Aspects of Computer Science. 1996;. p. 181-192.
2. Buss J. F., Kanellakis P. C., Ragde P. L., Shvartsman A. A. Parallel algorithms with processor failures and delays. J. Algorithms. 10:1996;45-86.
3. Chlebus B. S., Gambin A., Indyk P. PRAM computations resilient to memory faults. Proc. of 2nd Annual European Symp. on Algorithms. Lecture Notes in Computer Science. 855:1994;Springer-Verlag, Berlin/New York. p. 401-412.
4. Chlebus B. S., Gambin A., Indyk P. Shared-memory simulations on faulty DMM. Proc. 23rd International Coloquium on Automata, Languages, and Programming. 1996.
5. Chlebus B. S., Gasieniec L., Pelc A. Fast deterministic simulation of computations on faulty parallel machines. Proc. 3rd Annual European Symp. on Algorithms. Lecture Notes in Compuber Science. 979:1995;Springer-Verlag, Berlin/New York. p. 89-101.
6. Culler D. E., Karp R. M., Paterson D. A., Schauser K. E., Sahay A., Santos E., Subramonian R., von Eicken T. LogP: Towards a realistic model of parallel computation. Proc. 4th, ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming. 1993;. p. 1-12.
7. Dehne F., Fabri A., Rau-Chaplin A. Scalable parallel computational geometry for coarse grained multicomputers. Proc. of ACM Symposium on Computational Geometry. 1993;. p. 298-307.
8. Dehne F., Song S. W. Randomized parallel list ranking for distributed memory multiprocessors. Internat. J. Parallel Programming. 1997.
9. Diks K., Pelc A. Reliable computations on the faulty EREW PRAM. Theoret. Comput. Sci. 164:1996;107-122.
10. Gasieniec L., Indyk P. Efficient parallel computing with memory faults. Proc. Foundation of Computation Theory. 1997.
11. Gerbessiotis A. V., Siniolakis C. J. Technical Report. 1996.
12. Gerbessiotis A. V., Valiant L. G. Technical Report. 1992.
13. Goodrich M. T. Communication-efficient parallel sorting. Proc. of 28-rd Annual ACM Symp. on Theory of Computing. 1996;. p. 247-256.
14. Goodrich M. T. Randomized fully-scalable BSP techniques for multi-searching and convex hull construction. Proc. of 8th ACM-SIAM Symp. on Discrete Algorithms. 1997.
15. JáJá J. An Introduction to Parallel Algorithms. 1992;Addison-Wesley, Reading.
16. Kanellakis P. C., Shvartsman A. A. Efficient parallel algorithms can be made robust. Distrib. Comput. 5:1992;201-217.
17. Kanellakis P. C., Michailidis D., Shvartsman A. A. Controlling memory access concurrency in efficient fault-tolerant parallel algorithms. Nordic J. Comput. 2:1995;146-180.
18. Karp R. M., Sahay A., Santos E., Schauser K. E. Optimal broadcast and summation in the LogP model. Proc. 5th ACM Symp. on Parallel Algorithms and Architectures. 1993;. p. 142-153.
19. Kedem Z. M., Palem K. V., Raghunathan A., Spirakis P. Combining tentative and definite executions for very fast dependable parallel computing. Proc. of 23rd Annual ACM Symp. on Theory of Computing. 1991;. p. 381-390.
20. Kedem Z. M., Palem K. V., Spirakis P. Efficient robust parallel computations. Proc. 22-nd Annual ACM Symp. on Theory of Computing. 1990;. p. 381-390.
21. Knuth D. E. The Art of Computer Programming, Vol. 3: Sorting and Searching. 1973;Addison-Wesley, Reading.
22. Kontogiannis S. C., Pantziou G. E., Spirakis P. Efficient computations on fault-prone BSP machines. Proc. 9th ACM Symp. on Parallel Algorithms and Architectures. 1997.
23. Kontogiannis S. C., Pantziou G. E., Spirakis P., Yung Moti. Efficient computations on fault-prone bsp machines. Proc. 10-th ACM Symp. on Parallel Algorithms and Architectures. 1998.
24. Leighton F. T. Introduction to Parallel Algorithms and Architectures. 1992;Morgan Kaufmann, San Mateo.
25. Leighton T., Maggs B., Ranade A., Rao S. Randomized algorithms for routing and sorting in fixed-connection networks. J. Algorithms. 1991.
26. Leighton T., Maggs B., Rao S. Universal packet routing algorithms. Proc. 29-th Annual Symp. on Foundations of Computer Science. 1988;. p. 256-271.
27. Ranade A. How to emulate shared memory. Proc. 28th Annual Symp. on Foundations of Computer Science. 1987;. p. 185-194.
28. Ranade A. Fluent Parallel Computation. 1988;Yale University, New Haven.
29. Valiant L. G. A scheme for fast parallel communication. SIAM J. Comput. 11:1982;350-361.
30. Valiant L. G. A bridging model for parallel computation. Comm. Assoc. Comput. Mach. 33:1990;102-111.
31. Valiant L. G. General purpose parallel architectures. van Leeuwen J. Handbook of Theoretical Computer Science. 1990;943-972.
32. Valiant L. G., Brebner G. Universal schemes for parallel communication. Proc. 13th ACM Symp. on Theory of Computing. 1981;. p. 263-227.