{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:30:00Z","timestamp":1764783000420},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540000730"},{"type":"electronic","value":"9783540361084"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36108-1_23","type":"book-chapter","created":{"date-parts":[[2007,5,4]],"date-time":"2007-05-04T00:38:36Z","timestamp":1178239116000},"page":"339-353","source":"Crossref","is-referenced-by-count":36,"title":["The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures"],"prefix":"10.1007","author":[{"given":"Maurice","family":"Herlihy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Luchangco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Moir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s004460050039","volume":"11","author":"J. Anderson","year":"1997","unstructured":"J. Anderson and M. Moir. Using local-spin k-exclusion algorithms to improve wait-free object implementations. Distributed Computing, 11:1\u201320, 1997. A preliminary version appeared in Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, 1994, pp. 141\u2013150.","journal-title":"Distributed Computing"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"D. Detlefs, C. Flood, A. Garthwaite, P. Martin, N. Shavit, and G. Steele. Even better DCAS-based concurrent deques. In Proceedings of the 14th International Conference on Distributed Computing, pages 59\u201373, 2000.","DOI":"10.1007\/3-540-40026-5_4"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"D. Detlefs, P. Martin, M. Moir, and G. Steele. Lock-free reference counting. In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, pages 190\u2013199, 2001.","DOI":"10.1145\/383962.384016"},{"key":"23_CR4","unstructured":"M. Greenwald. Non-Blocking Synchronization and System Design. PhD thesis, Stanford University Technical Report STAN-CS-TR-99-1624, Palo Alto, CA, August 1999."},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"T. Harris. A pragmatic implementation of non-blocking linked lists. In Proceedings of the 15th International Symposium on Distributed Computing, 2001. To appear.","DOI":"10.1007\/3-540-45414-4_21"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"M. Herlihy, V. Luchangco, P. Martin, and M. Moir. Dynamic-sized lock-free data structures. Technical Report TR-2002-110, Sun Microsystems Laboratories, 2002.","DOI":"10.1145\/571825.571847"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"M. Herlihy, V. Luchangco, and M. Moir. The repeat offender problem: A mechanism for supporting lock-free dynamic-sized data structures. Technical Report TR-2002-112, Sun Microsystems Laboratories, 2002.","DOI":"10.1007\/3-540-36108-1_23"},{"issue":"9","key":"23_CR8","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1109\/TC.1979.1675439","volume":"C-28","author":"L. Lamport","year":"1979","unstructured":"L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28(9):241\u2013248, September 1979.","journal-title":"IEEE Transactions on Computers"},{"key":"23_CR9","volume-title":"Technical Report CWI-Quarterly","author":"N. Lynch","year":"1989","unstructured":"N. Lynch and M. Tuttle. An introduction to input\/output automata. Technical Report CWI-Quarterly, 2(3), Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands, 1989."},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"M. Michael. Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. In Proceedings of the 21st Annual ACM Symposium on the Principles of Distributed Computing, 2002.","DOI":"10.1145\/571825.571829"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"M. Michael and M. Scott. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In Proceedings of the 15th Annual ACM Symposium on the Principles of Distributed Computing, pages 267\u2013276, 1996.","DOI":"10.1145\/248052.248106"},{"issue":"1","key":"23_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jpdc.1998.1446","volume":"51","author":"M. Michael","year":"1998","unstructured":"M. Michael and M. Scott. Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors. Journal of Parallel and Distributed Computing, 51(1):1\u201326, 1998.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"M. Moir. Practical implementations of non-blocking synchronization primitives. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pages 219\u2013228, 1997.","DOI":"10.1145\/259380.259442"},{"key":"23_CR14","unstructured":"R. Treiber. Systems programming: Coping with parallelism. Technical Report RJ5118, IBM Almaden Research Center, 1986."},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"J. Valois. Lock-free linked lists using compare-and-swap. In Proceedings of the 14th Annual ACM Symposium on Principles of Dsitributed Computing, pages 214\u201322, 1995. See http:\/\/www.cs.sunysb.edu~valois for errata.","DOI":"10.1145\/224964.224988"},{"key":"23_CR16","volume-title":"The SPARC Architecture Manual Version 9","author":"D. Weaver","year":"1994","unstructured":"D. Weaver and T. Germond. The SPARC Architecture Manual Version 9. PTR Prentice Hall, Englewood Cliffs, NJ 07632, USA, 1994."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36108-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T18:17:32Z","timestamp":1556389052000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36108-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000730","9783540361084"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-36108-1_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}