{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:15:40Z","timestamp":1725498940353},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540774433"},{"type":"electronic","value":"9783540774440"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77444-0_9","type":"book-chapter","created":{"date-parts":[[2007,12,19]],"date-time":"2007-12-19T08:57:09Z","timestamp":1198054629000},"page":"112-123","source":"Crossref","is-referenced-by-count":1,"title":["Highly-Concurrent Multi-word Synchronization"],"prefix":"10.1007","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eshcar","family":"Hillel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Merritt, M., Taubenfeld, G., Touitou, D.: Disentangling multi-object operations. In: PODC 1997, pp. 111\u2013120 (1997)","DOI":"10.1145\/259380.259431"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Anderson, J.H., Moir, M.: Universal constructions for multi-object operations. In: PODC 1995, pp. 184\u2013193 (1995)","DOI":"10.1145\/224964.224985"},{"issue":"5","key":"9_CR3","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1145\/502102.502105","volume":"48","author":"H. Attiya","year":"2001","unstructured":"Attiya, H., Dagan, E.: Improved implementations of binary universal operations. J. ACM\u00a048(5), 1013\u20131037 (2001)","journal-title":"J. ACM"},{"key":"9_CR4","doi-asserted-by":"crossref","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"H. Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn. John Wiley & Sons, West Sussex (2004)","edition":"2"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Barnes, G.: A method for implementing lock-free shared-data structures. In: SPAA 1993, pp. 261\u2013270 (1993)","DOI":"10.1145\/165231.165265"},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1145\/203095.203101","volume":"17","author":"M. Choy","year":"1995","unstructured":"Choy, M., Singh, A.K.: Efficient fault-tolerant algorithms for distributed resource allocation. ACM Trans. Program. Lang. Syst.\u00a017(3), 535\u2013559 (1995)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Ha, P.H., Tsigas, P., Wattenhofer, M., Wattenhofer, R.: Efficient multi-word locking using randomization. In: PODC 2005, pp. 249\u2013257 (2005)","DOI":"10.1145\/1073814.1073862"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/3-540-36108-1_18","volume-title":"Distributed Computing","author":"T.L. Harris","year":"2002","unstructured":"Harris, T.L., Fraser, K., Pratt, I.A.: A practical multi-word compare-and-swap operation. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol.\u00a02508, pp. 265\u2013279. Springer, Heidelberg (2002)"},{"issue":"1","key":"9_CR9","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. Syst.\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: Architectural support for lock-free data structures. In: ISCA 1993, pp. 289\u2013300 (1993)","DOI":"10.1145\/173682.165164"},{"issue":"3","key":"9_CR11","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. ACM Trans. Program. Lang. Syst.\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Israeli, A., Rappoport, L.: Disjoint-access-parallel implementations of strong shared memory primitives. In: PODC 1994, pp. 151\u2013160 (1994)","DOI":"10.1145\/197917.198079"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Rajwar, R., Goodman, J.R.: Transactional lock-free execution of lock-based programs. In: ASPLOS 2002, pp. 5\u201317 (2002)","DOI":"10.1145\/605397.605399"},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s004460050028","volume":"10","author":"N. Shavit","year":"1997","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. Dist. Comp.\u00a010(2), 99\u2013116 (1997)","journal-title":"Dist. Comp."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Turek, J., Shasha, D., Prakash, S.: Locking without blocking: Making lock based concurrent data structure algorithms nonblocking. In: PODS 1992, pp. 212\u2013222 (1992)","DOI":"10.1145\/137097.137873"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77444-0_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:12:44Z","timestamp":1619521964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77444-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540774433","9783540774440"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77444-0_9","relation":{},"subject":[]}}