Schedulability Analysis of Transactions in Software Transactional Memory Using Timed Automata

Abstract

1 -Software Transactional Memory (STM) is a mechanism for controlling access to shared resources in memory using an abort-restart preemption model for tasks which share data objects. This execution model of STM is different from the classical preemptive or non-preemptive models and currently the only method to determine schedulability is through an exhaustive search through the state space of all release scenarios of higher priority tasks. The existing method is costly and scales exponentially with the number of tasks making its use limited in practical situations. Timed Automata has been proven as an expressive formalism for time based systems. This paper presents a methodology for developing Timed Automata encodings for the schedulability analysis of STM systems. We validate our models using the model checker UPPAAL, and show that Timed Automata offers an efficient alternative for schedulability analysis in real-time STM.

Formal Verification of Python Software Transactional Memory Based on Timed Automata

“…Due to its expressiveness and convenience, finite state machine based formalisms such as Petri nets and Timed Automata (TA), are often used in the praxis for modeling and machine verification of complex problems like scheduling [15] or synchronization problems [16]. PSTM is formalized and verified using UPPAAL tool.…”

Worst case response time and schedulability analysis for real-time software transactional memory-lazy conflict detection (STM-LCD)

“…The transactional mechanism of controlling access to shared resources in software transactional memory is similar to the abort-and-restart (AR) execution model in a priority-based functional reactive programming (P-FRP) system which has been studied with regard to its temporal attributes including response time analysis [6,7], schedulability analysis [8] and priority assignment [14]. Based on the aforementioned research, Belwal and Cheng [4] have compared the temporal attributes of both ECD and LCD mechanisms.…”