Abstract
An adding network is a distributed data structure that supports a concurrent, lock-free, low-contention implementation of a fetchℰadd counter; a counting network is an instance of an adding network that supports only fetchℰincrement. We present a lower bound showing that adding networks have inherently high latency. Any adding network powerful enough to support addition by at least two values a and b, where |a| > |b| > 0, has sequential executions in which each token traverses Ω(n/c) switching elements, where n is the number of concurrent processes, and c is a quantity we call one-shot contention; for a large class of switching networks and for conventional counting networks the one-shot contention is constant. On the contrary, counting networks have O(log n) latency [4,7.
This bound is tight. We present the first concurrent, lock-free, lowcontention networked data structure that supports arbitrary fetch&add operations.
This work has been accepted for publication as a brief announcement in the 20th Annual ACM Symposium on Principles of Distributed Computing, Newport, Rhode Island, August 2001. Part of the work of the first author was performed while affiliating with the Max-Planck Institut für Informatik, Saarbrücken, Germany, and while visiting the Department of Computer Science, Brown University, Providence, USA.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aharonson, E., Attiya, H.: Counting networks with arbitrary fan-out. Distributed Computing, 8 (1995) 163–169.
Aiello, W., Busch, C., Herlihy, M., Mavronicolas, M., Shavit, N., Touitou, D.: Supporting Increment and Decrement Operations in Balancing Networks. Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science, pp. 393–403, Trier, Germany, March 1999.
Aspnes, J., Herlihy, M., Shavit, N.: Counting Networks. Journal of the ACM, 41 (1994) 1020–1048.
Busch, C., Mavronicolas, M.: An Efficient Counting Network. Proceedings of the 1st Merged International Parallel Processing Symposium and IEEE Symposium on Parallel and Distributed Processing, pp. 380–385, Orlando, Florida, May 1998.
Goodman, J., Vernon, M., Woest, P.: Efficient synchronization primitives for largescale cache-coherent multiprocessors. Proceedings of the 3rd International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 64–75, Boston, Massachusetts, April 1989.
Herlihy, M., Shavit, N., Waarts, O.: Linearizable Counting Networks. Distributed Computing, 9 (1996) 193–203.
Klugerman, M., Plaxton, C.: Small-Depth Counting Networks. Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pp. 417–428, May 1992.
Kruskal, C., Rudolph, L., Snir, M.: Efficient Synchronization on Multiprocessors with Shared Memory. Proceedings of the 5th Annual ACM Symposium on Principles of Distributed Computing, pp. 218–228, Calgary, Canada, August 1986.
Mavronicolas, M., Merritt, M., Taubenfeld, G.: Sequentially Consistent versus Linearizable Counting Networks. Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, pp. 133–142, May 1999.
Moran, S., Taubenfeld, G.: A Lower Bound on Wait-Free Counting. Journal of Algorithms, 24 (1997) 1–19.
Shavit, N., Touitou, D.: Elimination trees and the Construction of Pools and Stacks. Theory of Computing Systems, 30 (1997) 645–670.
Wattenhofer, R., Widmayer, P.: An Inherent Bottleneck in Distributed Counting. Journal of Parallel and Distributed Computing, 49 (1998) 135–145.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fatourou, P., Herlihy, M. (2001). Adding Networks. In: Welch, J. (eds) Distributed Computing. DISC 2001. Lecture Notes in Computer Science, vol 2180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45414-4_23
Download citation
DOI: https://doi.org/10.1007/3-540-45414-4_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42605-9
Online ISBN: 978-3-540-45414-4
eBook Packages: Springer Book Archive