Concurrent counting

Journal of Computer and System Sciences

Volumn 53, Issue 1, 1996, Pages 61-78

  Moran, Shlomo ^a   Taubenfeld, Gadi ^b   Yadin, Irit ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT;

ASYNCHRONOUS COMPUTATION; CONCURRENT COUNTERS;

COUNTING CIRCUITS;

EID: 0030217629     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1996.0049     Document Type: Article

References (31)

1. E. Aharonson and H. Attiya, Counting networks with arbitrary fan-out, in "Proceedings, 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, January 1992," pp. 104-113.
2. J. H. Anderson and B. Grošelj, Beyond atomic registers: Bounded wait-free implementations of nontrivial objects, in "Fifth International Workshop on Distributed Algorithms, October 1991."
3. J. Aspnes and M. Herlihy, Fast randomized consensus using shared memory, J. Algorithms 11, No. 3 (1990), 441-460.
4. J. Aspnes and M. Herlihy, Wait-free data structures in the asynchronous PRAM model, in "Proceedings, Second Annual ACM Symposium on Parallel Architectures and Algorithms, July 1990," pp. 340-349.
5. J. Aspnes, M. Herlihy, and N. Shavit, Counting networks and multi-processor coordination, in "Proceedings, 23rd ACM Symp. on Theory of Computing, May 1991, pp. 348-358.
6. W. Aiello, R. Venkatesan, and M. Yung, Coins, weights and contention in balancing networks, in "Proceedings, 13th ACM Symp. on Principles of Distributed Computing, August 1994," pp. 193-205.
7. A. Ben-Dor, A. Israeli, and A. Shirazy, Dynamic counting, in "Proceedings, 3rd Israel Symposium on the Theory of Computing and Systems, January 1995," pp. 111-120.
8. H. Brit and S. Moran, Wait-freedom vs. Bounded Wait-freedom in Public Data Structures, in "Proceedings, 13th ACM Symp. on Principles of Distributed Computing, August 1994."
9. C. Busch and M. Mavronicolas, A combinatorial treatment of balancing networks, in "Proceedings, 13th ACM Symp. on Principles of Distributed Computing, August 1994."
10. H. Brit, S. Moran, and G. Taubenfeld, Public data structures: Counters as a special case, in "Proceedings, 3rd Israel Symposium on the Theory of Computing and Systems, January 1995."
11. E. W. Dijkstra, Self-stabilizing systems in spite of distributed control, Commun. ACM 17 (1974), 643-644.
12. M. J. Fischer, The consensus problem in unreliable distributed systems (A brief survey), in "Foundations of Computation Theory" (M. Karpinsky, Ed.), pp. 127-140, Lecture Notes in Computer Science, Vol. 158, Springer-Verlag, New York/Berlin, 1983.
13. M. J. Fischer, S. Moran, S. Rudich, and G. Taubenfeld, The wakeup problem, in "Proceedings, 22st ACM Symp. on Theory of Computing, May 1990," pp. 106-116; SIAM J. Comp., to appear.
14. M. J. Fischer, S. Moran, S. Rudich, and G. Taubenfeld, The wakeup problem, in "Proceedings, 22st ACM Symp. on Theory of Computing, May 1990," pp. 106-116; SIAM J. Comp., to appear.
15. M. J. Fischer, S. Moran, and G. Taubenfeld, Space-efficient asynchronous consensus without shared memory initialization, Inform. Process. Lett. 45 (1993), 101-105.
16. M. Gardner, Mathematical games: The curious properties of the Gray code and how it can be used to solve puzzles," Sci. Amer. August (1972), 106-109.
17. E. N. Gilbert, Gray codes and paths on the n-cube, Bell System Tech. J. 37, No. 9 (1958), 815-826.
18. F. Gray, "Pulse Code Communication," U.S. Patent 2,632,058, March 1953.
19. M. Herlihy, B. Lim, and N. Shavit, Low contention load balancing on large-scale multiprocessors, in "Proceedings, 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, July 1992."
20. M. Herlihy, N. Shavit, and O. Waarts, Low contention linearizable counting, in "Proceedings, 32nd IEEE Symp. on Foundations of Computer Science, October 1991," pp. 526-535.
21. M. Herlihy and J. Wing, Linearizability: A correctness condition for concurrent objects, ACM Trans. Programming Lang. Systems 12, No. 3 (1990), 463-492.
22. E. Korach, S. Moran, and S. Zaks, Tight lower and upper bounds for some distributed algorithms for a complete network of processors, in "Proceedings, 3rd ACM Symp. on Principles of Distributed Computing, 1984," pp. 199-207.
23. M. Klugerman and C. Plaxton, Small-depth counting networks, in "Proceedings, 24th ACM Symp. on Theory of Computing, October 1992," pp. 417-428.
24. Z. Kohavi, "Switching and Finite Automata Theory," McGraw-Hill, New York, 1970.
25. L. Lamport, Concurrent reading and writing, Commun. ACM 20 (1977), 806-811.
26. L. Lamport, On interprocess communication, Parts I, II, Distrib. Comput. 1, No. 2 (1986), 77-101.
27. L. Lamport, Concurrent reading and writing of clocks, ACM Trans. Comput. Systems 8, No. 4 (1990), 305-310.
28. S. Moran and G. Taubenfeld, A lower bound on wait-free counting, in "Proceedings, 12th ACM Symp. on Principles of Distributed Computing, August 1993," pp. 251-260.
29. S. Moran, G. Taubenfeld, and I. Yadin, Concurrent counting, in "Proceedings, 11th ACM Symp. on Principles of Distributed Computing, August 1992," pp. 59-70.
30. G. L. Peterson, An O(n log n) unidirectional algorithm for the circular extrema problem, ACM Trans. Programming Lang. Systems 4, No. 4 (1982), 758-762.
31. N. Shavit and A. Zemach, Diffracting trees, in "Annual Symp. on Parallel Algorithms and Architectures, June 1994."