{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T05:49:53Z","timestamp":1761976193118,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642415265"},{"type":"electronic","value":"9783642415272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41527-2_13","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T14:55:48Z","timestamp":1380812148000},"page":"179-193","source":"Crossref","is-referenced-by-count":4,"title":["Fair Synchronization"],"prefix":"10.1007","author":[{"given":"Gadi","family":"Taubenfeld","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"12","key":"13_CR1","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/2.546611","volume":"29","author":"S.V. Adve","year":"1996","unstructured":"Adve, S.V., Gharachorloo, K.: Shared memory consistency models: A tutorial. IEEE Computer\u00a029(12), 66\u201376 (1996)","journal-title":"IEEE Computer"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Afek, Y., Stupp, G., Touitou, D.: Long-lived adaptive collect with applications. In: Proc. 40th IEEE Symp. on Foundations of Computer Science, pp. 262\u2013272 (October 1999)","DOI":"10.1109\/SFFCS.1999.814598"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Anderson, J.H., Moir, M.: Using k-exclusion to implement resilient, scalable shared objects. In: Proc. 14th ACM Symp. on Principles of Distributed Computing, pp. 141\u2013150 (August 1994)","DOI":"10.1145\/197917.198073"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Anderson, J.H., Moir, M.: Using local-spin k-exclusion algorithms to improve wait-free object implementations. Distributed Computing\u00a011 (1997)","DOI":"10.1007\/s004460050039"},{"key":"13_CR5","unstructured":"Burns, J.E., Lynch, A.N.: Mutual exclusion using indivisible reads and writes. In: 18th Annual Allerton Conference on Communication, Control and Computing, pp. 833\u2013842 (October 1980)"},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1006\/inco.1993.1065","volume":"107","author":"J.N. Burns","year":"1993","unstructured":"Burns, J.N., Lynch, N.A.: Bounds on shared-memory for mutual exclusion. Information and Computation\u00a0107(2), 171\u2013184 (1993)","journal-title":"Information and Computation"},{"issue":"10","key":"13_CR7","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1145\/362759.362813","volume":"14","author":"P.L. Courtois","year":"1971","unstructured":"Courtois, P.L., Heyman, F., Parnas, D.L.: Concurrent control with Readers and Writers. Communications of the ACM\u00a014(10), 667\u2013668 (1971)","journal-title":"Communications of the ACM"},{"issue":"9","key":"13_CR8","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1145\/365559.365617","volume":"8","author":"E.W. Dijkstra","year":"1965","unstructured":"Dijkstra, E.W.: Solution of a problem in concurrent programming control. Communications of the ACM\u00a08(9), 569 (1965)","journal-title":"Communications of the ACM"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Easton, W.B.: Process synchronization without long-term interlock. In: Proc. of the 3rd ACM Symp. on Operating Systems Principles, pp. 95\u2013100 (1971)","DOI":"10.1145\/800212.806505"},{"key":"13_CR10","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":"13_CR11","doi-asserted-by":"crossref","unstructured":"Fich, F.E., Hendler, D., Shavit, N.: On the inherent weakness of conditional synchronization primitives. In: Proc. 23rd ACM Symp. on Principles of Distributed Computing, pp. 80\u201387 (2004)","DOI":"10.1145\/1011767.1011780"},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/59287.59292","volume":"11","author":"M.J. Fischer","year":"1989","unstructured":"Fischer, M.J., Lynch, N.A., Burns, J.E., Borodin, A.: Distributed FIFO allocation of identical resources using small shared space. ACM Trans. on Programming Languages and Systems\u00a011(1), 90\u2013114 (1989)","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Fischer, M.J., Lynch, N.A., Burns, J.E., Borodin, A.: Resource allocation with immunity to limited process failure. In: Proc. 20th IEEE Symp. on Foundations of Computer Science, pp. 234\u2013254 (October 1979)","DOI":"10.1109\/SFCS.1979.37"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Fomitchev, M., Ruppert, E.: Lock-free linked lists and skip lists. In: Proc. 23rd ACM Symp. on Principles of Distributed Computing, pp. 50\u201359 (2004)","DOI":"10.1145\/1011767.1011776"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-45414-4_21","volume-title":"Distributed Computing","author":"T.L. Harris","year":"2001","unstructured":"Harris, T.L.: A pragmatic implementation of non-blocking linked-lists. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol.\u00a02180, pp. 300\u2013314. Springer, Heidelberg (2001)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Hart, T.E., McKenney, P.E., Brown, A.D.: Making lockless synchronization fast: Performance implications of memory reclamation. In: Proc. of the 20th International Parallel and Distributed Processing Symp. (2006)","DOI":"10.1109\/IPDPS.2006.1639261"},{"issue":"1","key":"13_CR17","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":"13_CR18","unstructured":"Herlihy, M.P., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: Proc. of the 23rd International Conference on Distributed Computing Systems, p. 522 (2003)"},{"issue":"3","key":"13_CR19","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. Toplas\u00a012(3), 463\u2013492 (1990)","journal-title":"Toplas"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Katseff, H.P.: A new solution to the critical section problem. In: Proc. 10th ACM Symp. on Theory of Computing, pp. 86\u201388 (May 1978)","DOI":"10.1145\/800133.804335"},{"issue":"8","key":"13_CR21","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/361082.361093","volume":"17","author":"L. Lamport","year":"1974","unstructured":"Lamport, L.: A new solution of Dijkstra\u2019s concurrent programming problem. Communications of the ACM\u00a017(8), 453\u2013455 (1974)","journal-title":"Communications of the ACM"},{"issue":"9","key":"13_CR22","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"28","author":"L. Lamport","year":"1979","unstructured":"Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. on Computers\u00a028(9), 690\u2013691 (1979)","journal-title":"IEEE Trans. on Computers"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1145\/5383.5385","volume":"33","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: The mutual exclusion problem: Part II \u2013 statement and solutions. Journal of the ACM\u00a033, 327\u2013348 (1986)","journal-title":"Journal of the ACM"},{"issue":"1","key":"13_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L. Lamport","year":"1987","unstructured":"Lamport, L.: A fast mutual exclusion algorithm. ACM Trans. on Computer Systems\u00a05(1), 1\u201311 (1987)","journal-title":"ACM Trans. on Computer Systems"},{"issue":"4","key":"13_CR25","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/115372.115370","volume":"13","author":"E.A. Lycklama","year":"1991","unstructured":"Lycklama, E.A., Hadzilacos, V.: A first-come-first-served mutual exclusion algorithm with small communication variables. ACM Trans. on Programming Languages and Systems\u00a013(4), 558\u2013576 (1991)","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"13_CR26","unstructured":"Massalin, H., Pu, C.: A lock-free multiprocessor OS kernel. Technical Report CUCS-005-91, Columbia University (1991)"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proc. 15th ACM Symp. on Principles of Distributed Computing, pp. 267\u2013275 (1996)","DOI":"10.1145\/248052.248106"},{"key":"13_CR28","unstructured":"Peterson, G.L.: New bounds on mutual exclusion problems. Technical Report TR68, University of Rochester (February 1980) (Corrected, November 1994)"},{"key":"13_CR29","unstructured":"Raynal, M.: Concurrent Programming: Algorithms, Principles, and Foundations, 515 pages. Springer (2013) ISBN 978-3-642-32027-9"},{"key":"#cr-split#-13_CR30.1","unstructured":"Raynal, M.: Algorithms for mutual exclusion. The MIT Press (1986)"},{"key":"#cr-split#-13_CR30.2","unstructured":"Translation of: Algorithmique du parall\u00e9lisme (1984)"},{"key":"13_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/11516798_18","volume-title":"Principles of Distributed Systems","author":"H. Sundell","year":"2005","unstructured":"Sundell, H., Tsigas, P.: Lock-free and practical doubly linked list-based deques using single-word compare-and-swap. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol.\u00a03544, pp. 240\u2013255. Springer, Heidelberg (2005)"},{"key":"13_CR32","unstructured":"Taubenfeld, G.: Synchronization Algorithms and Concurrent Programming, 423 pages. Pearson\/Prentice-Hall (2006) ISBN 0-131-97259-6"},{"key":"13_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-30186-8_5","volume-title":"Distributed Computing","author":"G. Taubenfeld","year":"2004","unstructured":"Taubenfeld, G.: The black-white bakery algorithm and related bounded-space, adaptive, local-spinning and FIFO algorithms. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 56\u201370. Springer, Heidelberg (2004)"},{"key":"13_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-540-75142-7_34","volume-title":"Distributed Computing","author":"G. Taubenfeld","year":"2007","unstructured":"Taubenfeld, G.: Efficient transformations of obstruction-free algorithms into non-blocking algorithms. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 450\u2013464. Springer, Heidelberg (2007)"},{"key":"13_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-04355-0_17","volume-title":"Distributed Computing","author":"G. Taubenfeld","year":"2009","unstructured":"Taubenfeld, G.: Contention-sensitive data structures and algorithms. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 157\u2013171. Springer, Heidelberg (2009)"},{"key":"13_CR36","doi-asserted-by":"crossref","unstructured":"Taubenfeld, G.: Fair Synchronization, 2013. The full version is http:\/\/www.faculty.idc.ac.il\/gadi\/Publications.htm","DOI":"10.1007\/978-3-642-41527-2_13"},{"key":"13_CR37","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":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41527-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T15:27:32Z","timestamp":1746026852000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}