Book ChapterDOI
A Lightweight Implementation of Obstruction-Free Software Transactional Memory
Ankita Saha,Atrayee Chatterjee,Nabanita Pal,Ammlan Ghosh,Nabendu Chaki +4 more
- pp 67-84
Reads0
Chats0
TLDR
A simple, lightweight, and yet efficient implementation of OFTM that uses simple data structure and does not require any contention manager toward ensuring progress condition, atomicity, and serializability of transactions besides maintaining data consistency is proposed.Abstract:
Software transactional memory (STM) has evolved as an alternative for traditional lock-based process synchronization. It promises greater degree of concurrency and faster execution. This paper proposes a simple, lightweight, and yet efficient implementation of OFTM. The major contribution of the paper is in proposing a new STM algorithm that uses simple data structure. This does not require any contention manager toward ensuring progress condition, atomicity, and serializability of transactions besides maintaining data consistency. Experimental simulation on random data set establishes the merit of the proposed solution.read more
Citations
More filters
Journal ArticleDOI
Slider: an online and active deadlock avoider by serial execution of critical sections
Zhen Yu,Xiaohong Su,Peijun Ma +2 more
TL;DR: Experimental results show Slider can correctly avoid multiple types of deadlocks in an online, active, efficient and scalable way.
Book ChapterDOI
Hardware Transactional Memories: A Survey
TL;DR: In this chapter, this chapter has focused on hardware transactional memories and the work done on them so far.
References
More filters
Practical lock-freedom
TL;DR: This dissertation introduces and evaluates practical abstractions and data structures that facilitate the development of large-scale lock-free systems and presents an implementation of two useful abstractions that make it easier to develop arbitrary lock- free data structures.
Proceedings ArticleDOI
Obstruction-free synchronization: double-ended queues as an example
TL;DR: This work introduces obstruction-freedom, a new nonblocking property for shared data structure implementations that is strong enough to avoid the problems associated with locks, but it is weaker than previous nonblocking properties-specifically lock-freedom and wait-freedom-allowing greater flexibility in the design of efficient implementations.
Proceedings ArticleDOI
Advanced contention management for dynamic software transactional memory
TL;DR: This work considers both visible and invisible versions of read access, and benchmarks that vary in complexity, level of contention, tendency toward circular dependence, and mix of reads and writes, and identifies a candidate default policy.
Book ChapterDOI
Adaptive software transactional memory
TL;DR: This paper considers four dimensions of the STM design space and presents a new Adaptive STM (ASTM) system that adjusts to the offered workload, allowing it to match the performance of the best known existing system on every tested workload.
Proceedings ArticleDOI
On maintaining multiple versions in STM
TL;DR: This paper studies inherent properties of STMs that use multiple versions to guarantee successful commits of all read-only transactions, and presents an STM algorithm using visible reads that efficiently garbage collects useless object versions.