Creative Commons Attribution 3.0 Unported license
The applicability of Simultaneous Multithreading (SMT) to real-time systems has been hampered by the difficulty of obtaining reliable execution costs in an SMT-enabled system. This problem is addressed by introducing a scheduling framework, called CERT-MT, that combines scheduling-aware timing analysis with a cyclic-executive scheduler in a way that minimizes SMT-related timing variations. The proposed scheduling-aware timing analysis is based on maximum observed execution times and accounts for the uncertainty inherent in measurement-based timing analysis. The timing analysis is found to work for tasks with and without SMT, though some adjustments are required in the former case. A large-scale schedulability study is presented that shows CERT-MT can schedule systems with total utilizations approaching 1.4 times the core count, without sacrificing safety.
@InProceedings{osborne_et_al:LIPIcs.ECRTS.2020.14,
author = {Osborne, Sims Hill and Anderson, James H.},
title = {{Simultaneous Multithreading and Hard Real Time: Can It Be Safe?}},
booktitle = {32nd Euromicro Conference on Real-Time Systems (ECRTS 2020)},
pages = {14:1--14:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-152-8},
ISSN = {1868-8969},
year = {2020},
volume = {165},
editor = {V\"{o}lp, Marcus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2020.14},
URN = {urn:nbn:de:0030-drops-123778},
doi = {10.4230/LIPIcs.ECRTS.2020.14},
annote = {Keywords: real-time systems, simultaneous multithreading, hard real-time, scheduling algorithms, probability, statistics, timing analysis}
}