Algorithms for the certified write-all problem

SIAM Journal on Computing

Volumn 26, Issue 5, 1997, Pages 1277-1283

  Anderson, Richard J ^a   Woll, Heather ^b  

^a University of Washington   (United States)

^b NONE   (United States)

Author keywords

Adversary models; Asynchronous computation; Certified write all problem; Synchronization primitives

Indexed keywords

EID: 0001757868     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794319126     Document Type: Article

References (6)

1. J. F. Buss, P. C. KANELLAKIS, P. L. RAGDE, AND A. A. SHVARTSMAN, Parallel algorithms with processor failures and delays, J. Algorithms, 20 (1996), pp. 45-86.
2. P. ERDÖS AND J. SPENCER, The Probabilistic Method in Combinatorics, Academic Press, New York, 1974.
3. D. E. KNUTH, Searching and sorting, in The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading, MA, 1973.
4. P. KANELLAKIS AND A. SHVARTSMAN, Efficient parallel algorithms can be made robust, Distrib. Comput., 5 (1992), pp. 202-217.
5. C. MARTEL, R. SUBRAMONIAN, AND A. PARK, Asynchronous PRAMs are (almost) as good as synchronous PRAMs, in 31st Symposium on Foundations of Computer Science, St. Louis, MO, 1990, pp. 590-599.
6. P. RAGHAVAN, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, J. Comput. System Sci., 37 (1988), pp. 130-143.