License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DARTS.6.1.1
URN: urn:nbn:de:0030-drops-123915
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12391/
Go back to Dagstuhl Artifacts Series


Osborne, Sims Hill ; Bakita, Joshua J. ; Anderson, James H.

Simultaneous Multithreading and Hard Real Time: Can it be Safe? (Artifact)

pdf-format:
DARTS-6-1-1.pdf (0.3 MB)
artifact-format:
DARTS-6-1-1-artifact-03dd6255f2cee5f39b0977e0cacddd5b.tgz (522 MB)


Abstract

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 from two directions. A scheduler is introduced, CERT-MT, that minimizes SMT-related timing variations, and two new timing analysis methods - one based on the binomial distribution and one based on Cantelli’s Inequality - are given. Both methods estimate probabilistic WCETs and attach statistical confidence levels to those estimates. The timing analyses are applied to tasks executing with and without SMT, and it is found that in some cases, two tasks utilizing SMT can be safely executed in less time than would be needed for either task by itself. A large-scale schedulability study is conducted, showing that CERT-MT can schedule systems with total utilizations twice what could otherwise be achieved. This artifact includes benchmark experiments used to compare execution times with and without SMT and code to analyze the benchmark experiments and duplicate the reported schedulability experiments.

BibTeX - Entry

@Article{osborne_et_al:DARTS:2020:12391,
  author =	{Sims Hill Osborne and Joshua J. Bakita and James H. Anderson},
  title =	{{Simultaneous Multithreading and Hard Real Time: Can it be Safe? (Artifact)}},
  pages =	{1:1--1:3},
  journal =	{Dagstuhl Artifacts Series},
  ISSN =	{2509-8195},
  year =	{2020},
  volume =	{6},
  number =	{1},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12391},
  URN =		{urn:nbn:de:0030-drops-123915},
  doi =		{10.4230/DARTS.6.1.1},
  annote =	{Keywords: real-time systems, simultaneous multithreading, real-time, scheduling algorithms, timing analysis, probability, statistics}
}

Keywords: real-time systems, simultaneous multithreading, real-time, scheduling algorithms, timing analysis, probability, statistics
Collection: DARTS, Volume 6, Issue 1, Special Issue of the 32nd Euromicro Conference on Real-Time Systems (ECRTS 2020)
Related Scholarly Article: https://doi.org/10.4230/LIPIcs.ECRTS.2020.14
Issue Date: 2020
Date of publication: 30.06.2020


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI