{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T10:22:15Z","timestamp":1649154135749},"reference-count":32,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0020-0255(96)00175-2","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T01:00:31Z","timestamp":1049504431000},"page":"125-157","source":"Crossref","is-referenced-by-count":1,"title":["Balancing networks: State of the art"],"prefix":"10.1016","volume":"97","author":[{"given":"Marios","family":"Mavronicolas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0255(96)00175-2_BIB1","series-title":"Proceedings of the 16th Annual ACM-IEEE International Symposium on Computer Architecture","first-page":"396","article-title":"Adaptive backoff synchronization techniques","author":"Agarwal","year":"1989"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB2","series-title":"Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"104","article-title":"Counting networks with arbitrary fan-out","author":"Aharonson","year":"1992"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB3","series-title":"Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing","first-page":"193","article-title":"Coins, weights and contention in balancing networks","author":"Aiello","year":"1994"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","article-title":"Sorting in c log n steps","volume":"3","author":"Ajtai","year":"1983","journal-title":"Combinatorica"},{"issue":"1","key":"10.1016\/S0020-0255(96)00175-2_BIB5","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/71.80120","article-title":"The performance of spin lock alternatives for shared-memory multiprocessors","volume":"1","author":"Anderson","year":"1990","journal-title":"IEEE Trans. Paral. Distrib. Syst."},{"issue":"5","key":"10.1016\/S0020-0255(96)00175-2_BIB6","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"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02242714","article-title":"Atomic snapshots using lattice agreement","volume":"8","author":"Attiya","year":"1995","journal-title":"Distrib. Comput."},{"key":"10.1016\/S0020-0255(96)00175-2_BIB8","series-title":"Proceedings of the AFIPS Spring Joint Computer Conference","first-page":"307","article-title":"Sorting networks and their applications","author":"Batcher","year":"1968"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB9","article-title":"Combinatorial matrix theory","volume":"Vol. 21","author":"Brualdi","year":"1991"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB10","series-title":"Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing","first-page":"404","article-title":"Contention in counting networks","author":"Busch","year":"1994"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB11","series-title":"Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing","first-page":"206","article-title":"A combinatorial treatment of balancing networks","author":"Busch","year":"1994"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB12","first-page":"1","article-title":"Proving correctness for balancing networks","volume":"Vol. 22","author":"Busch","year":"1995"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB13","series-title":"Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing","first-page":"274","article-title":"A logarithmic-depth counting networks","author":"Busch","year":"1995"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB14","article-title":"Impossibility results for threshold networks","author":"Busch","year":"1995"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB15","unstructured":"C. Busch and M. Mavronicolas, Odd-even counting networks, unpublished manuscript."},{"key":"10.1016\/S0020-0255(96)00175-2_BIB16","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"issue":"4","key":"10.1016\/S0020-0255(96)00175-2_BIB17","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1145\/76359.76362","article-title":"The periodic balanced sorting network","volume":"36","author":"Dowd","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB18","series-title":"Proceedings of the 25th Annual ACM Symposium on Theory of Computing","first-page":"174","article-title":"Contention in shared memory algorithms","author":"Dwork","year":"1993"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB19","article-title":"Building counting networks from larger balancers","author":"Felten","year":"1993"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB20","series-title":"Proceedings of the 3rd Annual ACM Symposium on Architectural Support for Programming Languages and Operating Systems","first-page":"64","article-title":"Efficient synchronization primitives for large-scale cache-coherent multiprocessors","author":"Goodman","year":"1989"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB21","first-page":"234","article-title":"Notes on sorting and counting networks","volume":"Vol. 725","author":"Hardavellas","year":"1993"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB22","series-title":"Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures","first-page":"219","article-title":"Low contention load balancing on large-scale multiprocessors","author":"Herlihy","year":"1992"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB23","series-title":"Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science","first-page":"526","article-title":"Low contention linearizable counting networks","author":"Herlihy","year":"1991"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB24","series-title":"Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing","first-page":"275","article-title":"Load balancing networks","author":"Kapidakis","year":"1995"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB25","article-title":"Small-depth counting networks and related topics","author":"Klugerman","year":"1994"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB26","series-title":"Proceedings of the 24th Annual ACM Symposium on Theory of Computing","first-page":"417","article-title":"Small-depth counting networks","author":"Klugerman","year":"1992"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB27","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB28","article-title":"Algorithms for scalable synchronization on shared-memory multiprocessors","author":"Mellor-Crummey","year":"1990"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB29","series-title":"Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing","first-page":"251","article-title":"A lower bound on wait-free counting","author":"Moran","year":"1993"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB30","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/0218015","article-title":"The token distribution problem","volume":"18","author":"Peleg","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0255(96)00175-2_BIB31","series-title":"Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures","article-title":"Elimination trees and the construction of pools and stacks","author":"Shavit","year":"1995"},{"key":"10.1016\/S0020-0255(96)00175-2_BIB32","series-title":"Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures","first-page":"167","article-title":"Diffracting trees","author":"Shavit","year":"1994"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025596001752?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025596001752?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:27:00Z","timestamp":1556058420000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025596001752"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["S0020025596001752"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(96)00175-2","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}