{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T00:34:14Z","timestamp":1794357254716,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":24,"publisher":"Springer US","isbn-type":[{"value":"9780387307701","type":"print"},{"value":"9780387301624","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_472","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T14:37:21Z","timestamp":1214491041000},"page":"1015-1020","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","reference":[{"key":"472_CR1_472","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1109\/ISCA.1989.714578","volume-title":"Proceedings of the 16th Annual International Symposium on Computer Architecture","author":"A. Agarwal","year":"1989","unstructured":"Agarwal, A., Cherian, M.: Adaptive backoff synchronization techniques. In:\nProceedings of the 16th Annual International Symposium on Computer Architecture, pp.\u00a0396\u2013406. ACM Press, New York (1989)"},{"key":"472_CR2_472","doi-asserted-by":"crossref","unstructured":"Aguilera, M.K., Frolund, S., Hadzilacos, V., Horn, S.L., Toueg, S.: Brief\nannouncement: Abortable and query-abortable objects. In: Proc. 20th Annual International Symposium on Distributed Computing,\n2006","DOI":"10.1007\/11864219_37"},{"key":"472_CR3_472","doi-asserted-by":"crossref","unstructured":"Attiya, H., Guerraoui, R., Hendler, D., Kouznetsov, P.: Synchronizing without\nlocks is inherently expensive. In: PODC '06: Proceedings of the twenty-fifth Annual ACM Symposium on Principles of Distributed Computing, New York, USA,\npp.\u00a0300\u2013307. ACM Press (2006)","DOI":"10.1145\/1146381.1146427"},{"key":"472_CR4_472","doi-asserted-by":"crossref","unstructured":"Attiya, H., Guerraoui, R., Kouznetsov, P.: Computing with reads and writes in\nthe absence of step contention. In: Proc. 19th Annual International Symposium on Distributed Computing, 2005","DOI":"10.1007\/11561927_11"},{"key":"472_CR5_472","doi-asserted-by":"crossref","unstructured":"Damron, P., Fedorova, A., Lev, Y., Luchangco, V., Moir, M., Nussbaum, D.: Hybrid\ntransactional memory. In: Proc. 12th Symposium on Architectural Support for Programming Languages and Operating Systems,\n2006","DOI":"10.1145\/1168857.1168900"},{"key":"472_CR6_472","doi-asserted-by":"crossref","unstructured":"Fich, F., Luchangco, V., Moir, M., Shavit, N.: Brief announcement:\nObstruction-free step complexity: Lock-free DCAS as an example. In: Proc. 19th Annual International Symposium on Distributed Computing,\n2005","DOI":"10.1007\/11561927_37"},{"key":"472_CR7_472","doi-asserted-by":"crossref","unstructured":"Fich, F., Luchangco, V., Moir, M., Shavit, N.: Obstruction-free algorithms can\nbe practically wait-free. In: Proc. 19th Annual International Symposium on Distributed Computing, 2005","DOI":"10.1007\/11561927_8"},{"key":"472_CR8_472","unstructured":"Fraser, K., Harris, T.: Concurrent programming without locks.\nhttp:\/\/www.cl.cam.ac.uk\/netos\/papers\/2004-cpwl-submission.pdf (2004)"},{"key":"472_CR9_472","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Herlihy, M., Pochon, B.: Polymorphic contention management. In:\nProc. 19th Annual International Symposium on Distributed Computing, 2005","DOI":"10.1007\/11561927_23"},{"key":"472_CR10_472","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Herlihy, M., Pochon, B.: Toward a\u00a0theory of transactional\ncontention managers. In: Proc. 24th Annual ACM Symposium on Principles of Distributed Computing, 2005,\npp.\u00a0258\u2013264","DOI":"10.1145\/1073814.1073863"},{"key":"472_CR11_472","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapalka, M., Kouznetsov, P.: The weakest failure detector to\nboost obstruction freedom. In: Proc. 20th Annual International Symposium on Distributed Computing, 2006","DOI":"10.1007\/11864219_28"},{"issue":"1","key":"472_CR12_472","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 Trans. Program. Lang.\nSyst. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"5","key":"472_CR13_472","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1145\/161468.161469","volume":"15","author":"M. Herlihy","year":"1993","unstructured":"Herlihy, M.: A\u00a0methodology for implementing highly concurrent data\nobjects. ACM Trans. Program. Lang. Syst. 15(5), 745\u2013770 (1993)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"472_CR14_472","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free mechanism for atomic\nupdate of multiple non-contiguous locations in shared memory. US Patent Application 20040034673 (2002)"},{"key":"472_CR15_472","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization:\nDouble-ended queues as an example. In: Proceedings of the 23rd International Conference on Distributed Computing Systems,\n2003"},{"key":"472_CR16_472","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Luchangco, V., Moir, M., Scherer III., W.: Software transactional\nmemory for supporting dynamic-sized data structures. In: Proc. 22th Annual ACM Symposium on Principles of Distributed Computing, 2003,\npp.\u00a092\u2013101","DOI":"10.1145\/872035.872048"},{"key":"472_CR17_472","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: Architectural support for\nlock-free data structures. In: Proc. 20th Annual International Symposium on Computer Architecture, 1993,\npp.\u00a0289\u2013300","DOI":"10.1145\/173682.165164"},{"key":"472_CR18_472","unstructured":"Luchangco, V., Moir, M., Shavit, N.: On the uncontended complexity of\nconsensus. In: Proc. 17th Annual International Symposium on Distributed Computing, 2005"},{"key":"472_CR19_472","doi-asserted-by":"crossref","unstructured":"Marathe, V.J., Moir, M.: Toward high performance nonblocking software  transactional memory. In: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming. pp. 227\u2013236, ACM, New York, USA (2008)","DOI":"10.1145\/1345206.1345240"},{"key":"472_CR20_472","doi-asserted-by":"crossref","unstructured":"Marathe, V., Scherer, W., Scott, M.: Adaptive software transactional memory.\nIn: Proc. 19th Annual International Symposium on Distributed Computing, 2005","DOI":"10.1007\/11561927_26"},{"issue":"1","key":"472_CR21_472","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\u2010safe\nlocking on multiprogrammed shared memory multiprocessors. J.\u00a0Parall. Distrib. Comput. 51(1), 1\u201326\n(1998)","journal-title":"J. Parall. Distrib. Comput."},{"key":"472_CR22_472","doi-asserted-by":"crossref","unstructured":"Scherer, W., Scott, M.: Advanced contention management for dynamic software\ntransactional memory. In: Proc. 24th Annual ACM Symposium on Principles of Distributed Computing, 2005","DOI":"10.1145\/1073814.1073861"},{"key":"472_CR23_472","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s004460050028","volume":"10","author":"N. Shavit","year":"1997","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. Distrib. Comput.,\nSpecial Issue 10, 99\u2013116 (1997)","journal-title":"Distrib. Comput.,Special Issue"},{"key":"472_CR24_472","unstructured":"Treiber, R.: Systems programming: Coping with parallelism. Technical Report\nRJ5118, IBM Almaden Research Center (1986)"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_472","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,2]],"date-time":"2022-09-02T22:02:48Z","timestamp":1662156168000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_472"}},"subtitle":["1991; Herlihy"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_472","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008]]}}}