{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T08:10:02Z","timestamp":1756455002291,"version":"3.44.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,28]],"date-time":"2025-04-28T00:00:00Z","timestamp":1745798400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,28]],"date-time":"2025-04-28T00:00:00Z","timestamp":1745798400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN\/2019-0485","RGPIN\/2019-0485","RGPIN\/2019-0485"],"award-info":[{"award-number":["RGPIN\/2019-0485","RGPIN\/2019-0485","RGPIN\/2019-0485"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s00446-025-00478-8","type":"journal-article","created":{"date-parts":[[2025,4,28]],"date-time":"2025-04-28T02:34:16Z","timestamp":1745807656000},"page":"297-335","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient bounded timestamping from standard synchronization primitives"],"prefix":"10.1007","volume":"38","author":[{"given":"Benyamin","family":"Bashari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Jamadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Woelfel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"key":"478_CR1","doi-asserted-by":"publisher","unstructured":"Abrahamson, K.: On achieving consensus using a shared memory. In: Proceedings of the 7th ACM Symposium on Principles of Distributed Computing (PODC), pp. 291\u2013302, https:\/\/doi.org\/10.1145\/62546.62594(1988)","DOI":"10.1145\/62546.62594"},{"key":"478_CR2","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1145\/177492.177731","volume":"16","author":"Y Afek","year":"1994","unstructured":"Afek, Y., Dolev, D., Gafni, E., et al.: A bounded first-in, first-enabled solution to the l-exclusion problem. ACM Trans. Program. Lang. Syst. 16, 939\u2013953 (1994). https:\/\/doi.org\/10.1145\/177492.177731","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"478_CR3","doi-asserted-by":"publisher","unstructured":"Bashari, B., Woelfel, P.: An efficient adaptive partial snapshot implementation. In: Proceedings of the 40th ACM Symposium on Principles of Distributed Computing (PODC), pp. 545\u2013555, https:\/\/doi.org\/10.1145\/3465084.3467939(2021)","DOI":"10.1145\/3465084.3467939"},{"issue":"2","key":"478_CR4","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/S0097539790192647","volume":"26","author":"D Dolev","year":"1997","unstructured":"Dolev, D., Shavit, N.: Bounded concurrent time-stamping. SIAM J. Comput. 26(2), 418\u2013455 (1997). https:\/\/doi.org\/10.1137\/S0097539790192647","journal-title":"SIAM J. Comput."},{"issue":"5","key":"478_CR5","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1145\/324133.324161","volume":"46","author":"C Dwork","year":"1999","unstructured":"Dwork, C., Waarts, O.: Simple and efficient bounded concurrent timestamping and the traceable use abstraction. J. ACM 46(5), 633\u2013666 (1999). https:\/\/doi.org\/10.1145\/324133.324161","journal-title":"J. ACM"},{"issue":"5","key":"478_CR6","doi-asserted-by":"publisher","first-page":"1848","DOI":"10.1137\/S0097539793243685","volume":"28","author":"C Dwork","year":"1999","unstructured":"Dwork, C., Herlihy, M., Plotkin, S., et al.: Time-lapse snapshots. SIAM J. Comput. 28(5), 1848\u20131874 (1999). https:\/\/doi.org\/10.1137\/S0097539793243685","journal-title":"SIAM J. Comput."},{"issue":"2","key":"478_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s00446-008-0060-6","volume":"21","author":"F Ellen","year":"2008","unstructured":"Ellen, F., Fatourou, P., Ruppert, E.: The space complexity of unbounded timestamps. Distrib. Comput. 21(2), 103\u2013115 (2008). https:\/\/doi.org\/10.1007\/s00446-008-0060-6","journal-title":"Distrib. Comput."},{"key":"478_CR8","unstructured":"Fidge, C.J.: Timestamps in message-passing systems that preserve the partial ordering. In: Proceedings of the 11th Australian Computer Science Conference 10(1):56\u201366 (1988)"},{"issue":"1","key":"478_CR9","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/59287.59292","volume":"11","author":"MJ Fischer","year":"1989","unstructured":"Fischer, M.J., Lynch, N.A., Burns, J.E., et al.: Distributed FIFO allocation of identical resources using small shared space. ACM Trans. Program. Lang. Syst. 11(1), 90\u2013114 (1989). https:\/\/doi.org\/10.1145\/59287.59292","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"478_CR10","doi-asserted-by":"publisher","unstructured":"Gawlick, R., Lynch, N.A., Shavit, N.: Concurrent timestamping made simple. In: Theory of Computing and Systems (ISTCS), pp. 171\u2013183, https:\/\/doi.org\/10.1007\/BFb0035176(1992)","DOI":"10.1007\/BFb0035176"},{"issue":"3","key":"478_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00446-007-0042-0","volume":"20","author":"R Guerraoui","year":"2007","unstructured":"Guerraoui, R., Ruppert, E.: Anonymous and fault-tolerant shared-memory computing. Distrib. Comput. 20(3), 165\u2013177 (2007). https:\/\/doi.org\/10.1007\/s00446-007-0042-0","journal-title":"Distrib. Comput."},{"issue":"1","key":"478_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/505241.505246","volume":"49","author":"S Haldar","year":"2002","unstructured":"Haldar, S., Vit\u00e1nyi, P.: Bounded concurrent timestamp systems using vector clocks. J. ACM 49(1), 101\u2013126 (2002). https:\/\/doi.org\/10.1145\/505241.505246","journal-title":"J. ACM"},{"key":"478_CR13","doi-asserted-by":"crossref","unstructured":"Helmi, M., Higham, L., Pacheco, E., et al.: The space complexity of long-lived and one-shot timestamp implementations. J. ACM 61(1), 7:1-7:25 (2014)","DOI":"10.1145\/2559904"},{"key":"478_CR14","doi-asserted-by":"crossref","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990)","DOI":"10.1145\/78969.78972"},{"key":"478_CR15","unstructured":"Intel Corporation (2023) The Intel 64 and IA-32 Architectures Software Developer\u2019s Manual\u2014Volume 2"},{"key":"478_CR16","doi-asserted-by":"publisher","unstructured":"Israeli, A., Li, M.: Bounded time-stamps. In: Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 371\u2013382, https:\/\/doi.org\/10.1109\/SFCS.1987.10(1987)","DOI":"10.1109\/SFCS.1987.10"},{"key":"478_CR17","doi-asserted-by":"publisher","unstructured":"Israeli, A., Pinhasov, M.: A concurrent time-stamp scheme which is linear in time and space. In: Distributed Algorithms, pp. 95\u2013109, https:\/\/doi.org\/10.1007\/3-540-56188-9_7(1992)","DOI":"10.1007\/3-540-56188-9_7"},{"key":"478_CR18","doi-asserted-by":"publisher","unstructured":"Jayanti, P., Petrovic, S.: Efficient and practical constructions of LL\/SC variables. In: Proceedings of the 22ed ACM Symposium on Principles of Distributed Computing (PODC), pp. 285\u2013294, https:\/\/doi.org\/10.1145\/872035.872078(2003)","DOI":"10.1145\/872035.872078"},{"key":"478_CR19","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/361082.361093","volume":"17","author":"L Lamport","year":"1974","unstructured":"Lamport, L.: A new solution of Dijkstra\u2019s concurrent programming problem. Commun. ACM 17, 453\u2013455 (1974). https:\/\/doi.org\/10.1145\/361082.361093","journal-title":"Commun. ACM"},{"key":"478_CR20","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21, 558\u2013565 (1978). https:\/\/doi.org\/10.1145\/359545.359563","journal-title":"Commun. ACM"},{"key":"478_CR21","unstructured":"Mattern, F.: Virtual time and global states of distributed systems. Parallel and Distributed Algorithms, pp. 215\u2013226 (1989)"},{"key":"478_CR22","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/358527.358537","volume":"24","author":"G Ricart","year":"1981","unstructured":"Ricart, G., Agrawala, A.K.: An optimal algorithm for mutual exclusion in computer networks. Commun. ACM 24, 9\u201317 (1981). https:\/\/doi.org\/10.1145\/358527.358537","journal-title":"Commun. ACM"},{"key":"478_CR23","doi-asserted-by":"publisher","unstructured":"Shikaripura, V., Kshemkalyani, A.D.: A simple, memory-efficient bounded concurrent timestamping algorithm. In: Proceedings of the 13th Annual International Symposium on Algorithms and Computation (ISAAC), pp. 550\u2013562, https:\/\/doi.org\/10.1007\/3-540-36136-7_48 (2002)","DOI":"10.1007\/3-540-36136-7_48"},{"key":"478_CR24","doi-asserted-by":"publisher","unstructured":"Vit\u00e1nyi, P.M.B., Awerbuch, B.: Atomic shared register access by asynchronous hardware. In: Proceedings of the 27th Annual Symposium on Foundations of Computer Science (SFCS \u201986), pp. 233\u2013243, https:\/\/doi.org\/10.1109\/SFCS.1986.11(1986)","DOI":"10.1109\/SFCS.1986.11"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-025-00478-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-025-00478-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-025-00478-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T07:35:06Z","timestamp":1756452906000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-025-00478-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,28]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["478"],"URL":"https:\/\/doi.org\/10.1007\/s00446-025-00478-8","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2025,4,28]]},"assertion":[{"value":"16 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}