Complete worst-case execution time analysis of straight-line hard real-time programs |
| |
| Affiliation: | 1. Centre for Distributed and High Performance Computing, School of Information Technologies, The University of Sydney, Australia;2. PPGI, Federal University of Rio de Janeiro, Rio de Janeiro, Brazil;1. Laboratoire des Matériaux Céramiques et Procédés Associés (LMCPA), UVHC, Pôle Universitaire de Maubeuge, Boulevard Charles de Gaulle, F-59600 Maubeuge, France;2. Belgian Ceramic Research Centre (BCRC), Avenue Gouverneur Cornez, 4, B-7000 Mons, Belgium;3. Laboratory for Bone Metabolism and Regeneration, Faculdade de Medicina Dentária, Universidade do Porto, Rua Manuel Pereira da Silva, 4200-393 Porto, Portugal;4. INEB,Universidade do Porto, Rua do Campo Alegre, 823,4150-180 Porto, Portugal |
| |
| Abstract: | In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a hard real-time program is addressed. The analysis is focused on straight-line code (without loops and recursive function calls) which is quite commonly found in synthesised code for embedded systems. A comprehensive timing analysis system covering both low-level (assembler instruction level) as well as high-level aspects (programming language level) is presented. The low-level analysis covers all speed-up mechanisms used for modern superscalar processors: pipelining, instruction-level parallelism and caching. The high-level analysis uses the results from the low-level to compute the final estimate on the WCET. This is done by a heuristic for searching the longest really executable path in the control flow, based on the functional dependencies between various program parts. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
