{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:54:48Z","timestamp":1760061288984,"version":"build-2065373602"},"reference-count":29,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s0743-7315(03)00114-x","type":"journal-article","created":{"date-parts":[[2004,4,13]],"date-time":"2004-04-13T06:22:09Z","timestamp":1081837329000},"page":"449-460","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["The counting pyramid: an adaptive distributed counting scheme"],"prefix":"10.1016","volume":"64","author":[{"given":"Roger","family":"Wattenhofer","sequence":"first","affiliation":[]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0743-7315(03)00114-X_BIB1","doi-asserted-by":"crossref","unstructured":"J. Aspnes, M. Herlihy, N. Shavit, Counting networks and multi-processor coordination, in: Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing, New Orleans, Louisiana, 6\u20138 May 1991, pp. 348\u2013358.","DOI":"10.1145\/103418.103421"},{"issue":"5","key":"10.1016\/S0743-7315(03)00114-X_BIB2","doi-asserted-by":"crossref","first-page":"1020","DOI":"10.1145\/185675.185815","article-title":"Counting networks","volume":"41","author":"Aspnes","year":"1994","journal-title":"J. ACM"},{"year":"1987","series-title":"Data Networks","author":"Bertsekas","key":"10.1016\/S0743-7315(03)00114-X_BIB3"},{"key":"10.1016\/S0743-7315(03)00114-X_BIB4","unstructured":"W.C. Brantley, K.P. McAuliffe, J. Weiss, RP3 processor-memory element, Proceedings of the 1985 International Conference on Parallel Processing, 1985, pp. 782\u2013789."},{"key":"10.1016\/S0743-7315(03)00114-X_BIB5","unstructured":"L.A. Cohn, A conceptual approach to general purpose parallel computer architecture, Ph.D. Thesis, Columbia University, New York, 1983."},{"issue":"7","key":"10.1016\/S0743-7315(03)00114-X_BIB6","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1006\/jpdc.2000.1630","article-title":"Reactive diffracting trees","volume":"60","author":"Della-Libera","year":"2000","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/S0743-7315(03)00114-X_BIB7","doi-asserted-by":"crossref","unstructured":"J.R. Goodman, M.K. Vernon, P.J. Woest, Efficient synchronization primitives for large-scale cache-coherent multiprocessors, in: Third International Conference on Architectural Support for Programming Languages and Operating Systems, Boston, Massachusetts, 3\u20136 April 1989, pp. 64\u201375.","DOI":"10.1145\/70082.68188"},{"issue":"2","key":"10.1016\/S0743-7315(03)00114-X_BIB8","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/TC.1983.1676201","article-title":"The NYU ultracomputer","volume":"C-32","author":"Gottlieb","year":"1983","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"10.1016\/S0743-7315(03)00114-X_BIB9","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/859515.859517","article-title":"Coordinating parallel processors","volume":"9","author":"Gottlieb","year":"1981","journal-title":"Comput. Architect. News"},{"issue":"2","key":"10.1016\/S0743-7315(03)00114-X_BIB10","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1145\/69624.357206","article-title":"Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors","volume":"5","author":"Gottlieb","year":"1983","journal-title":"ACM Trans. Programming Languages Systems"},{"year":"1981","series-title":"Fundamentals of Queueing Theory","author":"Gross","key":"10.1016\/S0743-7315(03)00114-X_BIB11"},{"issue":"4","key":"10.1016\/S0743-7315(03)00114-X_BIB12","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1145\/210223.210225","article-title":"Scalable concurrent counting","volume":"13","author":"Herlihy","year":"1995","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/S0743-7315(03)00114-X_BIB13","doi-asserted-by":"crossref","unstructured":"M. Herlihy, N. Shavit, O. Waarts, Low contention linearizable counting, in: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, San Juan, Porto Rico, October 1991, pp. 526\u2013537.","DOI":"10.1109\/SFCS.1991.185415"},{"issue":"3","key":"10.1016\/S0743-7315(03)00114-X_BIB14","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","article-title":"Linearizability","volume":"12","author":"Herlihy","year":"1990","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0743-7315(03)00114-X_BIB15","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/opre.5.4.518","article-title":"Networks of waiting lines","volume":"5","author":"Jackson","year":"1957","journal-title":"Oper. Res."},{"key":"10.1016\/S0743-7315(03)00114-X_BIB16","unstructured":"G.Y. Lee, C.P. Kruskal, D.J. Kuck, The effectiveness of combining in shared memory parallel computer in the presence of \u2018hot spots\u2019, in: International Conference on Parallel Processing, Los Alamitos, CA, USA, August 1986, pp. 35\u201341."},{"key":"10.1016\/S0743-7315(03)00114-X_BIB17","doi-asserted-by":"crossref","unstructured":"B.-H. Lim, A. Agarwal, Reactive synchronization algorithms for multiprocessors, in: Proceedings of the 6th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS VI), October 1994, pp. 25\u201335.","DOI":"10.1145\/195473.195490"},{"year":"1995","series-title":"Probability, Stochastic Processes, and Queueing Theory","author":"Nelson","key":"10.1016\/S0743-7315(03)00114-X_BIB18"},{"issue":"10","key":"10.1016\/S0743-7315(03)00114-X_BIB19","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1109\/TC.1985.6312198","article-title":"Hot spot contention and combining in multistage interconnection networks","volume":"C-34","author":"Pfister","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0743-7315(03)00114-X_BIB20","doi-asserted-by":"crossref","unstructured":"N. Shavit, D. Touitou, Elimination trees and the construction of pools and stacks, in: Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures SPAA\u201995, Santa Barbara, California, July 1995, pp. 54\u201363.","DOI":"10.1145\/215399.215419"},{"issue":"4","key":"10.1016\/S0743-7315(03)00114-X_BIB21","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s002240000095","article-title":"A steady state analysis of diffracting trees","volume":"31","author":"Shavit","year":"1998","journal-title":"Theory Comput. Systems"},{"issue":"4","key":"10.1016\/S0743-7315(03)00114-X_BIB22","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/235543.235546","article-title":"Diffracting trees","volume":"14","author":"Shavit","year":"1996","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/S0743-7315(03)00114-X_BIB23","doi-asserted-by":"crossref","unstructured":"N. Shavit, A. Zemach, Combining funnels: a new twist on an old tale..., in: PODC: 17th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1998.","DOI":"10.1145\/277697.277707"},{"key":"10.1016\/S0743-7315(03)00114-X_BIB24","unstructured":"R.P. Wattenhofer, Distributed counting\u2014how to bypass bottlenecks, Ph.D. Thesis, ETH Zurich, Institut fuer Theoretische Informatik, September 1998."},{"key":"10.1016\/S0743-7315(03)00114-X_BIB25","unstructured":"R. Wattenhofer, P. Widmayer, Distributed counting at maximum speed, Technical Report 277, ETH Zurich, Departement Informatik, November, 1997."},{"key":"10.1016\/S0743-7315(03)00114-X_BIB26","doi-asserted-by":"crossref","unstructured":"R. Wattenhofer, P. Widmayer, An inherent bottleneck in distributed counting, in: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997, pp. 159\u2013167.","DOI":"10.1145\/259380.259436"},{"key":"10.1016\/S0743-7315(03)00114-X_BIB27","unstructured":"R. Wattenhofer, P. Widmayer, The counting pyramid: an adaptive distributed counting scheme, in: Proceedings of the Fifth International Colloquium on Structural Information and Communication Complexity, June 1998."},{"key":"10.1016\/S0743-7315(03)00114-X_BIB28","unstructured":"J. Wilson, Operating system data structures for shared-memory machines with fetch-and-add, Ph.D. Thesis, New York University, Department of Computer Science, 1988."},{"key":"10.1016\/S0743-7315(03)00114-X_BIB29","unstructured":"P.-C. Yew, M.-F. Tzeng, D.H. Lawrie, Distributing hot-spot addressing in large scale multiprocessor, in: International Conference on Parallel Processing, Los Alamitos, CA, USA, August 1986, pp. 51\u201358."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S074373150300114X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S074373150300114X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:52:01Z","timestamp":1760046721000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S074373150300114X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S074373150300114X"],"URL":"https:\/\/doi.org\/10.1016\/s0743-7315(03)00114-x","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[2004,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The counting pyramid: an adaptive distributed counting scheme","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0743-7315(03)00114-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}