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
A Qualitative Survey of Modern Software Transactional Memory Systems
TL;DR: This paper describes the designs of three STM systems—a hash table based STM system (Hash table STM) for shared memory words due to Harris and Fraser, and two purely object-basedSTM systems, one due to Herlihy et al., the other due to Fraser.
Book ChapterDOI
Single-Version STMs Can Be Multi-version Permissive (Extended Abstract)
TL;DR: PermiSTM is presented, a single-version STM that satisfies a practical notion of permissiveness, usually associated with keeping many versions: it never aborts read-only transactions, and it aborts other transactions only due to a conflicting transaction, thereby avoiding spurious aborts.
Proceedings Article
Single-version STMs can be multi-version permissive
Hagit Attiya,Eshcar Hillel +1 more
TL;DR: PermiSTM as discussed by the authors is a single-version STM that satisfies a practical notion of permissiveness, usually associated with keeping many versions: it never aborts read-only transactions, and it aborts other transactions only due to a conflicting transaction (which writes to a common item), thereby avoiding spurious aborts.
Journal ArticleDOI
The semantics of progress in lock-based transactional memory
GuerraouiRachid,KapalkaMichal +1 more
TL;DR: Transactional memory (TM) is a promising paradigm for concurrent programming, however, little research has been conducted to precisely define TM.
Book ChapterDOI
Read invisibility, virtual world consistency and probabilistic permissiveness are compatible
TL;DR: The paper first shows that read invisibility, probabilistic permissiveness and opacity are incompatible, which means that there is no probabilistically permissive STM system that implements opacity while ensuring read invisibles, and shows that reading invisibility and virtual world consistency are compatible.