{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:01:21Z","timestamp":1783576881920,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540000730","type":"print"},{"value":"9783540361084","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36108-1_18","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T20:38:36Z","timestamp":1178224716000},"page":"265-279","source":"Crossref","is-referenced-by-count":74,"title":["A Practical Multi-word Compare-and-Swap Operation"],"prefix":"10.1007","author":[{"given":"Timothy L.","family":"Harris","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Keir","family":"Fraser","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ian A.","family":"Pratt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"issue":"12","key":"18_CR1","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/2.546611","volume":"29","author":"S. V. Adve","year":"1996","unstructured":"S. V. Adve and K. Gharachorloo. Shared memory consistency models: a tutorial. IEEE Computer, 29(12):66\u201376, Dec. 1996.","journal-title":"IEEE Computer"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"J. H. Anderson and M. Moir. Universal constructions for multi-object operations. In Proc. 14th PODC, pp 184\u2013193, Aug. 1995.","DOI":"10.1145\/224964.224985"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"J. H. Anderson, S. Ramamurthy, and R. Jain. Implementing wait-free objects on priority-based systems. In Proc. 16th PODC, pp 229\u2013238, Aug. 1997.","DOI":"10.1145\/259380.259443"},{"key":"18_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/3-540-40026-5_4","volume-title":"Proc. 14th DISC","author":"D. L. Detlefs","year":"2000","unstructured":"D. L. Detlefs, C. H. Flood, A. T. Garthwaite, P. A. Martin, N. N. Shavit, and G. L. Steele Jr. Even better DCAS-based concurrent deques. In Proc. 14th DISC, LNCS 1914, pp 59\u201373, Oct. 2000."},{"key":"18_CR5","unstructured":"M. Greenwald. Non-blocking synchronization and system design. PhD thesis, Stanford University, Aug. 1999."},{"key":"18_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1007\/3-540-45414-4_21","volume-title":"Proc. 15th DISC","author":"T. L. Harris","year":"2001","unstructured":"T. L. Harris. A pragmatic implementation of non-blocking linked lists. In Proc. 15th DISC, LNCS 2180, pp 300\u2013314, Oct. 2001."},{"issue":"5","key":"18_CR7","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1145\/161468.161469","volume":"15","author":"M. Herlihy","year":"1993","unstructured":"M. Herlihy. A methodology for implementing highly concurrent data objects. ACM TOPLAS, 15(5):745\u2013770, Nov. 1993.","journal-title":"ACM TOPLAS"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"M. Herlihy, V. Luchangco, and M. Moir The repeat offender problem: a mechanism for supporting dynamic-sized, lock-free data structures. In Proc. 16th DISC, 2002.","DOI":"10.1007\/3-540-36108-1_23"},{"issue":"5","key":"18_CR9","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"G. J. Holzmann","year":"1997","unstructured":"G. J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279\u2013295, May 1997.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"A. Israeli and L. Rappoport. Disjoint-access-parallel implementations of strong shared memory primitives. In Proc. 13th PODC, pp 151\u2013160, Aug. 1994.","DOI":"10.1145\/197917.198079"},{"key":"18_CR11","unstructured":"H. Massalin and C. Pu. A lock-free multiprocessor OS kernel. Technical Report CUCS-005-91, Columbia University, Department of Computer Science, June 1991."},{"issue":"1","key":"18_CR12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/103727.103729","volume":"9","author":"J. M. Mellor-Crummey","year":"1991","unstructured":"J. M. Mellor-Crummey and M. L. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM TOCS, 9(1):21\u201365, Feb. 1991.","journal-title":"ACM TOCS"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"M. M. Michael. Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. In Proc. 21st PODC, July 2002.","DOI":"10.1145\/571825.571829"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"M. Moir. Practical implementations of non-blocking synchronization primitives. In Proc. 16th PODC, pp 219\u2013228, Aug. 1997.","DOI":"10.1145\/259380.259442"},{"key":"18_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BFb0030692","volume-title":"Distributed Algorithms, 11th International Workshop","author":"M. Moir","year":"1997","unstructured":"M. Moir. Transparent support for wait-free transactions. In Distributed Algorithms, 11th International Workshop, LNCS 1320, pp 305\u2013319, Sept. 1997."},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"N. N. Shavit and D. Touitou. Software transactional memory. In Proc. 14th PODC, pp 204\u2013213, Aug. 1995.","DOI":"10.1145\/224964.224987"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"J. D. Valois. Lock-free linked lists using compare-and-swap. In Proc. 14th PODC pp 214\u2013222, Aug. 1995.","DOI":"10.1145\/224964.224988"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:08:11Z","timestamp":1550304491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36108-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000730","9783540361084"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36108-1_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}