{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:20:00Z","timestamp":1725499200136},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540446248"},{"type":"electronic","value":"9783540446279"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11864219_3","type":"book-chapter","created":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T01:25:39Z","timestamp":1159925139000},"page":"31-45","source":"Crossref","is-referenced-by-count":12,"title":["Built-In Coloring for Highly-Concurrent Doubly-Linked Lists"],"prefix":"10.1007","author":[{"given":"Hagit","family":"Attiya","sequence":"first","affiliation":[]},{"given":"Eshcar","family":"Hillel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_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"},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s00224-002-1058-2","volume":"35","author":"O. Agesen","year":"2002","unstructured":"Agesen, O., Detlefs, D., Flood, C.H., Garthwaite, A., Martin, P., Moir, M., Shavit, N., Steele Jr., G.L.: DCAS-based concurrent deques. Theory Comput. Syst.\u00a035(3), 349\u2013386 (2002)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s002240011004","volume":"34","author":"N.S. Arora","year":"2001","unstructured":"Arora, N.S., Blumofe, R.D., Plaxton, C.G.: Thread scheduling for multiprogrammed multiprocessors. Theory Comput. Syst.\u00a034(2), 115\u2013144 (2001)","journal-title":"Theory Comput. Syst."},{"issue":"5","key":"3_CR4","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":"3_CR5","unstructured":"Attiya, H., Hillel, E.: Built-in coloring for highly-concurrent doubly-linked lists (2006), Available from, http:\/\/www.cs.technion.ac.il\/~hagit\/publications\/"},{"key":"3_CR6","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, Chichester (2004)","edition":"2"},{"key":"3_CR7","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"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-40026-5_4","volume-title":"Distributed Computing","author":"D.L. Detlefs","year":"2000","unstructured":"Detlefs, D.L., Flood, C.H., Garthwaite, A.T., Martin, P.A., Shavit, N.N., Steele Jr., G.L.: Even better DCAS-based concurrent deques. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol.\u00a01914, pp. 59\u201373. Springer, Heidelberg (2000)"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Doherty, S., Detlefs, D., Grove, L., Flood, C.H., Luchangco, V., Martin, P., Moir, M., Shavit, N., Steele Jr., G.L.: DCAS is not a silver bullet for nonblocking algorithm design. In: SPAA 2004, pp. 216\u2013224 (2004)","DOI":"10.1145\/1007912.1007945"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/11561927_37","volume-title":"Distributed Computing","author":"F.E. Fich","year":"2005","unstructured":"Fich, F.E., Luchangco, V., Moir, M., Shavit, N.N.: Obstruction-free step complexity: Lock-free DCAS as an example. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol.\u00a03724, pp. 493\u2013494. Springer, Heidelberg (2005)"},{"key":"3_CR11","unstructured":"Greenwald, M.: Non-Blocking Synchronization and System Design. Ph.D thesis, Stanford University (August 1999)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Greenwald, M.: Two-handed emulation: how to build non-blocking implementations of complex data-structures using DCAS. In: PODC 2002, pp. 260\u2013269 (2002)","DOI":"10.1145\/571825.571874"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Harris, T., Fraser, K.: Language support for lightweight transactions. In: OOPSLA 2003, pp. 388\u2013402 (2003)","DOI":"10.1145\/949343.949340"},{"key":"3_CR14","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)"},{"issue":"1","key":"3_CR15","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":"3_CR16","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: ICDCS 2003, pp. 522\u2013529 (2003)"},{"issue":"3","key":"3_CR17","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":"3_CR18","unstructured":"IBM. IBM System\/370 Extended Architecture, Principle of Operation, 1983. IBM Publication No. SA22-7085 (1983)"},{"key":"3_CR19","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":"3_CR20","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/564870.564881","volume-title":"SPAA 2002","author":"M. Michael","year":"2002","unstructured":"Michael, M.: High performance dynamic lock-free hash tables and list-based sets. In: SPAA 2002, pp. 73\u201382. ACM Press, New York (2002)"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1007\/978-3-540-45209-6_92","volume-title":"Euro-Par 2003 Parallel Processing","author":"M.M. Michael","year":"2003","unstructured":"Michael, M.M.: CAS-based lock-free algorithm for shared deques. In: Kosch, H., B\u00f6sz\u00f6rm\u00e9nyi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol.\u00a02790, pp. 651\u2013660. Springer, Heidelberg (2003)"},{"issue":"2","key":"3_CR22","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":"3_CR23","unstructured":"Sundell, H.: Efficient and Practical Non-Blocking Data Structures. Ph.D thesis, Chalmers University of Technology (2004)"},{"key":"3_CR24","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":"3_CR25","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"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11864219_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:44:53Z","timestamp":1605624293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11864219_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540446248","9783540446279"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11864219_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}