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ženo v:
Podrobná bibliografie
Vydáno v:Computing Ročník 104; číslo 10; s. 2159 - 2179
Hlavní autoři: Chaudhary, Ved Prakash, Juyal, Chirag, Kulkarni, Sandeep, Kumari, Sweta, Peri, Sathya
Médium: Journal Article
Jazyk:angličtina
Vydáno: Vienna Springer Vienna 01.10.2022
Springer Nature B.V
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0010-485X
1436-5057
DOI:10.1007/s00607-021-00994-y