{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T09:01:27Z","timestamp":1681808487393},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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 Processing Letters"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0020-0190(97)00189-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"33-40","source":"Crossref","is-referenced-by-count":15,"title":["The time complexity of updating snapshot memories"],"prefix":"10.1016","volume":"65","author":[{"given":"Amos","family":"Israeli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asaf","family":"Shirazi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0020-0190(97)00189-0_BIB1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02242703","article-title":"Composite registers","volume":"3","author":"Anderson","year":"1993","journal-title":"Distributed Comput."},{"key":"10.1016\/S0020-0190(97)00189-0_BIB2","series-title":"Proc. 9th Ann. ACM Symp. on Principles of Distributed Computing","first-page":"15","article-title":"Time- and space-efficient randomized consensus","author":"Aspnes","year":"1990"},{"issue":"4","key":"10.1016\/S0020-0190(97)00189-0_BIB3","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1145\/153724.153741","article-title":"Atomic snapshots of shared memory","volume":"40","author":"Afek","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(97)00189-0_BIB4","series-title":"Proc. 2nd Ann. Symp. on Parallel Algorithms and Architectures","first-page":"340","article-title":"Wait-free data structures in the asynchronous PRAM model","author":"Aspnes","year":"1990"},{"key":"10.1016\/S0020-0190(97)00189-0_BIB5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02242714","article-title":"Efficient atomic snapshots using lattice agreement","author":"Attiya","year":"1995","journal-title":"Distributed Comput."},{"issue":"4","key":"10.1016\/S0020-0190(97)00189-0_BIB6","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1145\/179812.179902","article-title":"Are wait-free algorithms fast?","volume":"41","author":"Attiya","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(97)00189-0_BIB7","series-title":"Proc. 12th Ann. ACM Symp. on Principles of Distributed Computing","first-page":"29","article-title":"Atomic snapshots in O(n log n) operations","author":"Attiya","year":"1993"},{"key":"10.1016\/S0020-0190(97)00189-0_BIB8","unstructured":"T.D. Chandra, C. Dwork, Personal communication."},{"key":"10.1016\/S0020-0190(97)00189-0_BIB9","series-title":"Proc. 1st Israeli Symp. on Theory of Computing and Systems","first-page":"154","article-title":"Time-lapse snapshots","volume":"vol. 601","author":"Dwork","year":"1992"},{"key":"10.1016\/S0020-0190(97)00189-0_BIB10","series-title":"Proc. 21st Ann. ACM Symp. on Theory of Computing","first-page":"454","article-title":"Bounded concurrent time-stamp systems are constructible!","author":"Dolev","year":"1989"},{"key":"10.1016\/S0020-0190(97)00189-0_BIB11","first-page":"124","article-title":"Impossibility and universality results for wait-free synchronization","author":"Herlihy","year":"1988","journal-title":"ACM Trans. Programming Languages and Systems"},{"issue":"3","key":"10.1016\/S0020-0190(97)00189-0_BIB12","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","article-title":"Linearizability: A correctness condition for concurrent objects","volume":"12","author":"Herlihy","year":"1990","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/S0020-0190(97)00189-0_BIB13","series-title":"Proc. 7th Internat. Workshop on Distributed Algorithms and Graphs","first-page":"18","article-title":"Binary snapshots","volume":"vol. 725","author":"Hoepman","year":"1993"},{"key":"10.1016\/S0020-0190(97)00189-0_BIB14","series-title":"Proc. 8th Internat. Workshop on Distributed Algorithms and Graphs","article-title":"Linear-time snapshot using multi-writer multi-reader registers","author":"Inoue","year":"1994"},{"key":"10.1016\/S0020-0190(97)00189-0_BIB15","article-title":"Simple multireader registers using time-stamp schemes","author":"Israeli","year":"1987"},{"key":"10.1016\/S0020-0190(97)00189-0_BIB16","series-title":"Proc. 11th Ann. ACM Symp. on Principles of Distributed Computing","first-page":"71","article-title":"Optimal multi-writer multi-reader atomic registers","author":"Israeli","year":"1992"},{"key":"10.1016\/S0020-0190(97)00189-0_BIB17","unstructured":"A. Israeli, A. Shirazi, Efficient snapshot protocol using 2-lattice agreement, Preprint."},{"key":"10.1016\/S0020-0190(97)00189-0_BIB18","series-title":"Proc. 7th Internat. Workshop on Distributed Algorithms and Graphs","first-page":"18","article-title":"Linear-time snapshot protocols for unbalanced systems","volume":"vol. 725","author":"Israeli","year":"1993"},{"key":"10.1016\/S0020-0190(97)00189-0_BIB19","series-title":"Proc. 5th Internat. Workshop on Distributed Algorithms and Graphs","first-page":"229","article-title":"Reading many variables in one atomic operation: Solutions with linear or sublinear complexity","volume":"vol. 579","author":"Kirousis","year":"1991"},{"issue":"2","key":"10.1016\/S0020-0190(97)00189-0_BIB20","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","article-title":"On interprocess communication. Part I: Basic formalism","volume":"1","author":"Lamport","year":"1986","journal-title":"Distributed Comput."},{"issue":"2","key":"10.1016\/S0020-0190(97)00189-0_BIB21","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/BF01786228","article-title":"On interprocess communication. Part II: Algorithms","volume":"1","author":"Lamport","year":"1986","journal-title":"Distributed Comput."},{"key":"10.1016\/S0020-0190(97)00189-0_BIB22","series-title":"Proc. 27th IEEE Symp. on Foundations of Computer Science","first-page":"233","article-title":"Atomic shared register access by asynchronous hardware","author":"Vitanyi","year":"1986"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001890?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001890?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T18:53:38Z","timestamp":1555959218000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097001890"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0020019097001890"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00189-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}