{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:49:22Z","timestamp":1750308562296,"version":"3.41.0"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2015,3,2]],"date-time":"2015-03-02T00:00:00Z","timestamp":1425254400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Yad-Hanadiv foundation"},{"name":"Simons Postdoctoral Fellows Program"},{"DOI":"10.13039\/501100000038","name":"Natural Science and Engineering Research Council of Canada","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]},{"name":"NSF","award":["CCF-0916389"],"award-info":[{"award-number":["CCF-0916389"]}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"crossref","award":["1227\/10"],"award-info":[{"award-number":["1227\/10"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2015,3,2]]},"abstract":"<jats:p>\n            This article presents a novel implementation of a snapshot object for\n            <jats:italic>n<\/jats:italic>\n            processes, with\n            <jats:italic>O<\/jats:italic>\n            (log\n            <jats:sup>2<\/jats:sup>\n            <jats:italic>b<\/jats:italic>\n            log\n            <jats:italic>n<\/jats:italic>\n            ) step complexity for update operations and\n            <jats:italic>O<\/jats:italic>\n            (log\n            <jats:italic>b<\/jats:italic>\n            ) step complexity for scan operations, where\n            <jats:italic>b<\/jats:italic>\n            is the number of updates. The algorithm uses only reads and writes.\n          <\/jats:p>\n          <jats:p>\n            For polynomially many updates, this is an exponential improvement on previous snapshot algorithms, which have linear step complexity. It overcomes the existing \u03a9(\n            <jats:italic>n<\/jats:italic>\n            ) lower bound on step complexity by having the step complexity depend on the number of updates. The key to this implementation is the construction of a new object consisting of a pair of max registers that supports a scan operation.\n          <\/jats:p>","DOI":"10.1145\/2732263","type":"journal-article","created":{"date-parts":[[2015,3,3]],"date-time":"2015-03-03T14:08:19Z","timestamp":1425391699000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity"],"prefix":"10.1145","volume":"62","author":[{"given":"James","family":"Aspnes","sequence":"first","affiliation":[{"name":"Yale University, New Haven, CT"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hagit","family":"Attiya","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keren","family":"Censor-Hillel","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faith","family":"Ellen","sequence":"additional","affiliation":[{"name":"University of Toronto, Toronto, Ontario, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,3,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/153724.153741"},{"volume-title":"Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms (SODA). 416--435","author":"Alistarh D.","key":"e_1_2_1_2_1","unstructured":"D. Alistarh , J. Aspnes , M. Bender , R. Gelashvili , and S. Gilbert . 2014. Dynamic task allocation in asynchronous shared memory . In Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms (SODA). 416--435 . D. Alistarh, J. Aspnes, M. Bender, R. Gelashvili, and S. Gilbert. 2014. Dynamic task allocation in asynchronous shared memory. In Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms (SODA). 416--435."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02242703"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/645950.675464"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645952.675622"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2108242.2108244"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312037"},{"volume-title":"Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'09)","author":"Aspnes J.","key":"e_1_2_1_8_1","unstructured":"J. Aspnes and K. Censor . 2009. Approximate shared-memory counting despite a strong adversary . In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'09) . SIAM Philadelphia, PA, 441--450. J. Aspnes and K. Censor. 2009. Approximate shared-memory counting despite a strong adversary. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'09). SIAM Philadelphia, PA, 441--450."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/97444.97701"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700366000"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/179812.179902"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795279463"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/164051.164056"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30577-4_3"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/645951.675482"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571875"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060697"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2005.29"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797317299"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00412-6"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2732263","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2732263","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:09Z","timestamp":1750273449000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2732263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,2]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,3,2]]}},"alternative-id":["10.1145\/2732263"],"URL":"https:\/\/doi.org\/10.1145\/2732263","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"type":"print","value":"0004-5411"},{"type":"electronic","value":"1557-735X"}],"subject":[],"published":{"date-parts":[[2015,3,2]]},"assertion":[{"value":"2013-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-03-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}