{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T03:49:44Z","timestamp":1673408984584},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,12,2]],"date-time":"2008-12-02T00:00:00Z","timestamp":1228176000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2009,1]]},"DOI":"10.1007\/s00224-008-9155-5","type":"journal-article","created":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T11:21:59Z","timestamp":1228130519000},"page":"39-66","source":"Crossref","is-referenced-by-count":2,"title":["Nonblocking k-Compare-Single-Swap"],"prefix":"10.1007","volume":"44","author":[{"given":"Victor","family":"Luchangco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Moir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nir","family":"Shavit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,12,2]]},"reference":[{"issue":"4","key":"9155_CR1","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y. Afek","year":"1993","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. Assoc. Comput. Mach. 40(4), 873\u2013890 (1993)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9155_CR2","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s00224-002-1058-2","volume":"35","author":"O. Agesen","year":"2002","unstructured":"Agesen, O., Detlefs, D., Flood, C., Garthwaite, A., Martin, P., Moir, M., Shavit, N., Steele, G.: DCAS-based concurrent deques. Theory Comput. Syst. 35, 349\u2013386 (2002). A preliminary version appeared in the Proc. 12th ACM Symposium on Parallel Algorithms and Architectures","journal-title":"Theory Comput. Syst."},{"key":"9155_CR3","doi-asserted-by":"crossref","unstructured":"Attiya, H., Dagan, E.: Universal operations: Unary versus binary. In: Proc. 15th Annual ACM Symposium on Principles of Distributed Computing, May 1996","DOI":"10.1145\/248052.248097"},{"key":"9155_CR4","doi-asserted-by":"crossref","unstructured":"Barnes, G.: A method for implementing lock-free shared data structures. In: Proc. 5th ACM Symposium on Parallel Algorithms and Architectures, pp. 261\u2013270, June 1993","DOI":"10.1145\/165231.165265"},{"issue":"4","key":"9155_CR5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00446-002-0079-z","volume":"15","author":"D. Detlefs","year":"2002","unstructured":"Detlefs, D., Martin, P., Moir, M., Steele, G.: Lock-free reference counting. Distributed Comput. 15(4), 255\u2013271 (2002). A preliminary version appeared in the Proc. 20th Annual ACM Symposium on Principles of Distributed Computing, 2001","journal-title":"Distributed Comput."},{"key":"9155_CR6","doi-asserted-by":"crossref","unstructured":"Doherty, S., Herlihy, M., Luchangco, V., Moir, M.: Bringing practical lock-free synchronization to 64-bit applications. In: Proc. 23rd Annual ACM Symposium on Principles of Distributed Computing, pp. 31\u201339 (2004)","DOI":"10.1145\/1011767.1011773"},{"key":"9155_CR7","unstructured":"Ellen, F.: Personal communication (2003)"},{"key":"9155_CR8","unstructured":"Glew, A., Hwu, W.: A feature taxonomy and survey of synchronization primitive implementations. Technical Report CRHC-91-7, University of Illinois at Urbana-Champaign, December 1990"},{"key":"9155_CR9","unstructured":"Greenwald, M.: Non-blocking synchronization and system design. PhD thesis, Stanford University. Technical Report STAN-CS-TR-99-1624, August 1999"},{"key":"9155_CR10","doi-asserted-by":"crossref","unstructured":"Harris, T.: A pragmatic implementation of non-blocking linked lists. In: Proc. 15th International Symposium on Distributed Computing (2001)","DOI":"10.1007\/3-540-45414-4_21"},{"key":"9155_CR11","unstructured":"Harris, T.: Personal communication, December 2002"},{"key":"9155_CR12","doi-asserted-by":"crossref","unstructured":"Harris, T., Fraser, K., Pratt, I.: A practical multi-word compare-and-swap operation. In: Proc. 16th International Symposium on Distributed Computing (2002)","DOI":"10.1007\/3-540-36108-1_18"},{"issue":"1","key":"9155_CR13","doi-asserted-by":"crossref","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. Syst. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9155_CR14","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: Architectural support for lock-free data structures. In: Proc. 20th Annual International Symposium on Computer Architecture (1993)","DOI":"10.1145\/165123.165164"},{"issue":"3","key":"9155_CR15","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.: Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9155_CR16","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free software NCAS and transactional memory. Unpublished manuscript (2002)"},{"key":"9155_CR17","doi-asserted-by":"crossref","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, pp. 522\u2013529 (2003)","DOI":"10.1109\/ICDCS.2003.1203503"},{"key":"9155_CR18","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Luchangco, V., Moir, M., Scherer, W.: Software transactional memory for supporting dynamic-sized data structures. In: Proc. 22th Annual ACM Symposium on Principles of Distributed Computing, pp. 92\u2013101 (2003)","DOI":"10.1145\/872035.872048"},{"issue":"2","key":"9155_CR19","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1145\/1062247.1062249","volume":"23","author":"M. Herlihy","year":"2005","unstructured":"Herlihy, M., Luchangco, V., Martin, P., Moir, M.: Nonblocking memory management support for dynamic-sized data structures. ACM Trans. Comput. Syst. 23(2), 146\u2013196 (2005)","journal-title":"ACM Trans. Comput. Syst."},{"key":"9155_CR20","unstructured":"Intel: Pentium processor family user\u2019s manual: Vol. 3, architecture and programming manual (1994)"},{"key":"9155_CR21","doi-asserted-by":"crossref","unstructured":"Israeli, A., Rappoport, L.: Disjoint-access-parallel implementations of strong shared memory primitives. In: Proc. 13th Annual ACM Symposium on Principles of Distributed Computing, pp. 151\u2013160 (1994)","DOI":"10.1145\/197917.198079"},{"issue":"2","key":"9155_CR22","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1006\/inco.1995.1134","volume":"121","author":"N. Lynch","year":"1995","unstructured":"Lynch, N., Vaandrager, F.: Forward and backward simulations\u2014part I: Untimed systems. Inf. Comput. 121(2), 214\u2013233 (1995)","journal-title":"Inf. Comput."},{"key":"9155_CR23","doi-asserted-by":"crossref","unstructured":"Michael, M.: High performance dynamic lock-free hash tables and list-based sets. In: Proc. 14th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 73\u201382 (2002)","DOI":"10.1145\/564870.564881"},{"issue":"6","key":"9155_CR24","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1109\/TPDS.2004.8","volume":"15","author":"M. Michael","year":"2004","unstructured":"Michael, M.: Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. IEEE Trans. Parallel Distributed Syst. 15(6), 491\u2013504 (2004)","journal-title":"IEEE Trans. Parallel Distributed Syst."},{"issue":"1","key":"9155_CR25","doi-asserted-by":"crossref","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. J. Parallel Distributed Comput. 51(1), 1\u201326 (1998)","journal-title":"J. Parallel Distributed Comput."},{"key":"9155_CR26","doi-asserted-by":"crossref","unstructured":"Moir, M.: Practical implementations of non-blocking synchronization primitives. In: Proc. 16th Annual ACM Symposium on Principles of Distributed Computing, pp. 219\u2013228 (1997)","DOI":"10.1145\/259380.259442"},{"key":"9155_CR27","doi-asserted-by":"crossref","unstructured":"Moir, M.: Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions. In: Proceedings of the 19th Annual ACM Symposium on the Principles of Distributed Computing, pp. 61\u201370 (2000)","DOI":"10.1145\/343477.343520"},{"key":"9155_CR28","volume-title":"MC68030 User\u2019s Manual","author":"Motorola","year":"1989","unstructured":"Motorola: MC68030 User\u2019s Manual. Prentice Hall, New York (1989)"},{"issue":"2","key":"9155_CR29","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. Distributed Comput. 10(2), 99\u2013116 (1997)","journal-title":"Distributed Comput."},{"key":"9155_CR30","unstructured":"Sites, R.: Alpha architecture reference manual (1992)"},{"key":"9155_CR31","doi-asserted-by":"crossref","unstructured":"Turek, J., Shasha, D., Prakash, S.: Locking without blocking: Making lock-based concurrent data structure algorithms nonblocking. In: Proc. 11th ACM Symposium on Principles of Database Systems, pp. 212\u2013222 (1992)","DOI":"10.1145\/137097.137873"},{"key":"9155_CR32","volume-title":"The SPARC architecture manual version 9","author":"D. Weaver","year":"1994","unstructured":"Weaver, D., Germond, T.: The SPARC architecture manual version 9. Prentice Hall, New York (1994)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-008-9155-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-008-9155-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-008-9155-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:51:36Z","timestamp":1558684296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-008-9155-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12,2]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["9155"],"URL":"https:\/\/doi.org\/10.1007\/s00224-008-9155-5","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12,2]]}}}