Time-optimal message-efficient work performance in the presence of faults

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn Part F129432, Issue , 1994, Pages 161-172

  De Prisco, Roberto ^a,b   Mayer, Alain ^a   Yung, Moti ^c  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b UNIVERSITY OF SALERNO   (Italy)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COST EFFECTIVENESS; DISTRIBUTED COMPUTER SYSTEMS;

COMPLEXITY MEASURES; DISTRIBUTED ENVIRONMENTS; DYNAMIC PROCESS; PARALLEL PROCESSOR; PERFORMANCE AND RELIABILITIES; PERFORMING WORK; SYNCHRONOUS PROCESS; WORK PERFORMANCE;

EFFICIENCY;

EID: 85012232388     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/197917.198082     Document Type: Conference Paper

References (15)

1. S. Amdur, V. Hadzilacos, and S. Weber, On the Message Complexity of Binary Agreement Under Crash Failures. Distrib. Comput, 5:175-186, 1992.
2. D. Atkins, M. Graff, A. Lenstra, and P. Leyland, Internet announcement, April, 1994.
3. T. D. Chandra, A. Mayer, and M. Yung, Subquadratic-Message Early-Stopping Fail-Stop Agreement. manuscript in preparation.
4. T. D. Chandra and S. Toueg, Time and Message Efficient Reliable Broadcast. Proc. Int. Workshop on Distributed Algorithms 1990, LNCS Springer-Verlag, 289-303.
5. D. Dolev, R. Reischuk, and H. R. Strong, Early Stopping in Byzantine Agreement. Journal of the ACM, 37(4):720-741, 1990.
6. C. Dwork, J. Halpern, and O. Waarts, Performing Work Efficiently in the Presence of Faults. Proc. 11th ACM Symp. on Principles of Distributed Computing (1992).
7. Full version of DHW92 (preprint), Personal Communication by J. Halpern.
8. M. J. FEELEY, B. N. BERSHAD, J. S. CHASE and H. M. LEVY, Dynamic Node Reconfiguration in a Parallel-Distributed Environment Proc. 3-d A CM Princ. and Practice of Parallel Prog., 114-121, 1991.
9. V. Hadzilacos and J. Halpern, Message-Optimal Protocols for Byzantine Agreement. Math. Systems Theory 26, 41-102 (1993). (Also PODC'91).
10. D. L. Kaminsky, Adaptive Parallelism in Piranha. Ph. D. Thesis (draft) Yale University, 1994.
11. P. Kanellakis and A. Shvartsman, Efficient Parallel Algorithms Can Be Made Robust. Distrib. Comput, 5:201-219, 1992. (Also PODC'89).
12. A. K. Lenstra and M. S. Manasse, Factoring by electronic mail. Proc. Eurocrypt 89, LNCS 434, Springer Verlag, pp. 355-371, 1990.
13. M. Litzkow, M. Livny and M. Mutka, Condora Hunter of Idle Workstations. Proc. 8th Int. Symp. on Distributed Computing Systems. 1988
14. R. Silverman, Massively Distributed Computing and Factoring Large Integers. Comm. of the ACM, 34(2):95-103, 1991.
15. M. Theimer, K. Lantz and D. Cheriton, Preemptable Remote Execution Facilities for the V-System. Proc. 10th ACM Symp. on Operating Systems Principles. 2-12, 1985.