{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T16:45:44Z","timestamp":1725813944885},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319144719"},{"type":"electronic","value":"9783319144726"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-14472-6_26","type":"book-chapter","created":{"date-parts":[[2014,12,9]],"date-time":"2014-12-09T09:44:09Z","timestamp":1418118249000},"page":"388-403","source":"Crossref","is-referenced-by-count":3,"title":["Practical Concurrent Unrolled Linked Lists Using Lazy Synchronization"],"prefix":"10.1007","author":[{"given":"Kenneth","family":"Platz","sequence":"first","affiliation":[]},{"given":"Neeraj","family":"Mittal","sequence":"additional","affiliation":[]},{"given":"Subbarayan","family":"Venkatesan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-25873-2_22","volume-title":"Principles of Distributed Systems","author":"M. Herlihy","year":"2011","unstructured":"Herlihy, M., Shavit, N.: On the nature of progress. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol.\u00a07109, pp. 313\u2013328. Springer, Heidelberg (2011)"},{"key":"26_CR2","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press (2009)"},{"key":"26_CR3","volume-title":"The Art of Multiprocessor Programming","author":"M. Herlihy","year":"2012","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming, 1st edn. Elsevier, Inc., Waltham (2012)","edition":"1"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11795490_3","volume-title":"Principles of Distributed Systems","author":"S. Heller","year":"2006","unstructured":"Heller, S., Herlihy, M., Luchangco, V., Moir, M., Scherer III, W.N., Shavit, N.N.: A lazy concurrent list-based set algorithm. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol.\u00a03974, pp. 3\u201316. Springer, Heidelberg (2006)"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1145\/182409.182453","volume-title":"ACM Conference on LISP and Functional Programming (LFP 1994)","author":"Z. Shao","year":"1994","unstructured":"Shao, Z., Reppy, J.H., Appel, A.W.: Unrolling lists. In: ACM Conference on LISP and Functional Programming (LFP 1994), pp. 185\u2013195. ACM, New York (1994)"},{"key":"26_CR6","unstructured":"Demaine, E.: Cache-oblivious algorithms and data structures. In: Lecture Notes from the EEF Summer School on Massive Data Sets (2002)"},{"key":"26_CR7","volume-title":"Computer Organization and Design: The Hardware\/Software Interface","author":"D.A. Patterson","year":"2013","unstructured":"Patterson, D.A., Hennessy, J.L.: Computer Organization and Design: The Hardware\/Software Interface, 5th edn. Morgan Kaufmann Publishers Inc., San Francisco (2013)","edition":"5"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-17679-1_10","volume-title":"Distributed Computing and Networking","author":"A. Braginsky","year":"2011","unstructured":"Braginsky, A., Petrank, E.: Locality-conscious lock-free linked lists. In: Aguilera, M.K., Yu, H., Vaidya, N.H., Srinivasan, V., Choudhury, R.R. (eds.) ICDCN 2011. LNCS, vol.\u00a06522, pp. 107\u2013118. Springer, Heidelberg (2011)"},{"key":"26_CR9","first-page":"214","volume-title":"14th ACM Symposium on Principles of Distributed Computing (PODC 1995)","author":"J.D. Valois","year":"1995","unstructured":"Valois, J.D.: Lock-free linked lists using compare-and-swap. In: 14th ACM Symposium on Principles of Distributed Computing (PODC 1995), pp. 214\u2013222. ACM, New York (1995)"},{"key":"26_CR10","first-page":"73","volume-title":"14th ACM Symposium on Parallelism in Alorithms and Architectures (SPAA 2002)","author":"M.M. Michael","year":"2002","unstructured":"Michael, M.M.: High performance dynamic lock-free hash tables and list-based sets. In: 14th ACM Symposium on Parallelism in Alorithms and Architectures (SPAA 2002), pp. 73\u201382. ACM, New York (2002)"},{"key":"26_CR11","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)"},{"key":"26_CR12","volume-title":"The Design and Evolution of C++","author":"B. Stroustrup","year":"1994","unstructured":"Stroustrup, B.: The Design and Evolution of C++. ACM Press\/Addison-Wesley Publishing Co., New York (1994)"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y. Afek","year":"1993","unstructured":"Afek, Y., et al.: Atomic snapshots of shared memory. J. ACM\u00a040, 873\u2013890 (1993)","journal-title":"J. ACM"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Anderson, J.H.: Composite registers. In: Distributed Computing, pp. 15\u201330 (1993)","DOI":"10.1007\/BF02242703"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Platz, K., Mittal, N., Venkatesan, S.: Practical concurrent unrolled linked lists using lazy synchronization. Technical Report UTDCS-09-14, The University of Texas at Dallas Computer Science Department (2014)","DOI":"10.1007\/978-3-319-14472-6_26"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TPDS.2004.8","volume":"15","author":"M. Michael","year":"2004","unstructured":"Michael, M.: Hazard pointers: Safe memory reclamation for lock-free objects. IEEE Trans. Parallel Distrib. Syst.\u00a015, 491\u2013504 (2004)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"26_CR17","volume-title":"Computer Architecture: A Quantitative Approach","author":"J.L. Hennessy","year":"2011","unstructured":"Hennessy, J.L., Patterson, D.A.: Computer Architecture: A Quantitative Approach, 5th edn. Morgan Kaufmann Publishers Inc., San Francisco (2011)","edition":"5"},{"key":"26_CR18","volume-title":"Compilers: Principles, Techniques, and Tools","author":"A.V. Aho","year":"2006","unstructured":"Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools, 2nd edn. Addison-Wesley Longman Publishing Co., Inc., Boston (2006)","edition":"2"},{"key":"26_CR19","first-page":"51","volume-title":"17th ACM Symposium on Principles of Distributed Computing (PODC 1998)","author":"Y.J. Joung","year":"1998","unstructured":"Joung, Y.J.: Asynchronous group mutual exclusion (extended abstract). In: 17th ACM Symposium on Principles of Distributed Computing (PODC 1998), pp. 51\u201360. ACM, New York (1998)"},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1145\/1147954.1147958","volume":"53","author":"O. Shalev","year":"2006","unstructured":"Shalev, O., Shavit, N.: Split-ordered lists: Lock-free extensible hash tables. J. ACM\u00a053, 379\u2013405 (2006)","journal-title":"J. ACM"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-72951-8_11","volume-title":"Structural Information and Communication Complexity","author":"M.P. Herlihy","year":"2007","unstructured":"Herlihy, M.P., Lev, Y., Luchangco, V., Shavit, N.N.: A simple optimistic skiplist algorithm. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol.\u00a04474, pp. 124\u2013138. Springer, Heidelberg (2007)"},{"key":"26_CR22","unstructured":"Fraser, K.: Practical Lock-Freedom. PhD thesis, Kings College, University of Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14472-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T08:18:52Z","timestamp":1566116332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14472-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319144719","9783319144726"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14472-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}