Performing work efficiently in the presence of faults

SIAM Journal on Computing

Volumn 27, Issue 5, 1998, Pages 1457-1491

  Dwork, Cynthia ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Byzantine agreement; Distributed systems; Fault tolerance; Load balancing; Work

Indexed keywords

EID: 0001280843     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793255527     Document Type: Article

References (3)

1. R. J. ANDERSON AND H. WOLL, Algorithms for the certified write-all problem, SIAM J. Cornput., 26 (1997), pp. 1277-1283. A preliminary version, containing other results, appears in Proc. 23rd ACM Symposium on Theory of Computing, 1991, pp. 370-380 (with the title Wait free parallel algorithms for the union-find problem).
2. H. ATTIYA, A. BAR-NOY, AND D. DOLEV, Sharing memory robustly in message-passing systems, J. Assoc. Comput. Mach., 42 (1995), pp. 124-142. A preliminary version appears in Proc. 9th ACM Symposium on Principles of Distributed Computing, 1990, pp. 363-375.
3. A. BAR-NOY AND D. DOLEV, A partial equivalence between shared-memory and messagepassing in an asynchronous fail-stop distributed environment, Math. Systems Theory, 26 (1993), pp. 21-39.