Achieving starvation-freedom in multi-version transactional memory systems

Software Transactional Memory systems (STMs) have garnered significant interest as an elegant alternative for addressing synchronization and concurrency issues with multi-threaded programming in multi-core systems. Client programs use STMs by issuing transactions. STM ensures that transaction either...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computing Ročník 104; číslo 10; s. 2159 - 2179
Hlavní autori:	Chaudhary, Ved Prakash, Juyal, Chirag, Kulkarni, Sandeep, Kumari, Sweta, Peri, Sathya
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Vienna Springer Vienna 01.10.2022 Springer Nature B.V
Predmet:	Algorithms Artificial Intelligence Computer Appl. in Administrative Data Processing Computer Communication Networks Computer memory Computer Science Concurrency Concurrency control Concurrent processing Garbage collection Information Systems Applications (incl.Internet) Sanitation services Software Software Engineering Special Issue Article Synchronism Software transactional memory system Multi-version 68W15 Distributed algorithms Local opacity 68W10 Parallel algorithms in computer science Starvation-freedom Concurrency control Opacity
ISSN:	0010-485X, 1436-5057
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	Software Transactional Memory systems (STMs) have garnered significant interest as an elegant alternative for addressing synchronization and concurrency issues with multi-threaded programming in multi-core systems. Client programs use STMs by issuing transactions. STM ensures that transaction either commits or aborts. A transaction aborted due to conflicts is typically re-issued with the expectation that it will complete successfully in a subsequent incarnation. However, many existing STMs fail to provide starvation freedom, i.e., in these systems, it is possible that concurrency conflicts may prevent an incarnated transaction from committing. To overcome this limitation, we systematically derive a novel starvation free algorithm for multi-version STM. Our algorithm can be used either with the case where the number of versions is unbounded and garbage collection is used or where only the latest K versions are maintained, KSFTM. We have demonstrated that our proposed algorithm performs better than existing state-of-the-art STMs.
AbstractList	Software Transactional Memory systems (STMs) have garnered significant interest as an elegant alternative for addressing synchronization and concurrency issues with multi-threaded programming in multi-core systems. Client programs use STMs by issuing transactions. STM ensures that transaction either commits or aborts. A transaction aborted due to conflicts is typically re-issued with the expectation that it will complete successfully in a subsequent incarnation. However, many existing STMs fail to provide starvation freedom, i.e., in these systems, it is possible that concurrency conflicts may prevent an incarnated transaction from committing. To overcome this limitation, we systematically derive a novel starvation free algorithm for multi-version STM. Our algorithm can be used either with the case where the number of versions is unbounded and garbage collection is used or where only the latest K versions are maintained, KSFTM. We have demonstrated that our proposed algorithm performs better than existing state-of-the-art STMs. Software Transactional Memory systems (STMs) have garnered significant interest as an elegant alternative for addressing synchronization and concurrency issues with multi-threaded programming in multi-core systems. Client programs use STMs by issuing transactions. STM ensures that transaction either commits or aborts. A transaction aborted due to conflicts is typically re-issued with the expectation that it will complete successfully in a subsequent incarnation. However, many existing STMs fail to provide starvation freedom, i.e., in these systems, it is possible that concurrency conflicts may prevent an incarnated transaction from committing. To overcome this limitation, we systematically derive a novel starvation free algorithm for multi-version STM. Our algorithm can be used either with the case where the number of versions is unbounded and garbage collection is used or where only the latest K versions are maintained, KSFTM. We have demonstrated that our proposed algorithm performs better than existing state-of-the-art STMs.
Author	Kulkarni, Sandeep Peri, Sathya Chaudhary, Ved Prakash Juyal, Chirag Kumari, Sweta
Author_xml	– sequence: 1 givenname: Ved Prakash surname: Chaudhary fullname: Chaudhary, Ved Prakash organization: Department of CSE, Indian Institute of Technology – sequence: 2 givenname: Chirag surname: Juyal fullname: Juyal, Chirag organization: Department of CSE, Indian Institute of Technology – sequence: 3 givenname: Sandeep surname: Kulkarni fullname: Kulkarni, Sandeep organization: Department of Computer Science, Michigan State University – sequence: 4 givenname: Sweta orcidid: 0000-0002-2086-4549 surname: Kumari fullname: Kumari, Sweta email: sweta@cs.technion.ac.il organization: Department of Computer Science, Technion – sequence: 5 givenname: Sathya surname: Peri fullname: Peri, Sathya organization: Department of CSE, Indian Institute of Technology
BookMark	eNp9kMFKw0AQhhepYFt9AU8Bz6uzm2R3cyxFrVLwouBt2cTZmtJs6k5ayNubGsGbpxmY7_8ZvhmbhDYgY9cCbgWAviMABZqDFBygKDLen7GpyFLFc8j1hE0BBPDM5O8XbEa0BQCZmmLKnhfVZ43HOmwS6lw8uq5uA_cR8aNtkjokzWHX1fyIkYZD0kUXyFUnyO2SBps29gn11GFDl-zcux3h1e-cs7eH-9fliq9fHp-WizWvpIaOq8qgRqU9FOh1WXgBxsGwaIWqKI2QXqMvM1VhKbxRSlTOmFLmUpRFKVQ6Zzdj7z62Xwekzm7bQxz-ISu1yPIU8hwGSo5UFVuiiN7uY9242FsB9uTMjs7s4Mz-OLP9EErHEA1w2GD8q_4n9Q29QXLR
Cites_doi	10.1145/2332432.2332435 10.1145/1345206.1345233 10.1145/800220.806699 10.1145/1693453.1693464 10.1145/1375581.1375626 10.1145/2168836.2168872 10.1002/cpe.1363 10.1145/1941553.1941579 10.1007/978-3-642-45249-9_14 10.1007/978-3-642-24100-0_9 10.1145/322154.322158 10.1007/978-3-642-25873-2_22 10.1007/978-3-642-24650-0_21 10.1145/173682.165164 10.1016/j.tcs.2016.06.021 10.1007/978-3-662-45174-8_26 10.1186/1687-1847-2013-27 10.1007/978-3-319-14720-8_2 10.1016/j.entcs.2010.01.001 10.1145/78969.78972 10.1016/j.jpdc.2016.10.010 10.1007/11864219_20 10.1145/1504176.1504199 10.1007/978-3-030-31277-0_20 10.2200/S00253ED1V01Y201009DCT004 10.1145/224964.224987 10.1007/978-3-642-45249-9_13
ContentType	Journal Article
Copyright	The Author(s), under exclusive licence to Springer-Verlag GmbH Austria, part of Springer Nature 2021 The Author(s), under exclusive licence to Springer-Verlag GmbH Austria, part of Springer Nature 2021.
Copyright_xml	– notice: The Author(s), under exclusive licence to Springer-Verlag GmbH Austria, part of Springer Nature 2021 – notice: The Author(s), under exclusive licence to Springer-Verlag GmbH Austria, part of Springer Nature 2021.
DBID	AAYXX CITATION 3V. 7SC 7WY 7WZ 7XB 87Z 8AL 8AO 8FD 8FE 8FG 8FK 8FL 8G5 ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG F~G GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- L.- L7M L~C L~D M0C M0N M2O MBDVC P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI Q9U
DOI	10.1007/s00607-021-00994-y
DatabaseName	CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) Research Library ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Business Premium Collection Technology Collection ProQuest One Community College ProQuest Central Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student Research Library Prep SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ABI/INFORM Professional Advanced Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ABI/INFORM Global (OCUL) Computing Database Research Library Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Business (UW System Shared) ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central Basic
DatabaseTitle	CrossRef ABI/INFORM Global (Corporate) ProQuest Business Collection (Alumni Edition) ProQuest One Business Research Library Prep Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College Research Library (Alumni Edition) ProQuest Pharma Collection ABI/INFORM Complete ProQuest Central ABI/INFORM Professional Advanced ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Research Library ProQuest Central (New) Advanced Technologies Database with Aerospace ABI/INFORM Complete (Alumni Edition) Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection ProQuest Business Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition ProQuest One Business (Alumni) ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) Business Premium Collection (Alumni)
DatabaseTitleList	ABI/INFORM Global (Corporate)
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Mathematics Computer Science
EISSN	1436-5057
EndPage	2179
ExternalDocumentID	10_1007_s00607_021_00994_y
GrantInformation_xml	– fundername: IMPRINT, GOI grantid: 6918F – fundername: Meity, GOI grantid: 4(20)/2019-ITEA
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 2.D 203 28- 29F 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 6TJ 78A 7WY 8AO 8FE 8FG 8FL 8G5 8TC 8UJ 8VB 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACUHS ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMOZ AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFFNX AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHQJS AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ AKVCP ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN AZQEC B-. B0M BA0 BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BKOMP BPHCQ BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DWQXO EAD EAP EBA EBLON EBR EBS EBU ECS EDO EIOEI EJD EMK EPL ESBYG EST ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GROUPED_ABI_INFORM_COMPLETE GUQSH GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ ITG ITH ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K1G K60 K6V K6~ K7- KDC KOV KOW LAS LLZTM M0C M0N M2O M4Y MA- MK~ ML~ N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9O PF0 PQBIZ PQBZA PQQKQ PROAC PT4 PT5 Q2X QOK QOS QWB R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TH9 TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7X Z7Z Z81 Z83 Z88 Z8M Z8N Z8R Z8T Z8U Z8W Z92 ZL0 ZMTXR ~8M ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFKWF AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L.- L7M L~C L~D MBDVC PKEHL PQEST PQUKI Q9U
ID	FETCH-LOGICAL-c270t-6c8e7e67f09ef7b9f108a07b976e69b812f7efb46ceb1f8661ca88b2521b9b163
IEDL.DBID	M0C
ISICitedReferencesCount	0
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000740648900004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0010-485X
IngestDate	Wed Nov 26 14:42:35 EST 2025 Sat Nov 29 03:51:39 EST 2025 Fri Feb 21 02:46:07 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	10
Keywords	Software transactional memory system Multi-version 68W15 Distributed algorithms Local opacity 68W10 Parallel algorithms in computer science Starvation-freedom Concurrency control Opacity
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c270t-6c8e7e67f09ef7b9f108a07b976e69b812f7efb46ceb1f8661ca88b2521b9b163
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-2086-4549
PQID	2714530550
PQPubID	48322
PageCount	21
ParticipantIDs	proquest_journals_2714530550 crossref_primary_10_1007_s00607_021_00994_y springer_journals_10_1007_s00607_021_00994_y
PublicationCentury	2000
PublicationDate	20221000 2022-10-00 20221001
PublicationDateYYYYMMDD	2022-10-01
PublicationDate_xml	– month: 10 year: 2022 text: 20221000
PublicationDecade	2020
PublicationPlace	Vienna
PublicationPlace_xml	– name: Vienna – name: Wien
PublicationTitle	Computing
PublicationTitleAbbrev	Computing
PublicationYear	2022
Publisher	Springer Vienna Springer Nature B.V
Publisher_xml	– name: Springer Vienna – name: Springer Nature B.V
References	Papadimitriou CH (1979) The serializability of concurrent database updates. J ACM 26(4) Dalessandro L, Spear MF, Scott ML (2010) NOrec: streamlining STM by abolishing ownership records. PPoPP 2010 Bernstein PA, Goodman N (1983) Multiversion concurrency control: theory and algorithms. ACM Trans Database Syst Guerraoui R, Kapalka M (2008) On the correctness of transactional memory. In: PPoPP 2008 Kuznetsov P, Peri S (2017) Non-interference and local correctness in transactional memory. Theor Comput Sci 688 Crain T, Imbs D, Raynal M (2011) Read invisibility, virtual world consistency and probabilistic permissiveness are compatible. In: ICA3PP Chaudhary VP, Juyal C, Kulkarni SS, Kumari S, Peri S (2019) Achieving starvation-freedom in multi-version transactional memory systems. In: NETYS Doherty S, Groves L, Luchangco V, Moir M (2009) Towards formally specifying and verifying transactional memory. In: REFINE Herlihy M, Shavit N (2011) On the nature of progress. OPODIS 2011 Guerraoui R, Kapalka M (2010) Principles of transactional memory. Synthesis lectures on distributed computing theory, Morgan and Claypool Fernandes SM, Cachopo J (2011) Lock-free and scalable multi-version software transactional memory. PPoPP 2011 Lu L, Scott ML (2013) Generic multiversion STM. In: DISC 2013 Shavit N, Touitou D (1995) Software transactional memory. In: PODC Bushkov V, Guerraoui R (2015) Liveness in transactional memory pp Transactional Memory. Foundations, Algorithms, Tools, and Applications, pp 32–49 Riegel T, Felber P, Fetzer C (2006) A lazy snapshot algorithm with eager validation. In: DISC 2006 Chaudhary VP, Juyal C, Kulkarni SS, Kumari S, Peri S (2017) Starvation freedom in multi-version transactional memory systems. CoRR arXiv:1709.01033 Minh CC, Chung J, Kozyrakis C, Olukotun K (2008) STAMP: stanford transactional applications for multi-processing. In: IISWC 2008 Kumar P, Peri S, Vidyasankar K (2014) A TimeStamp based multi-version STM algorithm. In: ICDCN, pp 212–226 Waliullah MM, Stenström P (2009) Schemes for avoiding starvation in transactional memory systems. Practice and experience, concurrency and computation 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–390 Perelman D, Byshevsky A, Litmanovich O, Keidar I (2011) SMV: selective multi-versioning STM. In: DISC, pp 125–140 Gramoli V, Guerraoui R, Trigonakis V (2012) TM2C: a software transactional memory for many-cores. EuroSys 2012 Guerraoui R, Henzinger T, Singh V (2008) Permissiveness in transactional memories. In: DISC 2008 Herlihy MP, Wing JM (1990) Linearizability: a correctness condition for concurrent objects. ACM Trans Program Lang Syst 12(3) HerlihyMShavitNThe art of multiprocessor programming, revised reprint20121San FranciscoMorgan Kaufmann Publishers Inc. Bushkov V, Guerraoui R, Kapalka M (2012) On the liveness of transactional memory. In: ACM symposium on PODC 2012 Herlihy M, BMoss JE (1993) Transactional memory: architectural support for lock-free data structures. SIGARCH Comput Archit News 21(2) Kuznetsov P, Peri S (2014) Non-interference and local correctness in transactional memory. In: ICDCN, pp 197–211 Spear MF, Dalessandro L, Marathe VJ, Scott ML (2009) A comprehensive strategy for contention management in software transactional memory. PPoPP FelberPGramoliVGuerraouiRElastic transactionsJ Parallel Distrib Comput2017100(C):103–127C10312710.1016/j.jpdc.2016.10.010 994_CR24 994_CR25 994_CR26 994_CR27 994_CR20 994_CR21 994_CR22 994_CR23 P Felber (994_CR10) 2017; 100(C):103–127 994_CR17 994_CR19 994_CR13 994_CR14 994_CR15 994_CR16 994_CR11 994_CR1 994_CR12 994_CR2 994_CR3 994_CR4 994_CR5 994_CR30 994_CR6 994_CR7 994_CR8 994_CR9 M Herlihy (994_CR18) 2012 994_CR28 994_CR29
References_xml	– reference: 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–390 – reference: Bernstein PA, Goodman N (1983) Multiversion concurrency control: theory and algorithms. ACM Trans Database Syst – reference: Guerraoui R, Henzinger T, Singh V (2008) Permissiveness in transactional memories. In: DISC 2008 – reference: Minh CC, Chung J, Kozyrakis C, Olukotun K (2008) STAMP: stanford transactional applications for multi-processing. In: IISWC 2008 – reference: Riegel T, Felber P, Fetzer C (2006) A lazy snapshot algorithm with eager validation. In: DISC 2006 – reference: Waliullah MM, Stenström P (2009) Schemes for avoiding starvation in transactional memory systems. Practice and experience, concurrency and computation – reference: Herlihy M, BMoss JE (1993) Transactional memory: architectural support for lock-free data structures. SIGARCH Comput Archit News 21(2) – reference: Lu L, Scott ML (2013) Generic multiversion STM. In: DISC 2013 – reference: FelberPGramoliVGuerraouiRElastic transactionsJ Parallel Distrib Comput2017100(C):103–127C10312710.1016/j.jpdc.2016.10.010 – reference: Guerraoui R, Kapalka M (2010) Principles of transactional memory. Synthesis lectures on distributed computing theory, Morgan and Claypool – reference: Kuznetsov P, Peri S (2014) Non-interference and local correctness in transactional memory. In: ICDCN, pp 197–211 – reference: Bushkov V, Guerraoui R, Kapalka M (2012) On the liveness of transactional memory. In: ACM symposium on PODC 2012 – reference: Chaudhary VP, Juyal C, Kulkarni SS, Kumari S, Peri S (2017) Starvation freedom in multi-version transactional memory systems. CoRR arXiv:1709.01033 – reference: Kumar P, Peri S, Vidyasankar K (2014) A TimeStamp based multi-version STM algorithm. In: ICDCN, pp 212–226 – reference: Dalessandro L, Spear MF, Scott ML (2010) NOrec: streamlining STM by abolishing ownership records. PPoPP 2010 – reference: Shavit N, Touitou D (1995) Software transactional memory. In: PODC – reference: Crain T, Imbs D, Raynal M (2011) Read invisibility, virtual world consistency and probabilistic permissiveness are compatible. In: ICA3PP – reference: Bushkov V, Guerraoui R (2015) Liveness in transactional memory pp Transactional Memory. Foundations, Algorithms, Tools, and Applications, pp 32–49 – reference: HerlihyMShavitNThe art of multiprocessor programming, revised reprint20121San FranciscoMorgan Kaufmann Publishers Inc. – reference: Herlihy M, Shavit N (2011) On the nature of progress. OPODIS 2011 – reference: Herlihy MP, Wing JM (1990) Linearizability: a correctness condition for concurrent objects. ACM Trans Program Lang Syst 12(3) – reference: Spear MF, Dalessandro L, Marathe VJ, Scott ML (2009) A comprehensive strategy for contention management in software transactional memory. PPoPP – reference: Chaudhary VP, Juyal C, Kulkarni SS, Kumari S, Peri S (2019) Achieving starvation-freedom in multi-version transactional memory systems. In: NETYS – reference: Papadimitriou CH (1979) The serializability of concurrent database updates. J ACM 26(4) – reference: Guerraoui R, Kapalka M (2008) On the correctness of transactional memory. In: PPoPP 2008 – reference: Fernandes SM, Cachopo J (2011) Lock-free and scalable multi-version software transactional memory. PPoPP 2011 – reference: Perelman D, Byshevsky A, Litmanovich O, Keidar I (2011) SMV: selective multi-versioning STM. In: DISC, pp 125–140 – reference: Kuznetsov P, Peri S (2017) Non-interference and local correctness in transactional memory. Theor Comput Sci 688 – reference: Doherty S, Groves L, Luchangco V, Moir M (2009) Towards formally specifying and verifying transactional memory. In: REFINE – reference: Gramoli V, Guerraoui R, Trigonakis V (2012) TM2C: a software transactional memory for many-cores. EuroSys 2012 – ident: 994_CR4 doi: 10.1145/2332432.2332435 – ident: 994_CR5 – ident: 994_CR13 doi: 10.1145/1345206.1345233 – ident: 994_CR2 doi: 10.1145/800220.806699 – ident: 994_CR8 doi: 10.1145/1693453.1693464 – ident: 994_CR15 doi: 10.1145/1375581.1375626 – ident: 994_CR12 doi: 10.1145/2168836.2168872 – ident: 994_CR30 doi: 10.1002/cpe.1363 – ident: 994_CR11 doi: 10.1145/1941553.1941579 – ident: 994_CR20 doi: 10.1007/978-3-642-45249-9_14 – ident: 994_CR26 doi: 10.1007/978-3-642-24100-0_9 – ident: 994_CR25 doi: 10.1145/322154.322158 – ident: 994_CR17 doi: 10.1007/978-3-642-25873-2_22 – ident: 994_CR7 doi: 10.1007/978-3-642-24650-0_21 – ident: 994_CR16 doi: 10.1145/173682.165164 – ident: 994_CR22 doi: 10.1016/j.tcs.2016.06.021 – ident: 994_CR1 doi: 10.1007/978-3-662-45174-8_26 – ident: 994_CR23 doi: 10.1186/1687-1847-2013-27 – ident: 994_CR3 doi: 10.1007/978-3-319-14720-8_2 – ident: 994_CR9 doi: 10.1016/j.entcs.2010.01.001 – ident: 994_CR19 doi: 10.1145/78969.78972 – volume: 100(C):103–127 start-page: 103 issue: C year: 2017 ident: 994_CR10 publication-title: J Parallel Distrib Comput doi: 10.1016/j.jpdc.2016.10.010 – ident: 994_CR27 doi: 10.1007/11864219_20 – ident: 994_CR29 doi: 10.1145/1504176.1504199 – ident: 994_CR6 doi: 10.1007/978-3-030-31277-0_20 – ident: 994_CR14 doi: 10.2200/S00253ED1V01Y201009DCT004 – ident: 994_CR28 doi: 10.1145/224964.224987 – volume-title: The art of multiprocessor programming, revised reprint year: 2012 ident: 994_CR18 – ident: 994_CR21 doi: 10.1007/978-3-642-45249-9_13 – ident: 994_CR24
SSID	ssj0002389
Score	2.2925463
Snippet	Software Transactional Memory systems (STMs) have garnered significant interest as an elegant alternative for addressing synchronization and concurrency issues...
SourceID	proquest crossref springer
SourceType	Aggregation Database Index Database Publisher
StartPage	2159
SubjectTerms	Algorithms Artificial Intelligence Computer Appl. in Administrative Data Processing Computer Communication Networks Computer memory Computer Science Concurrency Concurrency control Concurrent processing Garbage collection Information Systems Applications (incl.Internet) Sanitation services Software Software Engineering Special Issue Article Synchronism
SummonAdditionalLinks	– databaseName: SpringerLINK dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3PS8MwFH7o9KAHp1NxOiUHbxpoa9skxyEOER3ij7FbaUKCO6yTtQ723_uS_hiKHrSnQkpaXpL3fU3e-x7AeSilRBiPqG_8KxqK0KMpXhSptsEmYyKnwDe6Z8MhH4_FY5UUltfR7vWRpPPUTbKblQ5h1IYUWFoT0uU6bCDccVuw4el51PhfBKGS9KKHCXk0rlJlfu7jKxytOOa3Y1GHNoP2_75zF3Yqdkn65XTYgzWddaBdV24g1ULuwPZDo9aa78NdX71NtN1ZIMgVq01aauYIbLMpmWTERR3SRbm1RopViXF819SG6i5JqQidH8Dr4Obl-pZWNRaoCphX0FhxzXTMjCe0YVIY3-Ophzcs1rGQCP-GaSPDWKFTNxzRXKWcywBRXwqJZO4QWtks00dAfMEUV6mUStgTY-QtKXaieMAY_hMp04WL2tTJeymlkTSiyc5oCRotcUZLll3o1aORVMsqTwLmh5HVKPO6cFlbf9X8e2_Hf3v8BLYCm-bggvZ60CrmH_oUNtWimOTzMzfdPgGEc9Fo priority: 102 providerName: Springer Nature
Title	Achieving starvation-freedom in multi-version transactional memory systems
URI	https://link.springer.com/article/10.1007/s00607-021-00994-y https://www.proquest.com/docview/2714530550
Volume	104
WOSCitedRecordID	wos000740648900004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAVX databaseName: SpringerLink customDbUrl: eissn: 1436-5057 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002389 issn: 0010-485X databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwED4BZYCBQgFRHlUGNrBIQhI7E4KqFQJaqvIqLFFsbNGBFpqC1H_P2XFagQQLGU6JLDmRz777cj5_B7AfcM7RjYfEU94xCeLAJSleBKG2wialQsPAd39F223W68UdG3DLbFplYRONoX4eCh0jP_KpF4Sanso9eXsnumqU3l21JTTmoaSRjU7pa7n1qSVGd5TDX7Q1AQt79tCMOTqniUgo0QkKGiQFZPLdMc3Q5o8NUuN3muX_fvEqrFjE6ZzmU2QN5uSgAuWimoNjF3cFlltTBtdsHS5OxUtf6miDg_jRBm6JGqGzG746_YFjMhHJZx5uc8azsuP4rledvjtxcpbobAPumo3b-jmxdReI8Kk7JpFgksqIKjeWivJYeS5LXbyhkYxijpBAUal4EAk09IqhhxcpY9xHJMBjjgBvExYGw4HcAseLqWAi5VzEehcZsUyKnQjmU4r_SUJV4aAY9OQtp9dIpkTKRkUJqigxKkomVdgtRjqxSy1LZsNchcNCV7Pm33vb_ru3HVjy9VEHk7i3Cwvj0Yfcg0XxOe5noxrM04fHGpTOGu1OF58uKamZyaelf42yEz6h7N7cfwG5juDc
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V07T8MwED7xkoCBRwFRKOABJrBI0jR2BoQqHgJaKoaCuoXY2KJDHzQF1D_Fb-TsJK1Ago2BTJEiXZTc-b7P53sA7PtCCITxCnW1W6Z-6Ds0xosi1db4SOuK7cD3UGeNBm-1wrsp-MhrYUxaZe4TraN-6kkTIz_2mOtXTHsq57T_Qs3UKHO6mo_QSM2ipkbvuGVLTq7PUb8Hnnd50Ty7otlUASo95gxpILliKmDaCZVmItSuw2MHb1igglAg4GmmtPADiW5Mc8QvGXMuPMQ5EQqkLyh3Gmb9MmdmXdUYHXt-hL-UbqNv83mllRXp2FI90_iEUZMQYUiZT0dfgXDCbr8dyFqcu1z-b39oBZYyRk2q6RJYhSnVLcByPq2CZM6rAIu34w61yRrcVOVzW5loCkF-nAWmqR4gmPc6pN0lNtOSvqXhRDKcjFXHd3VMevKIpF2wk3W4_5Pv24CZbq-rNoG4IZNcxkLI0JySI1eLUYjkHmO4D5S6CIe5kqN-2j4kGjeKtiYRoUlE1iSiURFKuWajzJUk0UStRTjKbWPy-GdpW79L24P5q-ZtPapfN2rbsOCZsg6bpFiCmeHgVe3AnHwbtpPBrjVyAo9_bTOfusM35Q
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V07T8MwED6VhxAMlKcoTw8wgUUSktgZEKqAivKoOgCqWEJsbNGBFpoC6l_j13F2klYgwcZApkiWLkruct_n8z0Atn0hBMJ4QF3tHlA_8h2a4EWRamtc0jqwHfhuL1mjwVutqFmCj6IWxqRVFj7ROuqHrjQx8n2PuX5g2lM5-zpPi2ie1I6eX6iZIGVOWotxGpmJXKjBO27f0sP6Cep6x_Nqp9fHZzSfMEClx5w-DSVXTIVMO5HSTETadXji4A0LVRgJBD_NlBZ-KNGlaY5YJhPOhYeYJyKBVAbljsEEwz2mSSdsBndDFEAozKg3-jmfB628YMeW7ZkmKIya5AhD0Hw6-AqKI6b77XDWYl6t_J-_1hzM5kybVLNfYx5KqrMA5WKKBcmd2gLMXA0716aLcF6Vj21loiwEeXMesKa6hyDffSLtDrEZmPQtCzOS_mjcOj7ryaQtD0jWHTtdgps_eb9lGO90O2oFiBsxyWUihIzM6TlyuASFSO4xhvtDqSuwWyg8fs7aisTDBtLWPGI0j9iaRzyowHqh5Th3MWk8UnEF9go7GS3_LG31d2lbMIWmEl_WGxdrMO2Zag-bu7gO4_3eq9qASfnWb6e9TWvvBO7_2mQ-AdbXQQk
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Achieving+starvation-freedom+in+multi-version+transactional+memory+systems&rft.jtitle=Computing&rft.au=Chaudhary%2C+Ved+Prakash&rft.au=Juyal%2C+Chirag&rft.au=Kulkarni%2C+Sandeep&rft.au=Kumari%2C+Sweta&rft.date=2022-10-01&rft.pub=Springer+Nature+B.V&rft.issn=0010-485X&rft.eissn=1436-5057&rft.volume=104&rft.issue=10&rft.spage=2159&rft.epage=2179&rft_id=info:doi/10.1007%2Fs00607-021-00994-y&rft.externalDBID=HAS_PDF_LINK
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0010-485X&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0010-485X&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0010-485X&client=summon