Approximate shared-memory counting despite a strong adversary

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 441-450

  Aspnes, James ^a   Censor, Keren ^b  

^a Yale University   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED DATABASE SYSTEMS;

ASYNCHRONOUS SHARED MEMORY; HIGH PROBABILITY; INTERNAL STATE; RANDOMIZED SAMPLING; RELATIVE ERRORS; SHARED MEMORY; SUBLINEAR; WORK COMPLEXITY;

MEMORY ARCHITECTURE;

EID: 70349152167     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.49     Document Type: Conference Paper

References (25)

1. Karl Abrahamson. On achieving consensus using a shared memory. In Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 291-302, 1988.
2. Noga Alon and Joel H. Spencer, The Probabilistic Method. John Wiley & Sons, 1992.
3. James Aspnes. Time- and space-efficient randomized consensus. Journal of Algorithms, 14(3):414-431, May 1993.
4. James Aspnes. Lower bounds for distributed coin-flipping and randomized consensus. Journal of the ACM, 45(3):415-450, May 1998.
5. James Aspnes, Hagit Attiya, and Keren Censor. Randomized consensus in expected O(n log n) individual work. In Proceedings of the twenty-seventh A CM symposium on Principles of distributed computing (PODC), pages 325-334, 2008.
6. James Aspnes and Maurice Herlihy. Fast randomized consensus using shared memory. Journal of Algorithms, 11(3):441-461, September 1990.
7. 2 N) operations per processor. SIAM Journal on Computing, 25(5):1024-1044, October 1996.
8. Hagit Attiya and Keren Censor. Tight bounds for asynchronous randomized consensus. In Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (STOC), pages 155-164, 2007. (Pubitemid 47630732)
9. Hagit Attiya, Rachid Guerraoui, Danny Hendler, and Petr Kouznetsov. Synchronizing without locks is inherently expensive. In Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (PODC), pages 300-307, 2006. (Pubitemid 44393719)
10. 2 log n) operations. In Sam Toueg, Paul G. Spirakis, and Lefteris M. Kirousis, editors, Distributed Algorithms, 5th International Workshop, volume 579 of Lecture Notes in Computer Science, pages 143-150, Delphi, Greece, 7-9 October 1991. Springer, 1992.
11. Faith Ellen Fich, Danny Hendler, and Nir Shavit. Linear lower bounds on real-world implementations of concurrent objects. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 165-173, 2005. (Pubitemid 44375729)
12. Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382, April 1985.
13. Philippe Flajolet. Approximate counting: a detailed analysis. BIT, 25(1):113-134, 1985.
14. Philippe Flajolet and G. Nigel Martin. Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci., 31(2):182-209, 1985.
15. G. R. Grimmet and D. R. Stirzaker. Probability and Random Processes. Oxford Science Publications, 2nd edition, 1992.
16. Venkatesan Guruswami, Christopher Umans, and Salil Vadhan. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. In Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC '07), pages 96-108, June 2007.
17. P. Hall and C.C. Heyde. Martingale Limit Theory and Its Application. Academic Press, 1980.
18. Maurice Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124-149, January 1991.
19. Maurice P. Herlihy and Jeannette M. Wing. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, July 1990. (Pubitemid 20721345)
20. Shlomo Hoory, Nathan Linial, and Avi Wigderson. Expander graphs and their applications. Bulletin (new series) of the American Mathematical Society, 43(4):439-561, October 2006.
21. Michael C. Loui and Hosame H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, pages 163-183, 1987.
22. Michael Mitzenmacher and Eli Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.
23. Robert Morris. Counting large numbers of events in small registers. Commun. ACM, 21(10):840-842, 1978.
24. Michael Saks, Nir Shavit, and Heather Woll. Optimal time randomized consensus-making resilient algorithms fast in practice. In Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms (SODA), pages 351-362, 1991.
25. Nicholas C. Wormald. The differential equation method for random graph processes and greedy algorithms. In M. Karonski and H. J. Proemel, editors, Lectures on Approximation and Randomized Algorithms, pages 73-155. PWN, 1999.