On STM concurrency control for multicore embedded real-time software

Abstract

We consider software transactional memory (STM) concurrency control in multicore embedded real-time software. We design an Earliest-Deadline-First (EDF) contention manager (CM) to augment STM's obstruction-free progress semantics. We establish the conditions under which STM/EDF-CM is competitive to lock-based and lock-free synchronization. Our experimental results reveal that STM/EDF-CM outperforms highly concurrent, fine-grain lock-based complex data structures, for which lock-free is often not viable.

On real-time STM concurrency control for embedded software with improved schedulability

“…ECM and RCM [5] use dynamic and fixed priorities, respectively, to resolve conflicts. ECM uses G-EDF, and allows the transaction whose job has the earliest absolute deadline to commit first [6]. RCM uses G-RMA, and commits the transaction whose job has the shortest period.…”

“…Past real-time CM research has proposed resolving transactional contention using dynamic and fixed priorities of parent threads, resulting in Earliest Deadline First CM (ECM) and Rate Monotonic CM (RCM), respectively [6,5,4]. In particular, [5] shows that ECM and RCM achieve higher schedulability -i.e., greater number of task sets meeting their time constraints -than lock-free synchronization only under some ranges for the maximum atomic section length.…”