Hostname: page-component-745bb68f8f-kw2vx Total loading time: 0 Render date: 2025-02-10T14:31:20.286Z Has data issue: false hasContentIssue false
  • English
  • Français
Accepted manuscript

Worst-Case Performance for Real-Time Systems

Published online by Cambridge University Press:  30 January 2025

Martin Schoeberl Open the ORCID record for Martin Schoeberl [Opens in a new window] ,
Erling Jellum ,
Shaokai Lin Open the ORCID record for Shaokai Lin [Opens in a new window] ,
Chadlia Jerad ,
Emad Jacob Maroun ,
Marten Lohstroh  and
Edward A Lee Open the ORCID record for Edward A Lee [Opens in a new window]
Martin Schoeberl*
Affiliation:
Department of Applied Mathematics and Computer Science, Technical University of Denmark, Kgs. Lyngby, Denmark
Erling Jellum
Affiliation:
Norwegian University of Science and Technology, Trondheim, Norway
Shaokai Lin
Affiliation:
University of California, Berkeley, CA, USA
Chadlia Jerad
Affiliation:
Universite de La Manouba, Tunisia
Emad Jacob Maroun
Affiliation:
Department of Applied Mathematics and Computer Science, Technical University of Denmark, Kgs. Lyngby, Denmark
Marten Lohstroh
Affiliation:
University of California, Berkeley, CA, USA
Edward A Lee
Affiliation:
University of California, Berkeley, CA, USA
*
*Author for correspondence. Email: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Real-time systems need to be built out of tasks for which the worst-case execution time is known. To enable accurate estimates of worst-case execution time, some researchers propose to build processors that simplify that analysis. These architectures are called precision-timed machines or time-predictable architectures. However, what does this term mean? This paper explores the meaning of time predictability and how it can be quantified. We show that time predictability is hard to quantify. Rather, the worst-case performance as the combination of a processor, a compiler, and a worst-case execution time analysis tool is an important property in the context of real-time systems. Note that the actual software has implications as well on the worst-case performance. We propose to define a standard set of benchmark programs that can be used to evaluate a time-predictable processor, a compiler, and a worst-case execution time analysis tool. We define worst-case performance as the geometric mean of worst-case execution time bounds on a standard set of benchmark programs.

Keywords

real-time systemstime-predictable systemsprecision timed machines
Type
Results
Information
Research Directions: Cyber-Physical Systems , Accepted manuscript , pp. 1 - 9
Creative Commons
Creative Common License - CCCreative Common License - BYCreative Common License - NCCreative Common License - ND
This is an Open Access article, distributed under the terms of the Creative Commons Attribution- NonCommercial-NoDerivatives licence (http://creativecommons.org/licenses/by-nc-nd/4.0/), which permits non-commercial re-use, distribution, and reproduction in any medium, provided the original work is unaltered and is properly cited. The written permission of Cambridge University Press must be obtained for commercial re-use or in order to create a derivative work.
Copyright
© The Author(s), 2025. Published by Cambridge University Press