{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:37:43Z","timestamp":1763415463004,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030224950"},{"type":"electronic","value":"9783030224967"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-22496-7_2","type":"book-chapter","created":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T13:02:34Z","timestamp":1559739754000},"page":"19-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Check-Wait-Pounce: Increasing Transactional Data Structure Throughput by Delaying Transactions"],"prefix":"10.1007","author":[{"given":"Lance","family":"Lebanoff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christina","family":"Peterson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damian","family":"Dechev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,6]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-540-92990-1_3","volume-title":"High Performance Embedded Architectures and Compilers","author":"M Ansari","year":"2009","unstructured":"Ansari, M., Luj\u00e1n, M., Kotselidis, C., Jarvis, K., Kirkham, C., Watson, I.: Steal-on-abort: improving transactional memory performance through dynamic transaction reordering. In: Seznec, A., Emer, J., O\u2019Boyle, M., Martonosi, M., Ungerer, T. (eds.) HiPEAC 2009. LNCS, vol. 5409, pp. 4\u201318. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-92990-1_3"},{"issue":"2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.scico.2006.05.009","volume":"63","author":"J Cachopo","year":"2006","unstructured":"Cachopo, J., Rito-Silva, A.: Versioned boxes as the basis for memory transactions. Sci. Comput. Program. 63(2), 172\u2013185 (2006)","journal-title":"Sci. Comput. Program."},{"issue":"5","key":"2_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/1837853.1693464","volume":"45","author":"Luke Dalessandro","year":"2010","unstructured":"Dalessandro, L., Spear, M.F., Scott, M.L.: NOrec: streamlining STM by abolishing ownership records. In: ACM Sigplan Notices, no. 5. ACM (2010)","journal-title":"ACM SIGPLAN Notices"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Diegues, N., Romano, P.: Time-warp: lightweight abort minimization in transactional memory. In: Symposium on Principles and Practice of Parallel Programming (2014)","DOI":"10.1145\/2555243.2555259"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Ellen, F., Fatourou, P., Ruppert, E., van Breugel, F.: Non-blocking binary search trees. In: Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 131\u2013140. ACM (2010)","DOI":"10.1145\/1835698.1835736"},{"key":"2_CR6","unstructured":"Fraser, K.: Practical lock-freedom. Ph.D. thesis, Cambridge University Computer Laboratory (2003). Also available as Technical report UCAM-CL-TR-579 (2004)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Golan-Gueta, G., Ramalingam, G., Sagiv, M., Yahav, E.: Automatic scalable atomicity via semantic locking. In: Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 31\u201341. ACM (2015)","DOI":"10.1145\/2688500.2688511"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Gramoli, V., Guerraoui, R., Letia, M.: Composing relaxed transactions. In: Parallel & Distributed Processing (IPDPS), pp. 1171\u20131182. IEEE (2013)","DOI":"10.1109\/IPDPS.2013.42"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-319-14472-6_29","volume-title":"Principles of Distributed Systems","author":"A Hassan","year":"2014","unstructured":"Hassan, A., Palmieri, R., Ravindran, B.: On developing optimistic transactional lazy set. In: Aguilera, M.K., Querzoni, L., Shapiro, M. (eds.) OPODIS 2014. LNCS, vol. 8878, pp. 437\u2013452. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-14472-6_29"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Koskinen, E.: Transactional boosting: a methodology for highly-concurrent transactional objects. In: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming, pp. 207\u2013216. ACM (2008)","DOI":"10.1145\/1345206.1345237"},{"key":"2_CR11","volume-title":"The Art of Multiprocessor Programming","author":"M Herlihy","year":"2011","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann, Burlington (2011)"},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1707801.1706304","volume":"45","author":"E Koskinen","year":"2010","unstructured":"Koskinen, E., Parkinson, M., Herlihy, M.: Coarse-grained transactions. ACM Sigplan Not. 45(1), 19\u201330 (2010)","journal-title":"ACM Sigplan Not."},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-319-03850-6_15","volume-title":"Principles of Distributed Systems","author":"J Lind\u00e9n","year":"2013","unstructured":"Lind\u00e9n, J., Jonsson, B.: A skiplist-based concurrent priority queue with minimal memory contention. In: Baldoni, R., Nisse, N., van Steen, M. (eds.) OPODIS 2013. LNCS, vol. 8304, pp. 206\u2013220. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03850-6_15"},{"issue":"4","key":"2_CR14","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1145\/322154.322158","volume":"26","author":"CH Papadimitriou","year":"1979","unstructured":"Papadimitriou, C.H.: The serializability of concurrent database updates. J. ACM (JACM) 26(4), 631\u2013653 (1979)","journal-title":"J. ACM (JACM)"},{"key":"2_CR15","unstructured":"Pedone, F., Guerraoui, R., Schiper, A.: Transaction reordering in replicated databases. In: Proceedings of the IEEE Symposium on Reliable Distributed Systems, pp. 175\u2013182 (1997)"},{"issue":"6","key":"2_CR16","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1145\/2980983.2908112","volume":"51","author":"Alexander Spiegelman","year":"2016","unstructured":"Spiegelman, A., Golan-Gueta, G., Keidar, I.: Transactional data structure libraries. In: Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 682\u2013696. ACM (2016)","journal-title":"ACM SIGPLAN Notices"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Zhang, D., Dechev, D.: An efficient lock-free logarithmic search data structure based on multi-dimensional list. In: 2016 IEEE 36th International Conference on Distributed Computing Systems (ICDCS), pp. 281\u2013292, June 2016. https:\/\/doi.org\/10.1109\/ICDCS.2016.19","DOI":"10.1109\/ICDCS.2016.19"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, D., Dechev, D.: Lock-free transactions without rollbacks for linked data structures. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, pp. 325\u2013336. ACM, New York (2016)","DOI":"10.1145\/2935764.2935780"}],"container-title":["Lecture Notes in Computer Science","Distributed Applications and Interoperable Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22496-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T00:02:10Z","timestamp":1685923330000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22496-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030224950","9783030224967"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22496-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DAIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Distributed Applications and Interoperable Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kongens Lyngby","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dais2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2019\/dais","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","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":"9","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":"2","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":"32% - 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":"4","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","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}