About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Conference paper

Is Time Predictability Quantifiable?

In International Conference on Embedded Computer Systems (samos 2012) — 2012, pp. 333-338
From

Department of Informatics and Mathematical Modeling, Technical University of Denmark1

Embedded Systems Engineering, Department of Informatics and Mathematical Modeling, Technical University of Denmark2

Computer architects and researchers in the realtime domain start to investigate processors and architectures optimized for real-time systems. Optimized for real-time systems means time predictable, i.e., architectures where it is possible to statically derive a tight bound of the worst-case execution time.

To compare different approaches we would like to quantify time predictability. That means we need to measure time predictability. In this paper we discuss the different approaches for these measurements and conclude that time predictability is practically not quantifiable. We can only compare the worst-case execution time bounds of different architectures.

Language: English
Publisher: IEEE
Year: 2012
Pages: 333-338
Proceedings: 12th International Conference on Embedded Computer Systems (SAMOS 2012)International Conference on Embedded Computer Systems: Architectures, MOdeling, and Simulation
ISBN: 1467322954 , 1467322962 , 9781467322959 , 9781467322966 , 1467322970 and 9781467322973
Types: Conference paper
DOI: 10.1109/SAMOS.2012.6404196
ORCIDs: Schoeberl, Martin

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user

Access

Analysis