2019
DOI: 10.1007/978-3-030-31277-0_20
|View full text |Cite
|
Sign up to set email alerts
|

Achieving Starvation-Freedom in Multi-version Transactional Memory Systems

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. For STMs to be efficient, they must guarantee some progress properties. This work explores the notion of one of the progress property, i.e., starvation-freedom, in STMs. An STM system is said to be starvation-free if every thread invoking a transaction gets the opportunity to take a step (due to the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
3
1
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(8 citation statements)
references
References 30 publications
0
8
0
Order By: Relevance
“…If all the rv methods() of history H returns the value from the previous closest committed transactions then such H is known as legal history. Sub-history: Following [15], A sub-history (SH) of a history (H) is a collection of events represented as evts(SH). We denote a SH as the tuple evts(SH), < SH , here < SH represents the total order of among all the events of SH.…”
Section: System Model and Preliminariesmentioning
confidence: 99%
See 4 more Smart Citations
“…If all the rv methods() of history H returns the value from the previous closest committed transactions then such H is known as legal history. Sub-history: Following [15], A sub-history (SH) of a history (H) is a collection of events represented as evts(SH). We denote a SH as the tuple evts(SH), < SH , here < SH represents the total order of among all the events of SH.…”
Section: System Model and Preliminariesmentioning
confidence: 99%
“…Lets assume a history H with given version order . Following the graph characterization by Chaudhary et al [15] and modified it for sequential histories with high-level methods while maintaining multiple versions corresponding to each key and extend it for local opacity which helps to prove the correctness of SF-KOSTM. Similar to Section 4, SF-KOSTM executes a concurrent history H which consists of multiple transactions.…”
Section: Graph Characterization Of Local Opacity and Sf-kostm Correctmentioning
confidence: 99%
See 3 more Smart Citations