{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:15Z","timestamp":1740109275083,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,4,16]],"date-time":"2022-04-16T00:00:00Z","timestamp":1650067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,16]],"date-time":"2022-04-16T00:00:00Z","timestamp":1650067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s00446-022-00425-x","type":"journal-article","created":{"date-parts":[[2022,4,16]],"date-time":"2022-04-16T09:04:24Z","timestamp":1650099864000},"page":"375-398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Extending the wait-free hierarchy to multi-threaded systems"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8019-0830","authenticated-orcid":false,"given":"Matthieu","family":"Perrin","sequence":"first","affiliation":[]},{"given":"Achour","family":"Most\u00e9faoui","sequence":"additional","affiliation":[]},{"given":"Gr\u00e9goire","family":"Bonin","sequence":"additional","affiliation":[]},{"given":"Ludmila","family":"Courtillat-Piazza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,16]]},"reference":[{"key":"425_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Gafni, E., Morrison, A.: Common2 extended to stacks and unbounded concurrency. Distrib. Comput. 20(4), 239\u2013252 (2007)","DOI":"10.1007\/s00446-007-0023-3"},{"key":"425_CR2","doi-asserted-by":"crossref","unstructured":"Afek, Y., Morrison, A., Wertheim, G.: From bounded to unbounded concurrency objects and back. In: Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, PODC 2011, San Jose, CA, USA, pp. 119\u2013128 (2011)","DOI":"10.1145\/1993806.1993823"},{"key":"425_CR3","doi-asserted-by":"crossref","unstructured":"Afek, Y., Weisberger, E., Weisman, H.: A completeness theorem for a class of synchronization objects. In: Proceedings of the Twelfth Annual ACM Symposium on Principles of Distributed Computing, pp. 159\u2013170 (1993)","DOI":"10.1145\/164051.164071"},{"issue":"2","key":"425_CR4","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/992287.992298","volume":"35","author":"MK Aguilera","year":"2004","unstructured":"Aguilera, M.K.: A pleasant stroll through the land of infinitely many creatures. ACM SIGACT News 35(2), 36\u201359 (2004)","journal-title":"ACM SIGACT News"},{"key":"425_CR5","doi-asserted-by":"crossref","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. J. ACM 37(3), 524\u2013548 (1990)","DOI":"10.1145\/79147.79158"},{"key":"425_CR6","doi-asserted-by":"crossref","unstructured":"Censor-Hillel, K., Petrank, E., Timnat, S.: Help!. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, pp. 241\u2013250. ACM (2015)","DOI":"10.1145\/2767386.2767415"},{"key":"425_CR7","doi-asserted-by":"crossref","unstructured":"Ellen, F., Gelashvili, R., Shavit, N., Zhu, L.: A complexity-based hierarchy for multiprocessor synchronization. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, pp. 289\u2013298 (2016)","DOI":"10.1145\/2933057.2933113"},{"issue":"3","key":"425_CR8","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s00224-013-9491-y","volume":"55","author":"P Fatourou","year":"2014","unstructured":"Fatourou, P., Kallimanis, N.D.: Highly-efficient wait-free synchronization. Theory Comput. Syst. 55(3), 475\u2013520 (2014)","journal-title":"Theory Comput. Syst."},{"key":"425_CR9","doi-asserted-by":"crossref","unstructured":"Filipovi\u0107, I., O\u2019Hearn, P., Rinetzky, N., Yang, H.: Abstraction for concurrent objects. Theoret. Comput. Sci. 411(51\u201352), 4379\u20134398 (2010)","DOI":"10.1016\/j.tcs.2010.09.021"},{"issue":"2","key":"425_CR10","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"425_CR11","doi-asserted-by":"crossref","unstructured":"Gafni, E., Merritt, M., Taubenfeld, G.: The concurrency hierarchy, and algorithms for unbounded concurrency. In: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, pp. 161\u2013169. ACM (2001)","DOI":"10.1145\/383962.384008"},{"issue":"1","key":"425_CR12","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"425_CR13","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S., Raynal, M.: Power and limits of distributed computing shared memory models. Theor. Comput. Sci. 509, 3\u201324 (2013)","DOI":"10.1016\/j.tcs.2013.03.002"},{"key":"425_CR14","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann, Shavit (2008)"},{"issue":"3","key":"425_CR15","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"8","key":"425_CR16","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(8), 453\u2013455 (1974)","journal-title":"Commun. ACM"},{"key":"425_CR17","doi-asserted-by":"crossref","unstructured":"Mostefaoui, A., Raynal, M., Tronel, F.: From binary consensus to multivalued consensus in asynchronous message-passing systems. Inf. Process. Lett. 73(5\u20136), 207\u2013212 (2000)","DOI":"10.1016\/S0020-0190(00)00027-2"},{"key":"425_CR18","doi-asserted-by":"crossref","unstructured":"Plotkin, S.A.: Sticky bits and universality of consensus. In: Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, pp. 159\u2013175 (1989)","DOI":"10.1145\/72981.72992"},{"key":"425_CR19","doi-asserted-by":"crossref","unstructured":"Raynal, M.: Concurrent Programming - Algorithms, Principles, and Foundations. Springer (2012)","DOI":"10.1007\/978-3-642-32027-9"},{"key":"425_CR20","unstructured":"Raynal, M.: Distributed universal constructions: a guided tour. Bull. EATCS, 121, 2017"},{"key":"425_CR21","doi-asserted-by":"crossref","unstructured":"Taubenfeld, G.: Distributed Computing Pearls. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers (2018)","DOI":"10.1007\/978-3-031-02012-4"},{"key":"425_CR22","unstructured":"Treiber, R.K.: Systems Programming: Coping with Parallelism. International Business Machines Incorporated, Thomas J. Watson Research (1986)"},{"key":"425_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, J., Chen, W.: Bounded cost algorithms for multivalued consensus using binary consensus instances. Inf. Process. Lett. 109(17), 1005\u20131009 (2009)","DOI":"10.1016\/j.ipl.2009.06.004"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-022-00425-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-022-00425-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-022-00425-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T06:05:37Z","timestamp":1658469937000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-022-00425-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,16]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["425"],"URL":"https:\/\/doi.org\/10.1007\/s00446-022-00425-x","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2022,4,16]]},"assertion":[{"value":"29 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2022","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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}