Performing tasks on restartable Message–Passing processors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1320, Issue , 1997, Pages 96-110

  Chlebus, Bogdan S ^a   De Prisco, Roberto ^b   Shvartsman, Alex A ^c  

^a UNIVERSITY OF WARSAW   (Poland)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c University of Connecticut   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MESSAGE PASSING;

FAULT-PRONE; MESSAGE COMPLEXITY; SYNCHRONOUS SYSTEM;

COMPUTATIONAL COMPLEXITY;

EID: 84949226040     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030678     Document Type: Conference Paper

References (11)

1. R. De Prisco, A. Mayer, and M. Yung, “Time-Optimal Message-Efficient Work Performance in the Presence of Faults,” in Proc. 13th ACM Symposium on Principles of Distributed Computing, 1994, pp. 161-172.
2. C. Dwork, J. Halpern, O. Waarts, “Performing Work Efficiently in the Presence of Faults”, to appear in SI AM J. on Computing, prelim, vers, appeared as Accomplishing Work in the Presence of Failures in Proc. 11th ACM Symposium on Principles of Distributed Computing, pp. 91-102, 1992
3. Z. Galil, A. Mayer, and M. Yung, “Resolving Message Complexity of Byzantine Agreement and Beyond,” in Proc. 36th IEEE Symposium on Foundations of Computer Science, 1995, pp. 724-733.
4. V. Hadzilacos and S. Toueg, "Fault-Tolerant Broadcasts and Related Problems," in Distributed Systems, 2nd Ed., S. Mullender, Ed., Addison-Wesley and ACM Press, 1993.
5. P.C. Kanellakis, D. Michailidis, A.A. Shvartsman, “Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms”, Nordic J. of Computing, vol. 2, pp. 146-180, 1995 (prel. vers, in WDAG-7, pp. 99-114, 1993).
6. P.C. Kanellakis and A.A. Shvartsman, “Efficient Parallel Algorithms Can Be Made Robust,” Distributed Computing, vol. 5, pp. 201-217, 1992; prel. version in Proc. of the 8th ACM Symp. on Principles of Distributed Computing, 1989, pp. 211-222.
7. P.C. Kanellakis and A.A. Shvartsman, Fault-Tolerant Parallel Computation, ISBN 0-7923-9922-6, Kluwer Academic Publishers, 1997.
8. Z.M. Kedem, K.V. Palem, and P. Spirakis, “Efficient Robust Parallel Computations,” Proc. 22nd ACM Symp. on Theory of Computing, pp. 138-148, 1990.
9. Z.M. Kedem, K.V. Palem, M.O. Rabin, A. Raghunathan, “Efficient Program Transformations for Resilient Parallel Computation via Randomization,” in Proc. 24th ACM Symp. on Theory of Comp., pp. 306-318, 1992.
10. C. Martel, personal communication, March, 1991.
11. C. Martel, R. Subramonian, and A. Park, “Asynchronous PRAMs are (Almost) as Good as Synchronous PRAMs,” in Proc. 32d IEEE Symposium on Foundations of Computer Science, pp. 590-599, 1990.