Collective asynchronous reading with polylogarithmic worst-case overhead

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 321-330

  Chlebus, Bogdan S ^a   Kowalski, Dariusz R ^b,c   Shvartsman, Alexander A ^d,e  

^a The University of Colorado Denver   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c UNIVERSITY OF WARSAW   (Poland)

^d University of Connecticut   (United States)

^e MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Collect; Distributed algorithms; Graph expansion

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; POLYNOMIALS; PROBABILITY; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

COLLECT; DISTRIBUTED ALGORITHMS; GRAPH EXTENSION; SHARED-MEMORY SYSTEMS;

PROBLEM SOLVING;

EID: 4544267687     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007406     Document Type: Conference Paper

References (45)

1. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit, Atomic snapshots of shared memory, J. ACM, 40 (1993) 873-890.
2. Y. Afek, G. Stupp, and D. Touitou, Long-lived and adaptive collect with applications, Proc., 40th IEEE Symp. on Found. of Comp. Science, 1999, pp. 262-272.
3. M. Ajtai, J. Aspnes, C. Dwork, and O. Waarts, A theory of competitive analysis of distributed algorithms, Proc., 35th IEEE Symp. of Foundations of Computer Science, 1994, pp. 401-411.
4. J. Anderson, Composite registers, Distributed Computing, 6 (1993) 141-154.
5. R.J. Anderson, and H. Woll, Algorithms for the certified write-all problem, SIAM J. Computing, 26 (1997) 1277-1283.
6. J. Aspnes, and M. Herlihy, Wait-free data structures in the asynchronous PRAM model, in Proc., 2nd ACM Symp. on Parallel Alg. and Arch., 1990, pp. 340-349.
7. J. Aspnes, and W. Hurwood, Spreading rumors rapidly despite an adversary, J. Algorithms, 26 (1998) 386-411.
8. H. Attiya, A. Fouren, and E. Gafni, An adaptive collect algorithm with applications, Distributed Computing, 15 (2002) 87-96.
9. H. Attiya, M. Herlihy, and O. Rachman, Atomic snapshots using lattice agreement, Distributed Computing, 8 (1995) 121-132.
10. H. Attiya, and O Rachman, Atomic snapshots in Script O sign(n log n) operations, SIAM J. Computing, 21 (1998) 319-340.
11. B. Awerbuch, S. Kutten, and D. Peleg, Competitive distributed job scheduling, in Proc., 24th ACM Symp. on Theory of Computing, 1992, pp. 571-580.
12. N.T.J. Bailey, The Mathematical Theory of Infectious Diseases and its Applications, Charles Griffin, London, 1975.
13. Y. Bartal, A. Fiat, and Y. Rabani, Competitive algorithms for distributed data management, in Proc., 24th ACM Symp. on Theory of Comp, 1992, pp. 39-50.
14. J. Buss, P.C. Kanellakis, P.L. Ragde, and A.A. Shvartsman, Parallel algorithms with processor failures and delays, J. Algorithms, 20 (1996) 45-86.
15. B.S. Chlebus, L. Gasieniec, D.R. Kowalski, and A.A. Shvartsman, Bounding work and communication in robust cooperative computation, in Proc., 16th Int. Symposium on Distributed Computing, 2002, Springer LNCS 2508, pp. 295-310.
16. B.S. Chlebus, and D.R. Kowalski, Gossiping to reach consensus, in Proc., 14th ACM Symp. on Parallel Algorithms and Architectures, 2002, pp. 220-229.
17. B.S. Chlebus, S. Dobrev, D.R. Kowalski, G. Malewicz, A.A. Shvartsman, and I. Vřto, Towards practical deterministic write-all algorithms, in Proc., 13th ACM Symp. on Parallel Algorithms and Arch., 2001, pp. 271-280.
18. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swineheart, and D. Terry, Epidemic algorithms for replicated database maintenance, in Proc., 6th ACM Symp. on Principles of Distributed Computing, 1987, pp. 1-12.
19. D. Dolev and N. Shavit, Bounded concurrent time-stamping, SIAM J. Computing, 26 (1997) 418-455.
20. C. Dwork, M. Herlihy, and O. Waarts, Bounded round numbers, in Proc., 12th ACM Symp. on Principles of Distributed Computing, 1993, pp. 53-64.
21. C. Dwork and O. Waarts, Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible!, Proc., 24th ACM Symp. on the Theory of Comp., 1992, pp. 655-666.
22. C. Georgiou, D.R. Kowalski, and A.A. Shvartsman, Efficient gossip and robust distributed computation, in Proc., 17th Int. Symp. on Distributed Computing, 2003, pp. 224-238.
23. C. Georgiou, A. Russell, and A.A. Shvartsman, Work-competitive scheduling for cooperative computing with dynamic groups, in Proc., 35th ACM Symposium on Theory of Computing, 2003, pp. 251-258.
24. M. Harchol-Balter, T. Leighton, and D. Lewin, Resource discovery in distributed networks, in Proc., 18th ACM Symp. on Principles of Distributed Computing, 1999, pp. 229-238.
25. A. Israeli and M. Li, Bounded time stamps Proc., 28th IEEE Symp. Found. of Computer Science, 1987, pp. 371-382.
26. P.C. Kanellakis, and A.A. Shvartsman, Efficient parallel algorithms can be made robust, Distributed Computing, 5 (1992) 201-217.
27. P.C. Kanellakis, and A.A. Shvartsman, Fault-Tolerant Parallel Computation, Kluwer Academic Pub., 1997.
28. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking, Randomized rumor spreading, in Proc., 41st IEEE Symp. on Foundations of Computer Science, 2000, pp. 565-574.
29. D. Kempe, J. Kleinberg, and A. Demers, Spatial gossip and resource location protocols, in Proc., 33rd ACM Symp. on Theory of Computing, 2001, pp. 163-172.
30. M. Li, J. Tromp, and P.M.B. Vitányi, How to share concurrent wait-free variables, J. ACM, 43 (1996) 723-746.
31. N.A. Lynch, Distributed Algorithms, Morgan Kaufmann, 1996.
32. G. Malewicz, A work-optimal deterministic algorithm for the asynchronous certified write-all problem, in Proc., 22nd ACM Symposium on Principles of Distributed Computing, 2003, pp. 255-264.
33. C. Martel, A. Park, and R. Subramonian, Work-optimal asynchronous algorithms for shared memory parallel computers, SIAM J. Computing, 21 (1992) 1070-1099.
34. M.S. Pinsker, On the complexity of a concentrator, in Proc., 7th Annual Teletraffic Conference, 1973, pp. 318/1-318/4.
35. N. Pippenger, Sorting and selecting in rounds, SIAM J. Computing, 16 (1987) 1032-1038.
36. O. Reingold, S.P. Vadhan, and A. Wigderson, Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors, Ann. Mathematics, 155 (2002) 157-187.
37. M. Saks, N. Shavit, and H. Woll, Optimal time randomized consensus-making resilient algorithms fast in practice, in Proc. 2nd SIAM-ACM Symp. Discrete Algorithms, 1991, pp. 351-362.
38. N. Shavit, "Concurrent Timestamping," Ph.D. Thesis, The Hebrew University, 1989.
39. A.A. Shvartsman, Achieving optimal CRCW PRAM fault-tolerance, Information Processing Letters, 39 (1991) 59-66.
40. D. Sleator and R. Tarjan, Amortized efficiency of list update and paging rules, Communications of the ACM, 28 (1985) 202-208.
41. A. Ta-Shma, C. Umans, and D. Zuckerman, Loss-less condensers, unbalanced expanders, and extractors, in Proc., 33rd ACM Symp. on Theory of Computing, 2001, pp. 143-152.
42. E. Upfal, Tolerating a linear number of faults in networks of bounded degree, Information and Computation, 115 (1994) 312-320.
43. P.M.B. Vitányi and B. Awerbuch, Atomic shared register access by asynchronous hardware, in Proc., 27th Symp. on Foundations of Computer Science, 1986, pp. 233-243.
44. R. van Renesse, Y. Minsky, and M. Hayden, A gossip-style failure detection service, in Proc., IFIP Int. Conf. on Distributed Systems Platforms and Open Distributed Processing, 1998, pp. 55-70.
45. A. Wigderson, and D. Zuckerman, Expanders that beat the eigenvalue bound: explicit construction and applications, Combinatorica, 19 (1999) 125-138.