Non-preemptive Scheduling of Real-Time Software Transactional Memory

Barros, António; Pinho, Luís Miguel

doi:10.1007/978-3-319-04891-8_3

Cited by 2 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Barros et al [1] addressed the response time analysis of hard real-time tasks, which share STM data under partitioned scheduling strategies. They assume that transactions are serialised according to their arrival time and they are managed by following a FIFO contention manager for real-time systems (FIFO-CRT) [2].…”

Section: Tm Correctness and Timing Analysismentioning

confidence: 99%

Analysis of Polka Contention Manager for use in Multicore Hard Real-Time Systems

Quillet

Queudet

Lime

2020

Proceedings of the 28th International Conference on Real-Time Networks and Systems

View full text Add to dashboard Cite

Transactional memory (TM) draws the attention of both academic and development groups; indeed this concept offers an alternative to lock-based approaches, easing programmers' work. Despite the large amount of investigations around this topic, the question of the correctness of most TM implementations remains open. More specifically, the lack of upper bounds on the execution time of transactions prevents the use of TM in real-time systems. To address this issue, we introduce new realistic assumptions relative to real-time systems, which allow to ensure wait-freedom guarantees progress (i.e. all transactions progress) when Polka contention manager is considered. In that context, through a thorough formalization of the system, we prove upper bounds both on the number of abortions and on the execution time of transactions. CCS CONCEPTS• Computer systems organization → Real-time operating systems; Multicore architectures.

show abstract

Section: Tm Correctness and Timing Analysismentioning

confidence: 99%