{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:09:08Z","timestamp":1725491348480},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540751410"},{"type":"electronic","value":"9783540751427"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75142-7_34","type":"book-chapter","created":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T14:00:46Z","timestamp":1189000846000},"page":"450-464","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms"],"prefix":"10.1007","author":[{"given":"Gadi","family":"Taubenfeld","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"34_CR1","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/S0097539794265244","volume":"26","author":"R. Alur","year":"1997","unstructured":"Alur, R., Attiya, H., Taubenfeld, G.: Time-adaptive algorithms for synchronization. SIAM Journal on Computing\u00a026(2), 539\u2013556 (1997)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"34_CR2","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":"1","key":"34_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/7531.7533","volume":"34","author":"D. Dolev","year":"1987","unstructured":"Dolev, D., Dwork, C., Stockmeyer, L.: On the minimal synchronism needed for distributed consensus. Journal of the ACM\u00a034(1), 77\u201397 (1987)","journal-title":"Journal of the ACM"},{"issue":"2","key":"34_CR4","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. Journal of the ACM\u00a035(2), 288\u2013323 (1988)","journal-title":"Journal of the ACM"},{"key":"34_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11561927_8","volume-title":"Distributed Computing","author":"E.F. Fich","year":"2005","unstructured":"Fich, E.F., Luchangco, V., Moir, M., Shavit, 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":"34_CR6","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Herlihy, M., Pochon, B.: Towards a theory of transactional contention managers. In: Proc. 24th Symposium on Principles of Distributed Computing, pp. 258\u2013264 (2005)","DOI":"10.1145\/1073814.1073863"},{"key":"34_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/11864219_28","volume-title":"Distributed Computing","author":"R. Guerraoui","year":"2006","unstructured":"Guerraoui, R., Kapalka, M., Kouznetsov, P.: The weakest failure detectors to boost obstruction-freedom. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 376\u2013390. Springer, Heidelberg (2006)"},{"issue":"1","key":"34_CR8","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M.P. Herlihy","year":"1991","unstructured":"Herlihy, M.P.: Wait-free synchronization. ACM Trans. on Programming Languages and Systems\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"34_CR9","unstructured":"Herlihy, M.P., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: Proc. of the 23rd International Conf. on Dist. Computing Systems, p. 522 (2003)"},{"key":"34_CR10","first-page":"92","volume-title":"Proc. 22nd ACM Symp. on Principles of Distributed Computing","author":"M.P. Herlihy","year":"2003","unstructured":"Herlihy, M.P., Luchangco, V., Moir, M., Scherer III, W.N.: Software transactional memory for dynamic-sized data structures. In: Proc. 22nd ACM Symp. on Principles of Distributed Computing, pp. 92\u2013101. ACM Press, New York (2003)"},{"issue":"3","key":"34_CR11","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M.P. Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. on Programming Languages and Systems\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"34_CR12","volume-title":"Proc. 19th ACM Symp. on Parallelism in Algorithms and Architectures","author":"M. Raynal","year":"2007","unstructured":"Raynal, M., Taubenfeld, G.: The notion of a timed register and its application to indulgent synchronization. In: Proc. 19th ACM Symp. on Parallelism in Algorithms and Architectures, ACM Press, New York (2007)"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Scherer III, W.N., Scott, M.L.: Advanced contention management for dynamic software transactional memory. In: Proc. 24th Symposium on Principles of Distributed Computing, pp. 240\u2013248 (2005)","DOI":"10.1145\/1073814.1073861"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Taubenfeld, G.: Computing in the presence of timing failures. In: ICDCS 2006. Proc. 26th Int\u2019l IEEE Conference on Distributed Computing Systems (2006)","DOI":"10.1109\/ICDCS.2006.21"},{"key":"34_CR15","unstructured":"Taubenfeld, G.: Synchronization Algorithms and Concurrent Programming. Pearson \/ Prentice-Hall, p. 423 (2006), ISBN 0-131-97259-6"},{"key":"34_CR16","unstructured":"Valois, J.D.: Implementing lock-free queues. In: Proc. of the 7th International Conference on Parallel and Distributed Computing Systems, pp. 212\u2013222 (1994)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75142-7_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:52:42Z","timestamp":1619520762000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75142-7_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540751410","9783540751427"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75142-7_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}