Bounding work and communication in robust cooperative computation

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

Volumn 2508, Issue , 2002, Pages 295-310

  Chlebus, Bogdan S ^a,b   Gąsieniec, Leszek ^c   Kowalski, Dariusz R ^b,d   Shvartsman, Alex A ^e,f  

^a The University of Colorado Denver   (United States)

^b UNIVERSITY OF WARSAW   (Poland)

^c UNIVERSITY OF LIVERPOOL   (United Kingdom)

^d UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

^e University of Connecticut   (United States)

^f MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MESSAGE PASSING;

ADAPTIVE ADVERSARY; COOPERATIVE COMPUTATION; INDEPENDENT TASKS; LOWER BOUNDS; PERFORMANCE OF ALGORITHM; POINT TO POINT; UPPER BOUND;

COOPERATIVE COMMUNICATION;

EID: 84927949869     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36108-1_20     Document Type: Conference Paper

References (20)

1. N. Alon, Eigenvalues and expanders, Combinatorica, 6 (1986) 83-96.
2. N. Alon, H. Kaplan, M. Krivelevich, D. Malkhi, and J. Stern, Scalable secure storage when half the system is faulty, in Proc., 27thInt. Colloquium on Automata, Languages and Programming, 2000, Springer LNCS 1853, pp. 577-587.
3. N. Alon, and V.D. Milman, λ1, isoperimetric inequalities for graphs, and superconcentrators, J. Combin. Theory Ser. B, 38 (1985) 73-88.
4. B.S. Chlebus, R. De Prisco, and A.A. Shvartsman, Performing tasks on synchronous restartable message-passing processors, Distributed Computing, 14 (2001) 49-64.
5. B.S. Chlebus, and D.R. Kowalski, Gossiping to reach consensus, in Proc., 14th ACM Symp. on Parallel Algorithms and Architectures, 2002, Winnipeg, Manitoba, Canada, to appear.
6. B.S. Chlebus, and D.R. Kowalski, Randomization helps to perform independent tasks reliably, submitted. A preliminary version appeared as: Randomization helps to perform tasks on processors prone to failures, in Proc. 13thInt. Symposium on Distributed Computing, 1999, Springer LNCS 1693, pp. 284-296.
7. B.S. Chlebus, D.R. Kowalski, and A. Lingas, The do-all problem in broadcast networks, in Proc., 20thA CM Symp. on Principles of Distributed Computing, 2001, Newport, Rhode Island, pp. 117-126.
8. A. Clementi, A. Monti, and R. Silvestri, Optimal f-reliable protocols for the doall problem on single-hop wireless networks, in Proc., 13thInt. Symposium on Algorithms and Computation, 2002, to appear.
9. H. Davenport, “Multiplicative Number Theory,” 2nd ed. revised by H.L. Montgomery, Springer Verlag, Berlin, 1980.
10. R. De Prisco, A. Mayer, and M. Yung, Time-optimal message-efficient work performance in the presence of faults, in Proc. 13thA CM Symp. on Principles of Distributed Computing, 1994, pp. 161-172.
11. K. Diks, and A. Pelc, Optimal adaptive broadcasting with a bounded fraction of faulty nodes, Algorithmica, 28 (2000) 37-50.
12. C. Dwork, J. Halpern, and O. Waarts, Performing work efficiently in the presence of faults, SIAM J. on Computing, 27 (1998) 1457-1491.
13. A. Fiat and J. Saia, Censorship resistant peer-to-peer content addressable networks, in Proc., 13thA CM-SIAM Symp. on Discrete Algorithms, 2002.
14. Z. Galil, A. Mayer, and M. Yung, Resolving message complexity of byzantine agreement and beyond, in Proc. 36thIEEE Symp. on Foundations of Computer Science, 1995, pp. 724-733.
15. C. Georgiou, A. Russell, and A.A. Shvartsman, The complexity of synchronous iterative do-all with crashes, in Proc., 15thInt. Symposium on Distributed Computing, 2001, Springer LNCS 2180, pp. 151-165.
16. P.C. Kanellakis, and A.A. Shvartsman, Efficient parallel algorithms can be made robust, Distributed Computing, 5 (1992) 201-217.
17. A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica, 8 (1988) 261-277.
18. G.A. Margulis, Explicit constructions of concentrators, Prob. Per. Infor. 9 (1973) 71-80 English transl. in Problems of Information Transmission, (1975) 325-332.
19. R.M. Tanner, Explicit concentrators from generalized N-gons, SIAM J. Alg. Disc. Methods, 5 (1984) 287-293.
20. E. Upfal, Tolerating a linear number of faults in networks of bounded degree, Information and Computation, 115 (1994) 312-320.