{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T00:40:02Z","timestamp":1738284002379,"version":"3.35.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,7,12]],"date-time":"2008-07-12T00:00:00Z","timestamp":1215820800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s00446-008-0066-0","type":"journal-article","created":{"date-parts":[[2008,7,11]],"date-time":"2008-07-11T05:35:47Z","timestamp":1215754547000},"page":"249-269","source":"Crossref","is-referenced-by-count":0,"title":["Sequentially consistent versus linearizable counting networks"],"prefix":"10.1007","volume":"21","author":[{"given":"Marios","family":"Mavronicolas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Merritt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gadi","family":"Taubenfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,7,12]]},"reference":[{"issue":"4","key":"66_CR1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02242734","volume":"8","author":"E. Aharonson","year":"1995","unstructured":"Aharonson E., Attiya H.: Counting networks with arbitrary fan-out. Distrib. Comput. 8(4), 163\u2013169 (1995)","journal-title":"Distrib. Comput."},{"key":"66_CR2","doi-asserted-by":"crossref","unstructured":"Aiello, W., Venkatesan, R., Yung, M.: Coins, weights and contention in balancing networks. In: Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pp. 193\u2013205 (1994)","DOI":"10.1145\/197917.198090"},{"issue":"5","key":"66_CR3","doi-asserted-by":"crossref","first-page":"1020","DOI":"10.1145\/185675.185815","volume":"41","author":"J. Aspnes","year":"1994","unstructured":"Aspnes J., Herlihy M., Shavit N.: Counting networks. J. ACM 41(5), 1020\u20131048 (1994)","journal-title":"J. ACM"},{"issue":"6","key":"66_CR4","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/BF01191625","volume":"27","author":"H. Attiya","year":"1994","unstructured":"Attiya H., Mavronicolas M.: Efficiency of semi-synchronous versus asynchronous networks. Math. Syst. Theory 27(6), 547\u2013571 (1994)","journal-title":"Math. Syst. Theory"},{"issue":"2","key":"66_CR5","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/176575.176576","volume":"12","author":"H. Attiya","year":"1994","unstructured":"Attiya H., Welch J.L.: Sequential consistency versus linearizability. ACM Trans. Comput. Syst. 12(2), 91\u2013122 (1994)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"1","key":"66_CR6","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/S0304-3975(01)00312-7","volume":"289","author":"H. Brit","year":"2002","unstructured":"Brit H., Moran S., Taubenfeld G.: Public data structures: counters as a special case. Theor. Comput. Sci. 289(1), 401\u2013423 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"66_CR7","doi-asserted-by":"crossref","unstructured":"Busch, C., Mavronicolas, M.: An efficient counting network. In: Proceedings of the 1st Merged International Parallel Processing Symposium and IEEE Symposium on Parallel and Distributed Processing, pp. 380\u2013385 (1998)","DOI":"10.1109\/IPPS.1998.669944"},{"issue":"2","key":"66_CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s00224-001-1027-1","volume":"35","author":"C. Busch","year":"2002","unstructured":"Busch C., Herlihy M.: Sorting and counting networks of arbitrary width and small depth. Theory Comput. Syst. 35(2), 99\u2013128 (2002)","journal-title":"Theory Comput. Syst."},{"key":"66_CR9","doi-asserted-by":"crossref","unstructured":"Busch, C., Hardavellas, N., Mavronicolas, M.: Contention in counting networks. In: Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pp. 404 (1994)","DOI":"10.1145\/197917.198192"},{"issue":"4","key":"66_CR10","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.tcs.2004.04.018","volume":"333","author":"C. Busch","year":"2005","unstructured":"Busch C., Mavronicolas M., Spirakis P.: The cost of concurrent, low-contention read&modify&write. Theor. Comput. Sci. 333(4), 373\u2013400 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"66_CR11","doi-asserted-by":"crossref","unstructured":"Eleftheriou, M., Mavronicolas, M.: Linearizability in the presence of drifting clocks and under different delay assumptions. In: Jayanti, P. (ed.) Proceedings of the 13th International Symposium on Distributed Computing. Lecture Notes in Computer Science, vol. 1693, pp. 327\u2013341. Springer, Berlin (1999)","DOI":"10.1007\/3-540-48169-9_23"},{"issue":"1","key":"66_CR12","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s00446-003-0097-5","volume":"17","author":"P. Fatourou","year":"2004","unstructured":"Fatourou P., Herlihy M.: Read\u2013modify\u2013write networks. Distrib. Comput. 17(1), 33\u201346 (2004)","journal-title":"Distrib. Comput."},{"key":"66_CR13","unstructured":"Felten, E.W., LaMarca, A., Ladner, R.: Building counting networks from larger balancers. Technical Report TR-93-04-09, Department of Computer Science and Engineering, University of Washington (1993)"},{"key":"66_CR14","doi-asserted-by":"crossref","unstructured":"Freudenthal, E., Gottlieb, A.: Process coordination with fetch-and-increment. In: Proceedings of the 4th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 260\u2013268 (1991)","DOI":"10.1145\/106972.106998"},{"key":"66_CR15","doi-asserted-by":"crossref","unstructured":"Goodman, J.R., Vernon, M.K., Woest, P.J.: Efficient synchronization primitives for large-scale cache-coherent multiprocessors. In: Proceedings of the 3rd ACM International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 64\u201375 (1989)","DOI":"10.1145\/70082.68188"},{"key":"66_CR16","doi-asserted-by":"crossref","unstructured":"Hardavellas, N., Karakos, D., Mavronicolas, M.: Notes on sorting and counting networks. In: Schiper, A. (ed.) Proceedings of the 7th International Workshop on Distributed Algorithms. Lecture Notes in Computer Science, vol. 725, pp. 234\u2013248. Springer, Berlin (1993)","DOI":"10.1007\/3-540-57271-6_39"},{"issue":"3","key":"66_CR17","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy M., Wing J.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Programm. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Programm. Lang. Syst."},{"issue":"5","key":"66_CR18","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s00446-005-0130-y","volume":"18","author":"M. Herlihy","year":"2006","unstructured":"Herlihy M., Tirthapura S.: Self-stabilizing smoothing and balancing networks. Distrib. Comput. 18(5), 345\u2013357 (2006a)","journal-title":"Distrib. Comput."},{"issue":"5","key":"66_CR19","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1016\/j.jpdc.2005.06.009","volume":"66","author":"M. Herlihy","year":"2006","unstructured":"Herlihy M., Tirthapura S.: Randomized smoothing networks. J. Parallel Distrib. Comput. 66(5), 626\u2013632 (2006b)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"4","key":"66_CR20","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s004460050019","volume":"9","author":"M. Herlihy","year":"1996","unstructured":"Herlihy M., Shavit N., Waarts O.: Linearizable counting networks. Distrib. Comput. 9(4), 193\u2013203 (1996)","journal-title":"Distrib. Comput."},{"key":"66_CR21","doi-asserted-by":"crossref","unstructured":"Klugerman, M., Plaxton, C.G.: Small-depth counting networks. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pp. 417\u2013428 (1992)","DOI":"10.1145\/129712.129752"},{"issue":"9","key":"66_CR22","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"C-28","author":"L. Lamport","year":"1979","unstructured":"Lamport L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput. C-28(9), 690\u2013691 (1979)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"66_CR23","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0304-3975(98)00237-0","volume":"220","author":"N. Lynch","year":"1999","unstructured":"Lynch N., Shavit N., Shvartsman A., Touitou D.: Timing conditions for linearizability in uniform counting networks. Theor. Comput. Sci. 220(1), 67\u201392 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"66_CR24","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0304-3975(98)90244-4","volume":"220","author":"M. Mavronicolas","year":"1999","unstructured":"Mavronicolas M., Roth D.: Linearizable read\/write objects. Theor. Comput. Sci. 220(1), 267\u2013319 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"66_CR25","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Papatriantafilou, M., Tsigas, Ph.: The impact of timing on linearizability in counting networks. In: Proceedings of the 11th International Parallel Processing Symposium, pp. 684\u2013688 (1997)","DOI":"10.1109\/IPPS.1997.580978"},{"key":"66_CR26","doi-asserted-by":"crossref","unstructured":"Mellor-Crummey, J.M., LeBlanc, T.J.: A software instruction counter. In: Proceedings of the 3rd ACM International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 78\u201386 (1989)","DOI":"10.1145\/70082.68189"},{"issue":"1","key":"66_CR27","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/103727.103729","volume":"9","author":"J.M. Mellor-Crummey","year":"1991","unstructured":"Mellor-Crummey J.M., Scott M.L.: Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst. 9(1), 21\u201365 (1991)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"1","key":"66_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1996.0837","volume":"24","author":"S. Moran","year":"1997","unstructured":"Moran S., Taubenfeld G.: A lower bound on wait-free counting. J. Algorithms 24(1), 1\u201319 (1997)","journal-title":"J. Algorithms"},{"issue":"1","key":"66_CR29","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1006\/jcss.1996.0049","volume":"53","author":"S. Moran","year":"1996","unstructured":"Moran S., Taubenfeld G., Yadin I.: Concurrent counting. J. Comput. Syst. Sci. 53(1), 16\u201378 (1996)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"66_CR30","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/235543.235546","volume":"14","author":"N. Shavit","year":"1996","unstructured":"Shavit N., Zemach A.: Diffracting trees. ACM Trans. Comput. Syst. 14(4), 385\u2013428 (1996)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"4","key":"66_CR31","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s002240000095","volume":"31","author":"N. Shavit","year":"1998","unstructured":"Shavit N., Upfal E., Zemach A.: A steady state analysis of diffracting trees. Theory Comput. Syst. 31(4), 403\u2013423 (1998)","journal-title":"Theory Comput. Syst."},{"key":"66_CR32","volume-title":"Synchronization Algorithms and Concurrent Programming","author":"G. Taubenfeld","year":"2006","unstructured":"Taubenfeld G.: Synchronization Algorithms and Concurrent Programming. Pearson Education\/Prentice-Hall, Englewood Cliffs (2006)"},{"key":"66_CR33","doi-asserted-by":"crossref","unstructured":"Tirthapura, S.: Adaptive counting networks. In: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems, pp. 241\u2013250 (2005)","DOI":"10.1109\/ICDCS.2005.10"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-008-0066-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-008-0066-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-008-0066-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T00:22:33Z","timestamp":1738282953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-008-0066-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,12]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["66"],"URL":"https:\/\/doi.org\/10.1007\/s00446-008-0066-0","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2008,7,12]]}}}