{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:49:35Z","timestamp":1743032975706,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030863586"},{"type":"electronic","value":"9783030863593"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86359-3_29","type":"book-chapter","created":{"date-parts":[[2021,9,6]],"date-time":"2021-09-06T19:03:28Z","timestamp":1630955008000},"page":"386-401","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Concurrency for List-Based Sets"],"prefix":"10.1007","author":[{"given":"Vitaly","family":"Aksenov","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Gramoli","sequence":"additional","affiliation":[]},{"given":"Petr","family":"Kuznetsov","sequence":"additional","affiliation":[]},{"given":"Di","family":"Shang","sequence":"additional","affiliation":[]},{"given":"Srivatsan","family":"Ravi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,7]]},"reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-319-48314-6_10","volume-title":"Structural Information and Communication Complexity","author":"V Gramoli","year":"2016","unstructured":"Gramoli, V., Kuznetsov, P., Ravi, S.: In the search for optimal concurrency. In: Suomela, J. (ed.) SIROCCO 2016. LNCS, vol. 9988, pp. 143\u2013158. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48314-6_10"},{"key":"29_CR2","unstructured":"Sutter, H.: Choose concurrency-friendly data structures. Dr. Dobb\u2019s J. (2008)"},{"key":"29_CR3","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, W.N., Shavit, N.: A lazy concurrent list-based set algorithm. In: Anderson, J.H., Prencipe, G., Wattenhofer, R. (eds.) OPODIS 2005. LNCS, vol. 3974, pp. 3\u201316. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11795490_3"},{"key":"29_CR4","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann (2012)"},{"key":"29_CR5","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":"TL Harris","year":"2001","unstructured":"Harris, T.L.: A pragmatic implementation of non-blocking linked-lists. In: Welch, J. (ed.) DISC 2001. LNCS, vol. 2180, pp. 300\u2013314. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45414-4_21"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Michael, M.M.: High performance dynamic lock-free hash tables and list-based sets. In: SPAA, pp. 73\u201382 (2002)","DOI":"10.1145\/564870.564881"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapalka, M.: Principles of Transactional Memory, Synthesis Lectures on Distributed Computing Theory. Morgan and Claypool (2010)","DOI":"10.2200\/S00253ED1V01Y201009DCT004"},{"issue":"3","key":"29_CR8","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: 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":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/978-3-319-64203-1_42","volume-title":"Euro-Par 2017: Parallel Processing","author":"V Aksenov","year":"2017","unstructured":"Aksenov, V., Gramoli, V., Kuznetsov, P., Malova, A., Ravi, S.: A concurrency-optimal binary search tree. In: Rivera, F.F., Pena, T.F., Cabaleiro, J.C. (eds.) Euro-Par 2017. LNCS, vol. 10417, pp. 580\u2013593. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-64203-1_42"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Aksenov, V., Gramoli, V., Kuznetsov, P., Ravi, S., Shang, D.: A concurrency-optimal list-based set. CoRR abs\/1502.01633 (2021)","DOI":"10.1007\/978-3-030-86359-3_29"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Gramoli, V.: More than you ever wanted to know about synchronization: synchrobench, measuring the impact of the synchronization on concurrent algorithms. In: PPoPP, pp. 1\u201310 (2015)","DOI":"10.1145\/2858788.2688501"},{"key":"29_CR12","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann (1996)"},{"key":"29_CR13","unstructured":"Sun Microsystems: Memory Management in the Java HotSpot Virtual Machine, April 2006. http:\/\/www.oracle.com\/technetwork\/java\/javase\/memorymanagement-whitepaper-150215.pdf"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Fomitchev, M., Ruppert, E.: Lock-free linked lists and skip lists. In: PODC, pp. 50\u201359 (2004)","DOI":"10.1145\/1011767.1011776"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-662-48653-5_14","volume-title":"Distributed Computing","author":"J Gibson","year":"2015","unstructured":"Gibson, J., Gramoli, V.: Why non-blocking operations should be selfish. In: Moses, Y. (ed.) DISC 2015. LNCS, vol. 9363, pp. 200\u2013214. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48653-5_14"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Kung, H.T., Papadimitriou, C.H.: An optimality theory of concurrency control for databases. In: SIGMOD, pp. 116\u2013126 (1979)","DOI":"10.1145\/582095.582114"},{"issue":"1","key":"29_CR17","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/77643.77647","volume":"15","author":"M Herlihy","year":"1990","unstructured":"Herlihy, M.: Apologizing versus asking permission: optimistic concurrency control for abstract data types. ACM Trans. Database Syst. 15(1), 96\u2013124 (1990)","journal-title":"ACM Trans. Database Syst."},{"issue":"12","key":"29_CR18","doi-asserted-by":"publisher","first-page":"1488","DOI":"10.1109\/12.9728","volume":"37","author":"WE Weihl","year":"1988","unstructured":"Weihl, W.E.: Commutativity-based concurrency control for abstract data types. IEEE Trans. Comput. 37(12), 1488\u20131505 (1988)","journal-title":"IEEE Trans. Comput."},{"key":"29_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-87779-0_21","volume-title":"Distributed Computing","author":"R Guerraoui","year":"2008","unstructured":"Guerraoui, R., Henzinger, T.A., Singh, V.: Permissiveness in transactional memories. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 305\u2013319. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87779-0_21"},{"issue":"1","key":"29_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1142\/S0129626410000041","volume":"20","author":"V Gramoli","year":"2010","unstructured":"Gramoli, V., Harmanci, D., Felber, P.: On the input acceptance of transactional memory. Parallel Process. Lett. 20(1), 31\u201350 (2010)","journal-title":"Parallel Process. Lett."},{"key":"29_CR21","unstructured":"Haas, A., et al.: Local linearizability for concurrent container-type data structures. In: CONCUR 2016, vol. 59, pp. 6:1\u20136:15 (2016)"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"David, T., Guerraoui, R., Trigonakis, V.: Asynchronized concurrency: the secret to scaling concurrent search data structures. In: ASPLOS, pp. 631\u2013644 (2015)","DOI":"10.1145\/2775054.2694359"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86359-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T18:39:21Z","timestamp":1673203161000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86359-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030863586","9783030863593"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86359-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"7 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PaCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Computing Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kaliningrad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pact2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ssd.sscc.ru\/conference\/pact2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"MyReview (by Philippe Rigaux)","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}