{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T01:10:03Z","timestamp":1737508203500,"version":"3.33.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2007,10,31]],"date-time":"2007-10-31T00:00:00Z","timestamp":1193788800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"},{"start":{"date-parts":[[2007,10,31]],"date-time":"2007-10-31T00:00:00Z","timestamp":1193788800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1007\/s00446-007-0046-9","type":"journal-article","created":{"date-parts":[[2007,10,30]],"date-time":"2007-10-30T05:37:26Z","timestamp":1193722646000},"page":"415-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["The weakest failure detectors to boost obstruction-freedom"],"prefix":"10.1007","volume":"20","author":[{"given":"Rachid","family":"Guerraoui","sequence":"first","affiliation":[]},{"given":"Micha\u0142","family":"Kapa\u0142ka","sequence":"additional","affiliation":[]},{"given":"Petr","family":"Kouznetsov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,31]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"Aguilera, M.K., Delporte-Gallet, C., Fauconnier, H., Toueg, S.: Stable leader election. In: Proceedings of the International Symposium on Distributed Computing (DISC) (2001)","DOI":"10.1007\/3-540-45414-4_8"},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"Attiya, H., Guerraoui, R., Kouznetsov, P.: Computing with reads and writes in the absence of step contention. In: Proceedings of the 19th International Symposium on Distributed Computing (DISC) (2005)","DOI":"10.1007\/11561927_11"},{"key":"46_CR3","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"H. Attiya","year":"2004","unstructured":"Attiya H. and Welch J.L. (2004). Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn. Wiley, New York","edition":"2"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Bershad, B.N.: Practical considerations for non-blocking concurrent objects. In: Proceedings of the 14th IEEE International Conference on Distributed Computing Systems (ICDCS), pp. 264\u2013273 (1993)","DOI":"10.1109\/ICDCS.1993.287700"},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"Boichat, R., Dutta, P., Fr\u00f8lund, S., Guerraoui, R.: Deconstructing Paxos. ACM SIGACT News Distributed Computing Column 34(1), 47\u201367 (2003). Revised version of EPFL Technical Report 200106, January 2001","DOI":"10.1145\/637437.637447"},{"issue":"4","key":"46_CR6","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/234533.234549","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra T.D., Hadzilacos V. and Toueg S. (1996). The weakest failure detector for solving consensus. J. ACM 43(4): 685\u2013722","journal-title":"J. ACM"},{"issue":"2","key":"46_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra T.D. and Toueg S. (1996). Unreliable failure detectors for reliable distributed systems. J. ACM 43(2): 225\u2013267","journal-title":"J. ACM"},{"issue":"2","key":"46_CR8","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork C., Lynch N.A. and Stockmeyer L.J. (1988). Consensus in the presence of partial synchrony. J. ACM 35(2): 288\u2013323","journal-title":"J. ACM"},{"key":"46_CR9","unstructured":"Fetzer, C., Raynal, M., Tronel, F.: An adaptive failure detection protocol. In: Proceedings of the 2001 Pacific Rim International Symposium on Dependable Computing (2001)"},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Fich, F., Luchangco, V., Moir, M., Shavit, N.: Obstruction-free algorithms can be practically wait-free. In: Proceedings of the 19th International Symposium on Distributed Computing (DISC) (2005)","DOI":"10.1007\/11561927_8"},{"issue":"3","key":"46_CR11","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer M.J., Lynch N.A. and Paterson M.S. (1985). Impossibility of distributed consensus with one faulty process. J. ACM 32(3): 374\u2013382","journal-title":"J. ACM"},{"issue":"16","key":"46_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00446-002-0070-8","volume":"1","author":"E. Gafni","year":"2003","unstructured":"Gafni E. and Lamport L. (2003). Disk Paxos. Distrib. Comput. 1(16): 1\u201320","journal-title":"Distrib. Comput."},{"key":"46_CR13","unstructured":"Guerraoui, R.: Indulgent algorithms. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (PODC) (2000)"},{"key":"46_CR14","unstructured":"Guerraoui, R., Herlihy, M., Kapa\u0142ka, M., Pochon, B.: Robust contention management in software transactional memory. In: Proceedings of the Workshop on Synchronization and Concurrency in Object-Oriented Languages (SCOOL); in conjunction with the ACM Conference on Object-Oriented Programming, Systems, Languages and Applications (OOPSLA) (2005)"},{"key":"46_CR15","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Herlihy, M., Pochon, B.: Polymorphic contention management. In: Proceedings of the 19th International Symposium on Distributed Computing (DISC). LNCS, pp. 303\u2013323. Springer, Heidelberg (2005)","DOI":"10.1007\/11561927_23"},{"key":"46_CR16","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Herlihy, M., Pochon, B.: Toward a theory of transactional contention managers. In: Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC) (2005)","DOI":"10.1145\/1073814.1073863"},{"key":"46_CR17","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Schiper, A.: \u201c\u0393-accurate\u201d failure detectors. In: Proceedings of the 10th International Workshop on Distributed Algorithms (WDAG). Springer, Heidelberg (1996)","DOI":"10.1007\/3-540-61769-8_18"},{"issue":"1","key":"46_CR18","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy M. (1991). Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1): 124\u2013149","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"46_CR19","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Luchangco, V., Moir, M., Scherer III, W.N.: Software transactional memory for dynamic-sized data structures. In: Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 92\u2013101 (2003)","DOI":"10.1145\/872035.872048"},{"key":"46_CR20","unstructured":"Herlihy, M., Luchango, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems (ICDCS), pp. 522\u2013529 (2003)"},{"issue":"3","key":"46_CR21","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy M. and Wing J.M. (1990). Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3): 463\u2013492","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"4","key":"46_CR22","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1145\/263867.263888","volume":"44","author":"P. Jayanti","year":"1997","unstructured":"Jayanti P. (1997). Robust wait-free hierarchies. J. ACM 44(4): 592\u2013614","journal-title":"J. ACM"},{"key":"46_CR23","doi-asserted-by":"crossref","unstructured":"LaMarca, A.: A performance evaluation of lock-free synchronization protocols. In: Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 130\u2013140 (1994)","DOI":"10.1145\/197917.197975"},{"issue":"2","key":"46_CR24","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L. Lamport","year":"1998","unstructured":"Lamport L. (1998). The part-time parliament. ACM Trans. Comput. Syst. 16(2): 133\u2013169","journal-title":"ACM Trans. Comput. Syst."},{"issue":"7","key":"46_CR25","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1109\/TC.2004.33","volume":"53","author":"M. Larrea","year":"2004","unstructured":"Larrea M., Fern\u00e1ndez A. and Ar\u00e9valo S. (2004). On the implementation of unreliable failure detectors in partially synchronous systems. IEEE Trans. Comput. 53(7): 815\u2013828","journal-title":"IEEE Trans. Comput."},{"key":"46_CR26","doi-asserted-by":"crossref","unstructured":"Moir, M., Anderson, J.H.: Wait-free algorithms for fast, long-lived renaming. Sci. Comput. Program. 25 (1995)","DOI":"10.1016\/0167-6423(95)00009-H"},{"key":"46_CR27","doi-asserted-by":"crossref","unstructured":"Scherer III, W.N., Scott, M.L.: Contention management in dynamic software transactional memory. In: Proceedings of the Workshop on Concurrency and Synchronization in Java Programs; in conjunction with the 23th Annual ACM Symposium on Principles of Distributed Computing (PODC) (2004)","DOI":"10.1145\/1073814.1073861"},{"key":"46_CR28","doi-asserted-by":"crossref","unstructured":"Scherer III, W.N., Scott, M.L.: Advanced contention management for dynamic software transactional memory. In: Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC) (2005)","DOI":"10.1145\/1073814.1073861"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-007-0046-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-007-0046-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-007-0046-9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-007-0046-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:42:54Z","timestamp":1737506574000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-007-0046-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,31]]},"references-count":28,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["46"],"URL":"https:\/\/doi.org\/10.1007\/s00446-007-0046-9","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2007,10,31]]},"assertion":[{"value":"30 December 2006","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2007","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2007","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}