{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:24:15Z","timestamp":1740108255176,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:00:00Z","timestamp":1641772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:00:00Z","timestamp":1641772800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"IMPRINT, GOI","award":["6918F"],"award-info":[{"award-number":["6918F"]}]},{"name":"Meity, GOI","award":["4(20)\/2019-ITEA"],"award-info":[{"award-number":["4(20)\/2019-ITEA"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00607-021-00994-y","type":"journal-article","created":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:03:16Z","timestamp":1641772996000},"page":"2159-2179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Achieving starvation-freedom in multi-version transactional memory systems"],"prefix":"10.1007","volume":"104","author":[{"given":"Ved Prakash","family":"Chaudhary","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chirag","family":"Juyal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandeep","family":"Kulkarni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2086-4549","authenticated-orcid":false,"given":"Sweta","family":"Kumari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sathya","family":"Peri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,10]]},"reference":[{"key":"994_CR1","doi-asserted-by":"crossref","unstructured":"Attiya H, Gotsman A, Hans S, Rinetzky N (2014) Safety of live transactions in transactional memory: TMS is necessary and sufficient. In: DISC, pp 376\u2013390","DOI":"10.1007\/978-3-662-45174-8_26"},{"key":"994_CR2","doi-asserted-by":"crossref","unstructured":"Bernstein PA, Goodman N (1983) Multiversion concurrency control: theory and algorithms. ACM Trans Database Syst","DOI":"10.1145\/800220.806699"},{"key":"994_CR3","doi-asserted-by":"crossref","unstructured":"Bushkov V, Guerraoui R (2015) Liveness in transactional memory pp Transactional Memory. Foundations, Algorithms, Tools, and Applications, pp 32\u201349","DOI":"10.1007\/978-3-319-14720-8_2"},{"key":"994_CR4","doi-asserted-by":"crossref","unstructured":"Bushkov V, Guerraoui R, Kapalka M (2012) On the liveness of transactional memory. In: ACM symposium on PODC 2012","DOI":"10.1145\/2332432.2332435"},{"key":"994_CR5","unstructured":"Chaudhary VP, Juyal C, Kulkarni SS, Kumari S, Peri S (2017) Starvation freedom in multi-version transactional memory systems. CoRR arXiv:1709.01033"},{"key":"994_CR6","doi-asserted-by":"crossref","unstructured":"Chaudhary VP, Juyal C, Kulkarni SS, Kumari S, Peri S (2019) Achieving starvation-freedom in multi-version transactional memory systems. In: NETYS","DOI":"10.1007\/978-3-030-31277-0_20"},{"key":"994_CR7","doi-asserted-by":"crossref","unstructured":"Crain T, Imbs D, Raynal M (2011) Read invisibility, virtual world consistency and probabilistic permissiveness are compatible. In: ICA3PP","DOI":"10.1007\/978-3-642-24650-0_21"},{"key":"994_CR8","doi-asserted-by":"crossref","unstructured":"Dalessandro L, Spear MF, Scott ML (2010) NOrec: streamlining STM by abolishing ownership records. PPoPP 2010","DOI":"10.1145\/1693453.1693464"},{"key":"994_CR9","doi-asserted-by":"crossref","unstructured":"Doherty S, Groves L, Luchangco V, Moir M (2009) Towards formally specifying and verifying transactional memory. In: REFINE","DOI":"10.1016\/j.entcs.2010.01.001"},{"issue":"C","key":"994_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.jpdc.2016.10.010","volume":"100(C):103\u2013127","author":"P Felber","year":"2017","unstructured":"Felber P, Gramoli V, Guerraoui R (2017) Elastic transactions. J Parallel Distrib Comput 100(C):103\u2013127(C):103\u2013127","journal-title":"J Parallel Distrib Comput"},{"key":"994_CR11","doi-asserted-by":"crossref","unstructured":"Fernandes SM, Cachopo J (2011) Lock-free and scalable multi-version software transactional memory. PPoPP 2011","DOI":"10.1145\/1941553.1941579"},{"key":"994_CR12","doi-asserted-by":"crossref","unstructured":"Gramoli V, Guerraoui R, Trigonakis V (2012) TM2C: a software transactional memory for many-cores. EuroSys 2012","DOI":"10.1145\/2168836.2168872"},{"key":"994_CR13","doi-asserted-by":"crossref","unstructured":"Guerraoui R, Kapalka M (2008) On the correctness of transactional memory. In: PPoPP 2008","DOI":"10.1145\/1345206.1345233"},{"key":"994_CR14","doi-asserted-by":"crossref","unstructured":"Guerraoui R, Kapalka M (2010) Principles of transactional memory. Synthesis lectures on distributed computing theory, Morgan and Claypool","DOI":"10.2200\/S00253ED1V01Y201009DCT004"},{"key":"994_CR15","doi-asserted-by":"crossref","unstructured":"Guerraoui R, Henzinger T, Singh V (2008) Permissiveness in transactional memories. In: DISC 2008","DOI":"10.1145\/1375581.1375626"},{"key":"994_CR16","doi-asserted-by":"crossref","unstructured":"Herlihy M, BMoss JE (1993) Transactional memory: architectural support for lock-free data structures. SIGARCH Comput Archit News 21(2)","DOI":"10.1145\/173682.165164"},{"key":"994_CR17","doi-asserted-by":"crossref","unstructured":"Herlihy M, Shavit N (2011) On the nature of progress. OPODIS 2011","DOI":"10.1007\/978-3-642-25873-2_22"},{"key":"994_CR18","volume-title":"The art of multiprocessor programming, revised reprint","author":"M Herlihy","year":"2012","unstructured":"Herlihy M, Shavit N (2012) The art of multiprocessor programming, revised reprint, 1st edn. Morgan Kaufmann Publishers Inc., San Francisco","edition":"1"},{"key":"994_CR19","doi-asserted-by":"crossref","unstructured":"Herlihy MP, Wing JM (1990) Linearizability: a correctness condition for concurrent objects. ACM Trans Program Lang Syst 12(3)","DOI":"10.1145\/78969.78972"},{"key":"994_CR20","doi-asserted-by":"crossref","unstructured":"Kumar P, Peri S, Vidyasankar K (2014) A TimeStamp based multi-version STM algorithm. In: ICDCN, pp 212\u2013226","DOI":"10.1007\/978-3-642-45249-9_14"},{"key":"994_CR21","doi-asserted-by":"crossref","unstructured":"Kuznetsov P, Peri S (2014) Non-interference and local correctness in transactional memory. In: ICDCN, pp 197\u2013211","DOI":"10.1007\/978-3-642-45249-9_13"},{"key":"994_CR22","doi-asserted-by":"crossref","unstructured":"Kuznetsov P, Peri S (2017) Non-interference and local correctness in transactional memory. Theor Comput Sci 688","DOI":"10.1016\/j.tcs.2016.06.021"},{"key":"994_CR23","doi-asserted-by":"crossref","unstructured":"Lu L, Scott ML (2013) Generic multiversion STM. In: DISC 2013","DOI":"10.1186\/1687-1847-2013-27"},{"key":"994_CR24","unstructured":"Minh CC, Chung J, Kozyrakis C, Olukotun K (2008) STAMP: stanford transactional applications for multi-processing. In: IISWC 2008"},{"key":"994_CR25","doi-asserted-by":"crossref","unstructured":"Papadimitriou CH (1979) The serializability of concurrent database updates. J ACM 26(4)","DOI":"10.1145\/322154.322158"},{"key":"994_CR26","doi-asserted-by":"crossref","unstructured":"Perelman D, Byshevsky A, Litmanovich O, Keidar I (2011) SMV: selective multi-versioning STM. In: DISC, pp 125\u2013140","DOI":"10.1007\/978-3-642-24100-0_9"},{"key":"994_CR27","doi-asserted-by":"crossref","unstructured":"Riegel T, Felber P, Fetzer C (2006) A lazy snapshot algorithm with eager validation. In: DISC 2006","DOI":"10.1007\/11864219_20"},{"key":"994_CR28","doi-asserted-by":"crossref","unstructured":"Shavit N, Touitou D (1995) Software transactional memory. In: PODC","DOI":"10.1145\/224964.224987"},{"key":"994_CR29","doi-asserted-by":"crossref","unstructured":"Spear MF, Dalessandro L, Marathe VJ, Scott ML (2009) A comprehensive strategy for contention management in software transactional memory. PPoPP","DOI":"10.1145\/1504176.1504199"},{"key":"994_CR30","doi-asserted-by":"crossref","unstructured":"Waliullah MM, Stenstr\u00f6m P (2009) Schemes for avoiding starvation in transactional memory systems. Practice and experience, concurrency and computation","DOI":"10.1002\/cpe.1363"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-021-00994-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-021-00994-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-021-00994-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,15]],"date-time":"2022-09-15T18:14:46Z","timestamp":1663265686000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-021-00994-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,10]]},"references-count":30,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["994"],"URL":"https:\/\/doi.org\/10.1007\/s00607-021-00994-y","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2022,1,10]]},"assertion":[{"value":"20 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}