{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T12:45:03Z","timestamp":1726058703516},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030349912"},{"type":"electronic","value":"9783030349929"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34992-9_17","type":"book-chapter","created":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T18:02:48Z","timestamp":1573754568000},"page":"209-227","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Achieving Starvation-Freedom with Greater Concurrency in Multi-Version Object-based Transactional Memory Systems"],"prefix":"10.1007","author":[{"given":"Chirag","family":"Juyal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandeep","family":"Kulkarni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sweta","family":"Kumari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sathya","family":"Peri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Archit","family":"Somani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,14]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapalka, M.: On the correctness of transactional memory. In: PPoPP (2008)","DOI":"10.1145\/1345206.1345233"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.tcs.2016.06.021","volume":"688","author":"Petr Kuznetsov","year":"2017","unstructured":"Kuznetsov, P., Peri, S.: Non-interference and local correctness in transactional memory. Theor. Comput. Sci. 688, 103\u2013116 (2017)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1145\/322154.322158","volume":"26","author":"Christos H. Papadimitriou","year":"1979","unstructured":"Papadimitriou, C.H.: The serializability of concurrent database updates. J. ACM 26(4), 631\u2013653 (1979)","journal-title":"Journal of the ACM"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Koskinen, E.: Transactional boosting: a methodology for highly-concurrent transactional objects. In: PPOPP (2008)","DOI":"10.1145\/1345206.1345237"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Hassan, A., Palmieri, R., Ravindran, B.: Optimistic transactional boosting. In: PPoPP (2014)","DOI":"10.1145\/2555243.2555283"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Peri, S., Singh, A., Somani, A.: Efficient means of achieving composability using transactional memory. In: NETYS 2018 (2018)","DOI":"10.1007\/978-3-030-05529-5_11"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/B978-155860508-4\/50005-3","volume-title":"Transactional Information Systems","author":"Gerhard Weikum","year":"2002","unstructured":"Weikum, G., Vossen, G.: Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery. Morgan Kaufmann, Burlington (2002)"},{"key":"17_CR8","volume-title":"The Art of Multiprocessor Programming, Revised Reprint","author":"M Herlihy","year":"2012","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming, Revised Reprint, 1st edn. Morgan Kaufmann Publishers Inc., San Francisco (2012)","edition":"1"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-030-31277-0_20","volume-title":"Networked Systems","author":"VP Chaudhary","year":"2019","unstructured":"Chaudhary, V.P., Juyal, C., Kulkarni, S., Kumari, S., Peri, S.: Achieving starvation-freedom in multi-version transactional memory systems. In: Atig, M.F., Schwarzmann, A.A. (eds.) NETYS 2019. LNCS, vol. 11704, pp. 291\u2013310. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-31277-0_20"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Bushkov, V., Guerraoui, R., Kapalka, M.: On the liveness of transactional memory. In: PODC 2012 (2012)","DOI":"10.1145\/2332432.2332435"},{"key":"17_CR11","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. 7109, pp. 313\u2013328. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-25873-2_22"},{"key":"17_CR12","volume-title":"Principles of Transactional Memory, Synthesis Lectures on Distributed Computing Theory","author":"R Guerraoui","year":"2010","unstructured":"Guerraoui, R., Kapalka, M.: Principles of Transactional Memory, Synthesis Lectures on Distributed Computing Theory. Morgan and Claypool, San Rafael (2010)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Gramoli, V., Guerraoui, R., Trigonakis, V.: TM2C: a software transactional memory for many-cores. In: EuroSys 2012 (2012)","DOI":"10.1145\/2168836.2168872"},{"issue":"7","key":"17_CR14","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1002\/cpe.1363","volume":"21","author":"M. M. Waliullah","year":"2009","unstructured":"Waliullah, M.M., Stenstr\u00f6m, P.: Schemes for avoiding starvation in transactional memory systems. Practice Exp. Concurr. Comput. 21, 859\u2013873 (2009)","journal-title":"Concurrency and Computation: Practice and Experience"},{"issue":"4","key":"17_CR15","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1145\/1594835.1504199","volume":"44","author":"Michael F. Spear","year":"2009","unstructured":"Spear, M.F., Dalessandro, L., Marathe, V.J., Scott, M.L.: A comprehensive strategy for contention management in software transactional memory (2009)","journal-title":"ACM SIGPLAN Notices"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-642-45249-9_14","volume-title":"Distributed Computing and Networking","author":"P Kumar","year":"2014","unstructured":"Kumar, P., Peri, S., Vidyasankar, K.: A timestamp based multi-version STM algorithm. In: Chatterjee, M., Cao, J., Kothapalli, K., Rajsbaum, S. (eds.) ICDCN 2014. LNCS, vol. 8314, pp. 212\u2013226. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-642-45249-9_14"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-41527-2_10","volume-title":"Distributed Computing","author":"L Lu","year":"2013","unstructured":"Lu, L., Scott, M.L.: Generic multiversion STM. In: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 134\u2013148. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-41527-2_10"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Fernandes, S.M., Cachopo, J.: Lock-free and scalable multi-version software transactional memory. In: PPoPP 2011, New York, NY, USA (2011)","DOI":"10.1145\/1941553.1941579"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-24100-0_9","volume-title":"Distributed Computing","author":"D Perelman","year":"2011","unstructured":"Perelman, D., Byshevsky, A., Litmanovich, O., Keidar, I.: SMV: selective multi-versioning STM. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 125\u2013140. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-24100-0_9"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-030-03232-6_19","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"C Juyal","year":"2018","unstructured":"Juyal, C., Kulkarni, S., Kumari, S., Peri, S., Somani, A.: An innovative approach to achieve compositionality efficiently using multi-version object based transactional systems. In: Izumi, T., Kuznetsov, P. (eds.) SSS 2018. LNCS, vol. 11201, pp. 284\u2013300. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-030-03232-6_19"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.jpdc.2016.10.010","volume":"100","author":"Pascal Felber","year":"2017","unstructured":"Felber, P., Gramoli, V., Guerraoui, R.: Elastic transactions. J. Parallel Distrib. Comput. 100, 103\u2013127 (2017)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, D., Dechev, D.: Lock-free transactions without rollbacks for linked data structures. In: SPAA 2016, New York, NY, USA (2016)","DOI":"10.1145\/2935764.2935780"},{"issue":"5","key":"17_CR23","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: Govindarajan, R., Padua, D.A., Hall, M.W. (eds.) PPOPP. ACM (2010)","journal-title":"ACM SIGPLAN Notices"},{"key":"17_CR24","unstructured":"Juyal, C., Kulkarni, S.S., Kumari, S., Peri, S., Somani, A.: Obtaining progress guarantee and greater concurrency in multi-version object semantics. CoRR abs\/1904.03700 (2019)"},{"issue":"04","key":"17_CR25","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1142\/S0129626407003125","volume":"17","author":"STEVE HELLER","year":"2007","unstructured":"Heller, S., Herlihy, M., Luchangco, V., Moir, M., III, W.N.S., Shavit, N.: A lazy concurrent list-based set algorithm. Parallel Process. Lett. 17(4), 411\u2013424 (2007)","journal-title":"Parallel Processing Letters"},{"key":"17_CR26","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). \nhttps:\/\/doi.org\/10.1007\/3-540-45414-4_21"},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/11864219_20","volume-title":"Distributed Computing","author":"T Riegel","year":"2006","unstructured":"Riegel, T., Felber, P., Fetzer, C.: A lazy snapshot algorithm with eager validation. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 284\u2013298. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11864219_20"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Henzinger, T.A., Singh, V.: Permissiveness in transactional memories. In: DISC, pp. 305\u2013319 (2008)","DOI":"10.1007\/978-3-540-87779-0_21"},{"key":"17_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-24650-0_21","volume-title":"Algorithms and Architectures for Parallel Processing","author":"T Crain","year":"2011","unstructured":"Crain, T., Imbs, D., Raynal, M.: Read invisibility, virtual world consistency and probabilistic permissiveness are compatible. In: Xiang, Y., Cuzzocrea, A., Hobbs, M., Zhou, W. (eds.) ICA3PP 2011. LNCS, vol. 7016, pp. 244\u2013257. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-24650-0_21"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34992-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T18:33:44Z","timestamp":1573756424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34992-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030349912","9783030349929"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34992-9_17","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":"14 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"22 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sss2019.lip6.fr\/symp\/sss2019\/","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":"45","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":"21","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":"7","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":"47% - 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":"3.3","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":"2.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)"}}]}}