Lazy Versus Eager Conflict Detection in Software Transactional Memory: A Real-Time Schedulability Perspective

Authors:
C. Belwal;A. M.K. Cheng
Affiliations:
Dept. of Comput. Sci., Univ. of Houston, Houston, TX, USA;-
Venue:
IEEE Embedded Systems Letters
Year:
2011

Citing 0
Cited 2

Worst case response time for real-time software transactional memory

Proceedings of the 2012 ACM Research in Applied Computation Symposium
Leveraging transactional memory for a predictable execution of applications composed of hard real-time and best-effort tasks

Proceedings of the 21st International conference on Real-Time Networks and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Transactional memory is a mechanism of controlling access to shared resources in concurrent programs. Though originally implemented in hardware, software implementations of transactional memory are now available as library extensions in all major programming language. Lately, variants of software transactional memory (STM) with real-time support have been presented. The conflict detection policy used in STM, which can be of lazy or eager type, determines the point at which transactions are aborted. The conflict detection policy can have a significant effect on the schedulability of tasks sharing common resources. Using an abstract model, we present a real-time scheduling perspective analysis of lazy and eager conflict detection policies used in STM.