{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T00:44:23Z","timestamp":1792111463994,"version":"4.4.0"},"publisher-location":"New York, NY","reference-count":24,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_472","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T15:07:11Z","timestamp":1553094431000},"page":"2345-2351","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Wait-Free Synchronization"],"prefix":"10.1007","author":[{"given":"Mark","family":"Moir","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"472_CR231","doi-asserted-by":"crossref","unstructured":"Agarwal A, Cherian M (1989) Adaptive backoff synchronization techniques. In: Proceedings of the 16th annual international symposium on computer architecture. ACM Press, New York, pp 396\u2013406","DOI":"10.1145\/74925.74970"},{"key":"472_CR232","doi-asserted-by":"crossref","unstructured":"Aguilera MK, Frolund S, Hadzilacos V, Horn SL, Toueg S (2006) Brief announcement: abortable and query-abortable objects. In: Proceedings of the 20th annual international symposium on distributed computing","DOI":"10.1007\/11864219_37"},{"key":"472_CR233","doi-asserted-by":"crossref","unstructured":"Attiya H, Guerraoui R, Hendler D, Kouznetsov P (2006) Synchronizing without locks is inherently expensive. In: PODC\u201906: proceedings of the twenty-fifth annual ACM symposium on principles of distributed computing. ACM Press, New York, pp 300\u2013307","DOI":"10.1145\/1146381.1146427"},{"key":"472_CR234","doi-asserted-by":"crossref","unstructured":"Attiya H, Guerraoui R, Kouznetsov P (2005) Computing with reads and writes in the absence of step contention. In: Proceedings of the 19th annual international symposium on distributed computing","DOI":"10.1007\/11561927_11"},{"key":"472_CR235","doi-asserted-by":"crossref","unstructured":"Damron P, Fedorova A, Lev Y, Luchangco V, Moir M, Nussbaum D (2006) Hybrid transactional memory. In: Proceedings of the 12th symposium on architectural support for programming languages and operating systems","DOI":"10.1145\/1168857.1168900"},{"key":"472_CR236","doi-asserted-by":"crossref","unstructured":"Fich F, Luchangco V, Moir M, Shavit N (2005) Brief announcement: obstruction-free step complexity: lock-free DCAS as an example. In: Proceedings of the 19th annual international symposium on distributed computing","DOI":"10.1007\/11561927_37"},{"key":"472_CR237","doi-asserted-by":"crossref","unstructured":"Fich F, Luchangco V, Moir M, Shavit N (2005) Obstruction-free algorithms can be practically wait-free. In: Proceedings of the 19th annual international symposium on distributed computing","DOI":"10.1007\/11561927_8"},{"key":"472_CR238","unstructured":"Fraser K, Harris T (2004) Concurrent programming without locks. http:\/\/www.cl.cam.ac.uk\/netos\/papers\/2004-cpwl-submission.pdf"},{"key":"472_CR239","doi-asserted-by":"crossref","unstructured":"Guerraoui R, Herlihy M, Pochon B (2005) Polymorphic contention management. In: Proceedings of the 19th annual international symposium on distributed computing","DOI":"10.1007\/11561927_23"},{"key":"472_CR2310","doi-asserted-by":"crossref","unstructured":"Guerraoui R, Herlihy M, Pochon B (2005) Toward a theory of transactional contention managers. In: Proceedings of the 24th annual ACM symposium on principles of distributed computing, pp 258\u2013264","DOI":"10.1145\/1073814.1073863"},{"key":"472_CR2311","doi-asserted-by":"crossref","unstructured":"Guerraoui R, Kapalka M, Kouznetsov P (2006) The weakest failure detector to boost obstruction freedom. In: Proceedings of the 20th annual international symposium on distributed computing","DOI":"10.1007\/11864219_28"},{"key":"472_CR2312","doi-asserted-by":"crossref","unstructured":"Herlihy M (1991) Wait-free synchronization. ACM Trans Program Lang Syst 13(1):124\u2013149","DOI":"10.1145\/114005.102808"},{"key":"472_CR2313","doi-asserted-by":"crossref","unstructured":"Herlihy M (1993) A methodology for implementing highly concurrent data objects. ACM Trans Program Lang Syst 15(5):745\u2013770","DOI":"10.1145\/161468.161469"},{"key":"472_CR2314","unstructured":"Herlihy M, Luchangco V, Moir M (2002) Obstruction-free mechanism for atomic update of multiple non-contiguous locations in shared memory. US Patent Application 20040034673"},{"key":"472_CR2315","unstructured":"Herlihy M, Luchangco V, Moir M (2003) Obstruction-free synchronization: double-ended queues as an example. In: Proceedings of the 23rd international conference on distributed computing systems"},{"key":"472_CR2316","doi-asserted-by":"crossref","unstructured":"Herlihy M, Luchangco V, Moir M, Scherer W III (2003) Software transactional memory for supporting dynamic-sized data structures. In: Proceedings of the 22th annual ACM symposium on principles of distributed computing, pp 92\u2013101","DOI":"10.1145\/872035.872048"},{"key":"472_CR2317","doi-asserted-by":"crossref","unstructured":"Herlihy M, Moss JEB (1993) Transactional memory: architectural support for lock-free data structures. In: Proceedings of the 20th annual international symposium on computer architecture, pp 289\u2013300","DOI":"10.1145\/165123.165164"},{"key":"472_CR2318","unstructured":"Luchangco V, Moir M, Shavit N (2005) On the uncontended complexity of consensus. In: Proceedings of the 17th annual international symposium on distributed computing"},{"key":"472_CR2319","doi-asserted-by":"crossref","unstructured":"Marathe VJ, Moir M (2008) Toward high performance nonblocking software transactional memory. In: Proceedings of the 13th ACM SIGPLAN symposium on principles and practice of parallel programming. ACM, New York, pp 227\u2013236","DOI":"10.1145\/1345206.1345240"},{"key":"472_CR2320","doi-asserted-by":"crossref","unstructured":"Marathe V, Scherer W, Scott M (2005) Adaptive software transactional memory. In: Proceedings of the 19th annual international symposium on distributed computing","DOI":"10.1007\/11561927_26"},{"key":"472_CR2321","doi-asserted-by":"crossref","unstructured":"Michael M, Scott M (1998) Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors. J Parallel Distrib Comput 51(1):1\u201326","DOI":"10.1006\/jpdc.1998.1446"},{"key":"472_CR2322","doi-asserted-by":"crossref","unstructured":"Scherer W, Scott M (2005) Advanced contention management for dynamic software transactional memory. In: Proceedings of the 24th annual ACM symposium on principles of distributed computing","DOI":"10.1145\/1073814.1073861"},{"key":"472_CR2323","doi-asserted-by":"crossref","unstructured":"Shavit N, Touitou D (1997) Software transactional memory. Distrib Comput Special Issue 10:99\u2013116","DOI":"10.1007\/s004460050028"},{"key":"472_CR2324","unstructured":"Treiber R (1986) Systems programming: coping with parallelism. Technical Report RJ5118, IBM Almaden Research Center"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_472","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:50:12Z","timestamp":1792108212000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_472"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_472","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}