{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T20:27:56Z","timestamp":1760819276457},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1996,1]]},"DOI":"10.1016\/0167-8191(95)00059-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:18:22Z","timestamp":1027624702000},"page":"39-56","source":"Crossref","is-referenced-by-count":28,"title":["Finite termination of asynchronous iterative algorithms"],"prefix":"10.1016","volume":"22","author":[{"given":"S.A.","family":"Savari","sequence":"first","affiliation":[]},{"given":"D.P.","family":"Bertsekas","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1989","author":"Bertsekas","key":"10.1016\/0167-8191(95)00059-3_bib1"},{"issue":"1","key":"10.1016\/0167-8191(95)00059-3_bib2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0005-1098(91)90003-K","article-title":"Some aspects of parallel and distributed algorithms\u2014a survey","volume":"27","author":"Bertsekas","year":"1991","journal-title":"Automatica"},{"key":"10.1016\/0167-8191(95)00059-3_bib3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","article-title":"Termination detection for diffusing computations","volume":"11","author":"Dijkstra","year":"1980","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/0167-8191(95)00059-3_bib4","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/357084.357087","article-title":"Distributed termination","volume":"2","author":"Francez","year":"1980","journal-title":"ACM Trans. Programming Languages Syst."},{"key":"10.1016\/0167-8191(95)00059-3_bib5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1109\/TSE.1982.235257","article-title":"Achieving distributed termination without freezing","volume":"SE-8","author":"Francez","year":"1982","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0167-8191(95)00059-3_bib6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0190(83)90092-3","article-title":"Derivation of a termination algorithm for distributed computations","volume":"16","author":"Dijkstra","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8191(95)00059-3_bib7","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0020-0190(84)90071-1","article-title":"Termination detection for distributed computations","volume":"18","author":"Topor","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8191(95)00059-3_bib8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","article-title":"Distributed snapshots: determining global states of distributed systems","volume":"3","author":"Chandy","year":"1985","journal-title":"ACM Trans. Comput. Syst."},{"key":"10.1016\/0167-8191(95)00059-3_bib9","series-title":"Proc. Fifth Conf. Foundations Software Technol. & Theoret. Comput. Sci.","first-page":"73","article-title":"A class of termination detection algorithms for distributed computations,","volume":"206","author":"Kumar","year":"1985"},{"issue":"2","key":"10.1016\/0167-8191(95)00059-3_bib10","doi-asserted-by":"crossref","DOI":"10.1109\/69.134251","article-title":"Development of a class of distributed termination detection algorithms","volume":"4","author":"Kumar","year":"1992","journal-title":"IEEE Trans. Knowledge and Data Eng."},{"key":"10.1016\/0167-8191(95)00059-3_bib11","series-title":"Proc. 1989 Int. Conf. on Supercomputing","first-page":"461","article-title":"Convergence rate and termination of asynchronous iterative algorithms","author":"Bertsekas","year":"1989"},{"key":"10.1016\/0167-8191(95)00059-3_bib12","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0024-3795(69)90028-7","article-title":"Chaotic relaxation","volume":"2","author":"Chazan","year":"1969","journal-title":"Lin. Algebra and Appl."},{"key":"10.1016\/0167-8191(95)00059-3_bib13","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1145\/322063.322067","article-title":"Asynchronous iterative methods for multiprocessors","volume":"15","author":"Baudet","year":"1978","journal-title":"J. ACM"},{"year":"1987","author":"Bertsekas","key":"10.1016\/0167-8191(95)00059-3_bib14"},{"issue":"1","key":"10.1016\/0167-8191(95)00059-3_bib15","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","article-title":"A distributed algorithm for minimum-weight spanning trees","volume":"5","author":"Gallager","year":"1983","journal-title":"ACM Trans. Programming Languages Syst."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819195000593?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819195000593?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T03:20:06Z","timestamp":1555557606000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819195000593"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["0167819195000593"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(95)00059-3","relation":{},"ISSN":["0167-8191"],"issn-type":[{"type":"print","value":"0167-8191"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}