{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:45:32Z","timestamp":1761806732378},"reference-count":27,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5160,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,6]]},"DOI":"10.1016\/s0304-3975(98)00243-6","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"247-265","source":"Crossref","is-referenced-by-count":6,"title":["Rapid convergence of a local load balancing algorithm for asynchronous rings"],"prefix":"10.1016","volume":"220","author":[{"given":"Johannes E.","family":"Gehrke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.Greg","family":"Plaxton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajmohan","family":"Rajaraman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00243-6_BIB1","series-title":"Proc. 25th Annu. ACM Symp. on Theory of Computing","first-page":"632","article-title":"Approximate load balancing on dynamic and asynchronous networks","author":"Aiello","year":"1993"},{"key":"10.1016\/S0304-3975(98)00243-6_BIB2","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1145\/2402.322387","article-title":"Efficiency of synchronous versus asynchronous distributed systems","volume":"30","author":"Arjomandi","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00243-6_BIB3","series-title":"Proc. 9th Internat. Workshop on Distributed Algorithms","first-page":"183","article-title":"Load balancing: An exercise in constrained convergence","volume":"vol. 972","author":"Arora","year":"1995"},{"key":"10.1016\/S0304-3975(98)00243-6_BIB4","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/BF01191625","article-title":"Efficiency of semi-synchronous versus asynchronous networks","volume":"27","author":"Attiya","year":"1994","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(98)00243-6_BIB5","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1145\/48014.48247","article-title":"Computing on an anonymous ring","volume":"35","author":"Attiya","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00243-6_BIB6","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1145\/4221.4227","article-title":"Complexity of network synchronization","volume":"32","author":"Awerbuch","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00243-6_BIB7","series-title":"Proc. 26th Annu. ACM Symp. on Theory of Computing","first-page":"214","article-title":"Efficient asynchronous distributed symmetry breaking","author":"Awerbuch","year":"1994"},{"key":"10.1016\/S0304-3975(98)00243-6_BIB8","series-title":"Parallel and Distributed Computation: Numerical Methods","author":"Bertsekas","year":"1989"},{"key":"10.1016\/S0304-3975(98)00243-6_BIB9","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(94)90124-4","article-title":"On the convergence span of greedy load balancing","volume":"52","author":"Cohen","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(98)00243-6_BIB10","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0743-7315(89)90021-X","article-title":"Dynamic load balancing for distributed memory multiprocessors","volume":"2","author":"Cybenko","year":"1989","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/S0304-3975(98)00243-6_BIB11","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1006\/jpdc.1996.1257","article-title":"Competitive analysis of network load balancing","volume":"40","author":"Deng","year":"1997","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/S0304-3975(98)00243-6_BIB12","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/TSE.1986.6312961","article-title":"Adaptive load sharing in homogeneous distributed systems","volume":"12","author":"Eager","year":"1986","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/S0304-3975(98)00243-6_BIB13","series-title":"Proc. 6th Annu. ACM Symp. on Parallel Algorithms and Architectures","first-page":"210","article-title":"Job scheduling in rings","author":"Fizzano","year":"1994"},{"key":"10.1016\/S0304-3975(98)00243-6_BIB14","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/7531.7919","article-title":"Electing a leader in a synchronous ring","volume":"34","author":"Frederickson","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00243-6_BIB15","series-title":"Proc. 27th Annu. ACM Symp. on Theory of Computing","first-page":"548","article-title":"Tight analyses of two local load balancing algorithms","author":"Ghosh","year":"1995"},{"key":"10.1016\/S0304-3975(98)00243-6_BIB16","article-title":"A parabolic theory of load balance","author":"Heirich","year":"1993"},{"key":"10.1016\/S0304-3975(98)00243-6_BIB17","series-title":"Local Area Network Architectures","author":"Hutchinson","year":"1988"},{"key":"10.1016\/S0304-3975(98)00243-6_BIB18","series-title":"Formal Models and Semantics","first-page":"1157","article-title":"Distributed computing: Models and methods","volume":"vol. B","author":"Lamport","year":"1990"},{"key":"10.1016\/S0304-3975(98)00243-6_BIB19","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, and Hypercubes","author":"Leighton","year":"1991"},{"key":"10.1016\/S0304-3975(98)00243-6_BIB20","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(81)90109-2","article-title":"On describing the behavior and implementation of distributed systems","volume":"13","author":"Lynch","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00243-6_BIB21","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/BF01955042","article-title":"Strongly adaptive token distribution","volume":"15","author":"der Heide","year":"1996","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(98)00243-6_BIB22","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(87)90069-7","article-title":"The generalized packet routing problem","volume":"53","author":"Peleg","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00243-6_BIB23","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\/S0304-3975(98)00243-6_BIB24","series-title":"Proc. 1st Annu. ACM Symp. on Parallel Algorithms and Architectures","first-page":"64","article-title":"Load balancing, selection, and sorting on the hypercube","author":"Plaxton","year":"1989"},{"key":"10.1016\/S0304-3975(98)00243-6_BIB25","series-title":"Computer Networks","author":"Tanenbaum","year":"1989"},{"key":"10.1016\/S0304-3975(98)00243-6_BIB26","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1145\/3149.3156","article-title":"Optimal static load balancing in distributed computer systems","volume":"32","author":"Tantawi","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00243-6_BIB27","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1002\/cpe.4330030502","article-title":"Performance of dynamic load balancing algorithms for unstructured mesh calculations","volume":"3","author":"Williams","year":"1991","journal-title":"Concurrency: Practice and Experience"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002436?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002436?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T01:27:20Z","timestamp":1556242040000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598002436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0304397598002436"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00243-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}