Building Timing Predictable Embedded Systems

Abstract : A large class of embedded systems is distinguished from general purpose computing systems by the need to satisfy strict requirements on timing, often under constraints on available resources. Predictable system design is concerned with the challenge of building systems for which timing requirements can be guaranteed a priori. Perhaps paradoxically, this problem has become more difficult by the introduction of performance-enhancing architectural elements, such as caches, pipelines, and multithreading, which introduce a large degree of uncertainty and make guarantees harder to provide. The intention of this paper is to summarize current state-of-the-art in research concerning how to build predictable yet performant systems. We sug- gest precise definitions for the concept of “predictability”, and present predictability concerns at different abstraction levels in embedded system design. First, we consider timing predictability of processor instruction sets. Thereafter, we consider how programming languages can be equipped with predictable timing semantics, covering both a language-based approach based on the synchronous programming paradigm, as well as an environment that provides timing semantics for a mainstream programming language (in this case C). We present techniques for achieving timing predictability on multicores. Finally we discuss how to handle predictability at the level of networked embedded systems, where randomly occurring errors must be considered.
Type de document :
Article dans une revue
ACM Transactions on Embedded Computing Systems (TECS), ACM, 2014, 13 (4), pp.38. 〈10.1145/2560033〉
Liste complète des métadonnées
Contributeur : Alain Girault <>
Soumis le : lundi 15 décembre 2014 - 16:10:06
Dernière modification le : jeudi 11 octobre 2018 - 08:48:04

Lien texte intégral



Philip Axer, Rolf Ernst, Heiko Falk, Alain Girault, Daniel Grund, et al.. Building Timing Predictable Embedded Systems. ACM Transactions on Embedded Computing Systems (TECS), ACM, 2014, 13 (4), pp.38. 〈10.1145/2560033〉. 〈hal-01095461〉



Consultations de la notice