{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T15:46:11Z","timestamp":1768923971676,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540291633","type":"print"},{"value":"9783540320753","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561927_8","type":"book-chapter","created":{"date-parts":[[2005,10,10]],"date-time":"2005-10-10T10:14:47Z","timestamp":1128939287000},"page":"78-92","source":"Crossref","is-referenced-by-count":43,"title":["Obstruction-Free Algorithms Can Be Practically Wait-Free"],"prefix":"10.1007","author":[{"given":"Faith Ellen","family":"Fich","sequence":"first","affiliation":[]},{"given":"Victor","family":"Luchangco","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Moir","sequence":"additional","affiliation":[]},{"given":"Nir","family":"Shavit","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, A., Cherian, M.: Adaptive backoff synchronization techniques. In: Proceedings of the 16th International Symposium on Computer Architecture, May 1989, pp. 396\u2013406 (1989)","DOI":"10.1145\/74926.74970"},{"issue":"2","key":"8_CR2","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 J. Comput.\u00a026(2), 539\u2013556 (1997)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s002240011004","volume":"34","author":"N.S. Arora","year":"2001","unstructured":"Arora, N.S., Blumofe, R.D., Plaxton, C.G.: Thread scheduling for multiprogrammed multiprocessors. Theory of Computing Systems\u00a034(2), 115\u2013144 (2001)","journal-title":"Theory of Computing Systems"},{"issue":"5","key":"8_CR4","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1145\/185675.185815","volume":"41","author":"J. Aspnes","year":"1994","unstructured":"Aspnes, J., Herlihy, M., Shavit, N.: Counting networks. Journal of the ACM\u00a041(5), 1020\u20131048 (1994)","journal-title":"Journal of the ACM"},{"issue":"6","key":"8_CR5","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/BF01191625","volume":"27","author":"H. Attiya","year":"1994","unstructured":"Attiya, H., Mavronicolas, M.: Efficiency of semisynchronous versus asynchronous networks. Math. Syst. Theory\u00a027(6), 547\u2013571 (1994)","journal-title":"Math. Syst. Theory"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1006\/inco.1993.1065","volume":"107","author":"J.E. Burns","year":"1993","unstructured":"Burns, J.E., Lynch, N.A.: Bounds on shared memory for mutual exclusion. Information and Computation\u00a0107(2), 171\u2013184 (1993)","journal-title":"Information and Computation"},{"issue":"2","key":"8_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., Toueg, S.: Unreliable failure detectors for reliable distributed systems. J. ACM\u00a043(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/1073970.1073974","volume-title":"Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures","author":"D. Chase","year":"2005","unstructured":"Chase, D., Lev, Y.: Dynamic circular work-stealing deque. In: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 21\u201328. ACM Press, New York (2005)"},{"issue":"2","key":"8_CR9","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. J. ACM\u00a035(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"8_CR10","unstructured":"Fischer, M.: Personal communication with Leslie Lamport (June 1985)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Fischer, M., Lynch, N., Paterson, M.: Impossibility of distributed consensus with one faulty process. Journal of the ACM, 374\u2013382 (1985)","DOI":"10.1145\/3149.214121"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/3-540-40026-5_22","volume-title":"Distributed Computing","author":"E. Gafni","year":"2000","unstructured":"Gafni, E., Lamport, L.: Disk Paxos. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol.\u00a01914, pp. 330\u2013344. Springer, Heidelberg (2000)"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/301308.301318","volume-title":"PODC 1999: Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing","author":"E. Gafni","year":"1999","unstructured":"Gafni, E., Mitzenmacher, M.: Analysis of timing-based mutual exclusion with random times. In: PODC 1999: Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, pp. 13\u201321. ACM Press, New York (1999)"},{"key":"8_CR14","first-page":"258","volume-title":"Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing","author":"R. Guerraoui","year":"2005","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, pp. 258\u2013264. ACM Press, New York (2005)"},{"issue":"1","key":"8_CR15","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"},{"key":"8_CR16","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: Proc. 23rd International Conference on Distributed Computing Systems (2003)"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Space- and time-adaptive nonblocking algorithms. In: Proceedings of Computing: The Australasian Theory Symposium, CATS (2003)","DOI":"10.1016\/S1571-0661(04)81017-X"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Luchangco, V., Moir, M., Scherer III, W.N.: Software transactional memory for supporting dynamic-sized data structures. In: Proc. 22nd Annual ACM Symposium on Principles of Distributed Computing, pp. 92\u2013101 (2003)","DOI":"10.1145\/872035.872048"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/BFb0020440","volume-title":"Distributed Algorithms","author":"W.-K. Lo","year":"1994","unstructured":"Lo, W.-K., Hadzilacos, V.: Using failure detectors to solve consensus in asynchronous shared-memory systems (extended abstract). In: Tel, G., Vit\u00e1nyi, P.M.B. (eds.) WDAG 1994. LNCS, vol.\u00a0857, pp. 280\u2013295. Springer, Heidelberg (1994)"},{"key":"8_CR20","first-page":"163","volume-title":"Advances in Computing Research","author":"M.C. Loui","year":"1987","unstructured":"Loui, M.C., Abu-Amara, H.H.: Memory requirements for agreement among unreliable asynchronous processes. In: Preparata, F.P. (ed.) Advances in Computing Research, vol.\u00a04, pp. 163\u2013183. JAI Press, Greenwich (1987)"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1145\/777412.777468","volume-title":"SPAA 2003: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures","author":"V. Luchangco","year":"2003","unstructured":"Luchangco, V., Moir, M., Shavit, N.: Nonblocking k-compare-single-swap. In: SPAA 2003: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 314\u2013323. ACM Press, New York (2003)"},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0304-3975(98)00237-0","volume":"220","author":"N. Lynch","year":"1999","unstructured":"Lynch, N., Shavit, N., Shvartsman, A., Touitou, D.: Timing conditions for linearizability in uniform counting networks. Theor. Comput. Sci.\u00a0220(1), 67\u201391 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR23","first-page":"2","volume-title":"IEEE Real-Time Systems Symposium","author":"N.A. Lynch","year":"1992","unstructured":"Lynch, N.A., Shavit, N.: Timing-based mutual exclusion. In: IEEE Real-Time Systems Symposium, pp. 2\u201311. IEEE Press, Los Alamitos (1992)"},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1109\/IPPS.1997.580978","volume-title":"IPPS 1997: Proceedings of the 11th International Symposium on Parallel Processing","author":"M. Mavronicolas","year":"1997","unstructured":"Mavronicolas, M., Papatriantafilou, M., Tsigas, P.: The impact of timing on linearizability in counting networks. In: IPPS 1997: Proceedings of the 11th International Symposium on Parallel Processing, pp. 684\u2013688. IEEE Computer Society, Los Alamitos (1997)"},{"issue":"1","key":"8_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jpdc.1998.1446","volume":"51","author":"M. Michael","year":"1998","unstructured":"Michael, M., Scott, M.: Nonblocking algorithms and preemption-safe locking on multiprogrammed shared-memory multiprocessors. Journal of Parallel and Distributed Computing\u00a051(1), 1\u201326 (1998)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Scherer III, W.N., Scott, M.L.: Contention management in dynamic software transactional memory. In: Moir, M., Shavit, N. (eds.) Proceedings of Workshop on Concurrency and Sycnhronization in Java Programs (July 2004)","DOI":"10.1145\/1073814.1073861"},{"key":"8_CR27","first-page":"240","volume-title":"Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing","author":"W.N. Scherer III","year":"2005","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, pp. 240\u2013248. ACM Press, New York (2005)"},{"key":"8_CR28","unstructured":"Treiber, R.K.: Systems programming: Coping with parallelism. Technical Report RJ 5118, IBM Almaden Research Center (April 1986)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561927_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T21:41:00Z","timestamp":1683236460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561927_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291633","9783540320753"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11561927_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}