The worst-case execution-time problem-overview of methods and survey of tools

Please use this identifier to cite or link to this item: https://doi.org/10.1145/1347375.1347389

Title:	The worst-case execution-time problem-overview of methods and survey of tools
Authors:	Wilhelm, R. Engblom, J. Ermedahl, A. Holsti, N. Thesing, S. Whalley, D. Bernat, G. Ferdinand, C. Heckmann, R. Mitra, T. Mueller, F. Puaut, I. Puschner, P. Staschulat, J. Stenström, P.
Keywords:	Hard real time Worst-case execution times
Issue Date:	2008
Citation:	Wilhelm, R., Engblom, J., Ermedahl, A., Holsti, N., Thesing, S., Whalley, D., Bernat, G., Ferdinand, C., Heckmann, R., Mitra, T., Mueller, F., Puaut, I., Puschner, P., Staschulat, J., Stenström, P. (2008). The worst-case execution-time problem-overview of methods and survey of tools. Transactions on Embedded Computing Systems 7 (3). ScholarBank@NUS Repository. https://doi.org/10.1145/1347375.1347389
Abstract:	The determination of upper bounds on execution times, commonly called worst-case execution times (WCETs), is a necessary step in the development and validation process for hard real-time systems. This problem is hard if the underlying processor architecture has components, such as caches, pipelines, branch prediction, and other speculative components. This article describes different approaches to this problem and surveys several commercially available tools 1 and research prototypes. © 2008 ACM.
Source Title:	Transactions on Embedded Computing Systems
URI:	http://scholarbank.nus.edu.sg/handle/10635/39767
ISSN:	15399087
DOI:	10.1145/1347375.1347389
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check