$$\hbox {TM}^{2}$$ TM 2 C: a software transactional memory for many-cores

Gramoli, Vincent; Guerraoui, Rachid; Trigonakis, Vasileios

doi:10.1007/s00446-017-0310-6

Cited by 9 publications

(5 citation statements)

References 66 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…TM2C [13] is another example. When using the FairCM contention manager, TM2C provides starvation-freedom by assigning a priority to each transaction which does not change during its lifespan.…”

Section: Related Workmentioning

confidence: 99%

2plsf

Ramalhete

Correia

Felber

2023

Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming

View full text Add to dashboard Cite

Invented more than 40 years ago, the two-phase locking concurrency control (2PL) is capable of providing opaque transactions over multiple records. However, classic 2PL can suffer from live-lock and its scalability is low when applied to workloads with a high number of non-disjoint read accesses.In this paper we propose a new 2PL algorithm (2PLSF) which, by utilizing a novel reader-writer lock, provides highly scalable transactions with starvation-freedom guarantees. Our 2PLSF concurrency control can be applied to records, metadata and to indexing data structures used in database management systems (DBMS). In our experiments we show that 2PLSF is often superior to classical 2PL and can surpass concurrency controls with optimistic reads, simultaneously providing high throughput and low latency for disjoint and non-disjoint workloads.CCS Concepts • Theory of computation Concurrent algorithms.

show abstract

Section: Related Workmentioning

confidence: 99%

2plsf

Ramalhete

Correia

Felber

2023

Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming

View full text Add to dashboard Cite

show abstract

“…For performance evaluation of KSFTM with the state-of-the-art STMs, we implemented the the algorithms PKTO, SV-SFTM [9,27,26] along with KSFTM in C++ 2 . We used the available implementations of NOrec STM [6], and ESTM [7] developed in C++.…”

Section: Experimental Evaluationmentioning

confidence: 99%

“…r 1 (y, 0) r 1 (x, 0) Figure 1: Limitation of Single-version Starvation Free Algorithm Related work on the starvation-free STMs: Starvation-freedom in STMs has been explored by a few researchers in literature such as Gramoli et al [9], Waliullah and Stenstrom [27], Spear et al [26]. Most of these systems work by assigning priorities to transactions.…”

Section: Introductionmentioning

confidence: 99%

Achieving Starvation-Freedom in Multi-version Transactional Memory Systems

et al. 2019

View full text Add to dashboard Cite

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 presence of a fair scheduler) such that the transaction eventually commits.A few starvation-free algorithms have been proposed in the literature in context of single-version STMs. These algorithms are priority based i.e. if two transactions are in conflict, then the transaction with lower priority will abort. A transaction running for a long time will eventually have the highest priority and hence commit. But the drawback with this approach is that if a set of high-priority transactions become slow, then they can cause several other transactions to abort. So, we propose multi-version starvation-free STM system which addresses this issue.Multi-version STMs maintain multiple-versions for each transactional object. By storing multiple versions, these systems can achieve greater concurrency. In this paper, we propose multi-version starvation-free STM, KSFTM, which as the name suggests achieves starvation-freedom while storing K-versions of each t-object. Here K is an input parameter fixed by the application programmer depending on the requirement. Our algorithm is dynamic which can support different values of K ranging from one to infinity. If K is infinite, then there is no limit on the number of versions. But a separate garbage-collection mechanism is required to collect unwanted versions. On the other hand, when K is one, it becomes the same as a single-version starvation-free STM system. We prove the correctness and starvation-freedom property of the KSFTM algorithm.To the best of our knowledge, this is the first multi-version STM system that satisfies starvation-freedom. We implement KSFTM and compare its performance with single-version starvation-free STM system (SV-SFTM) which works on the priority principle. Our experiments show that KSFTM gives an average speedup on the worst-case time to commit of a transaction by a factor of 1.22, 1.89, 23.26 and 13.12 times over PKTO, SV-SFTM, NOrec STM and ESTM respectively for counter application. KSFTM performs 1.5 and 1.44 times better than PKTO and SV-SFTM but 1.09 times worse than NOrec for low contention KMEANS application of STAMP benchmark whereas KSFTM performs 1.14, 1.4 and 2.63 times better than PKTO, SV-SFTM and NOrec for LABYRINTH application of STAMP benchmark which has high contention with long-running transactions. * A preliminary version of this work was accepted in AADDA 2017 as work in progress. † A part of this work was submitted towards the fulfillment of M.Tech thesis requirement by the author. ‡ Author sequence follows a lexical order of last...

show abstract

“…Related work on Starvation-free STMs: Some researchers Gramoli et al [12], Waliullah and Stenstrom [13], Spear et al [14], Chaudhary et al [15] have explored starvationfreedom in RWSTMs. Most of them assigned priority to the transactions.…”

Section: Introductionmentioning

confidence: 99%

Achieving Starvation-Freedom with Greater Concurrency in Multi-Version Object-based Transactional Memory Systems

Juyal

Kulkarni

Kumari

et al. 2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

To utilize the multi-core processors properly concurrent programming is needed. The main challenge is to design a correct and efficient concurrent program. Software Transactional Memory Systems (STMs) provide ease of multithreading to the programmer without worrying about concurrency issues as deadlock, livelock, priority inversion, etc. Most of the STMs work on read-write operations known as RWSTMs. Some STMs work at higher-level operations and ensure greater concurrency than RWSTMs. Such STMs are known as Single-Version Object-based STMs (SVOSTMs). The transactions of SVOSTMs can return commit or abort. Aborted SVOSTMs transactions retry. But in the current setting of SVOSTMs, transactions may starve. So, we propose a Starvation-Freedom in SVOSTM as SF-SVOSTM that satisfies the correctness criteria conflict-opacity. Databases and STMs say that maintaining multiple versions corresponding to each shared data-item (or key) reduces the number of aborts and improves the throughput. So, to achieve greater concurrency further, we propose Starvation-Freedom in Multi-Version OSTM as SF-MVOSTM algorithm. The number of versions maintains by SF-MVOSTM either be unbounded with garbage collection as SF-MVOSTM-GC or bounded with latest K-versions as SF-KOSTM. SF-MVOSTM satisfies the correctness criteria as local opacity and shows the performance benefits as compared with state-of-the-art STMs.

show abstract

$$\hbox {TM}^{2}$$ TM 2 C: a software transactional memory for many-cores

Cited by 9 publications

References 66 publications

2plsf

2plsf

Achieving Starvation-Freedom in Multi-version Transactional Memory Systems

Achieving Starvation-Freedom with Greater Concurrency in Multi-Version Object-based Transactional Memory Systems

Contact Info

Product

Resources

About