Supporting Time-Based QoS Requirements in Software Transactional Memory - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Transactions on Parallel Computing Year : 2015

Supporting Time-Based QoS Requirements in Software Transactional Memory


Software Transactional Memory (STM) is an optimistic concurrency control mechanism that simplifies parallel programming. Still, there has been little interest in its applicability for reactive applications in which there is a required response time for certain operations. We propose supporting such applications by allowing programmers to associate time with atomic blocks in the forms of deadlines and QoS requirements. Based on statistics of past executions, we adjust the execution mode of transactions by decreasing the level of optimism as the deadline approaches. In the presence of concurrent deadlines, we propose different conflict resolution policies. Execution mode switching mechanisms allow meeting multiple deadlines in a consistent manner, with potential QoS degradations being split fairly among several threads as contention increases, and avoiding starvation. Our implementation consists of extensions to a STM runtime that allow gathering statistics and switching execution modes. We also propose novel contention managers adapted to transactional workloads subject to deadlines. The experimental evaluation shows that our approaches significantly improve the likelihood of a transaction meeting its deadline and QoS requirement, even in cases where progress is hampered by conflicts and other concurrent transactions with deadlines.
Fichier principal
Vignette du fichier
Maldonado_et_al_TOPC.pdf (1.1 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01240225 , version 1 (08-12-2015)



Walther Maldonado, Patrick Marlier, Pascal Felber, Julia Lawall, Gilles Muller, et al.. Supporting Time-Based QoS Requirements in Software Transactional Memory. ACM Transactions on Parallel Computing, 2015, 2 (2), pp.27. ⟨10.1145/2779621⟩. ⟨hal-01240225⟩
277 View
203 Download



Gmail Facebook Twitter LinkedIn More