{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:19:59Z","timestamp":1725499199087},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540446248"},{"type":"electronic","value":"9783540446279"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11864219_28","type":"book-chapter","created":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T05:25:39Z","timestamp":1159939539000},"page":"399-412","source":"Crossref","is-referenced-by-count":20,"title":["The Weakest Failure Detectors to Boost Obstruction-Freedom"],"prefix":"10.1007","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","reference":[{"issue":"1","key":"28_CR1","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 Transactions on Programming Languages and Systems\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"28_CR2","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 Transactions on Programming Languages and Systems\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"28_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., Welch, J.L.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn. Wiley, Chichester (2004)","edition":"2"},{"key":"28_CR4","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 1994), pp. 130\u2013140 (1994)","DOI":"10.1145\/197917.197975"},{"key":"28_CR5","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 1993), pp. 264\u2013273 (1993)","DOI":"10.1109\/ICDCS.1993.287700"},{"key":"28_CR6","doi-asserted-by":"crossref","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 1993), pp. 522\u2013529 (2003)","DOI":"10.1109\/ICDCS.2003.1203503"},{"key":"28_CR7","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 2003), pp. 92\u2013101 (2003)","DOI":"10.1145\/872035.872048"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Scherer III, W.N., Scott, M.L.: Contention management in dynamic software transactional memory. In: PODC Workshop on Concurrency and Synchronization in Java Programs (2004)","DOI":"10.1145\/1073814.1073861"},{"key":"28_CR9","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) (2005)","DOI":"10.1145\/1073814.1073861"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/11561927_23","volume-title":"Distributed Computing","author":"R. Guerraoui","year":"2005","unstructured":"Guerraoui, R., Herlihy, M.P., Pochon, B.: Polymorphic contention management. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 303\u2013323. Springer, Heidelberg (2005)"},{"key":"28_CR11","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) (2005)","DOI":"10.1145\/1073814.1073863"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11561927_8","volume-title":"Distributed Computing","author":"F.E. Fich","year":"2005","unstructured":"Fich, F.E., Luchangco, V., Moir, M., Shavit, N.N.: Obstruction-free algorithms can be practically wait-free. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 78\u201392. Springer, Heidelberg (2005)"},{"key":"28_CR13","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) (2005)"},{"issue":"2","key":"28_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"Journal of the ACM"},{"issue":"4","key":"28_CR15","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., Toueg, S.: The weakest failure detector for solving consensus. Journal of the ACM\u00a043(4), 685\u2013722 (1996)","journal-title":"Journal of the ACM"},{"issue":"2","key":"28_CR16","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L. Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Transactions on Computer Systems\u00a016(2), 133\u2013169 (1998)","journal-title":"ACM Transactions on Computer Systems"},{"key":"28_CR17","unstructured":"Guerraoui, R., Kapa\u0142ka, M., Kouznetsov, P.: Boosting obstruction-freedom with low overhead. Technical report, EPFL (submitted for publication, 2006)"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapa\u0142ka, M., Kouznetsov, P.: The weakest failure detectors to boost obstruction-freedom. Technical report, EPFL (2006)","DOI":"10.1007\/11864219_28"},{"issue":"4","key":"28_CR19","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1145\/263867.263888","volume":"44","author":"P. Jayanti","year":"1997","unstructured":"Jayanti, P.: Robust wait-free hierarchies. Journal of the ACM\u00a044(4), 592\u2013614 (1997)","journal-title":"Journal of the ACM"},{"key":"28_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/11561927_11","volume-title":"Distributed Computing","author":"H. Attiya","year":"2005","unstructured":"Attiya, H., Guerraoui, R., Kouznetsov, P.: Computing with reads and writes in the absence of step contention. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 122\u2013136. Springer, Heidelberg (2005)"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Distributed Algorithms","author":"R. Guerraoui","year":"1996","unstructured":"Guerraoui, R., Schiper, A.: \u0393-accurate failure detectors. In: Babao\u011flu, \u00d6., Marzullo, K. (eds.) WDAG 1996. LNCS, vol.\u00a01151. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11864219_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:44:52Z","timestamp":1605642292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11864219_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540446248","9783540446279"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11864219_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}