An Accurate Worst Case Timing Analysis for RISC Processors
- Authors
- Lim, S.-S.; Bae, Y.H.; Jang, G.T.; Rhee, B.-D.; Min, S.L.; Park, C.Y.; Shin, H.; Park, K.; Moon, S.-M.; Kim, C.S.
- Issue Date
- Jul-1995
- Keywords
- Cache memory; pipelined execution; real-time system; RISC processor; worst case execution time
- Citation
- IEEE Transactions on Software Engineering, v.21, no.7, pp 593 - 604
- Pages
- 12
- Journal Title
- IEEE Transactions on Software Engineering
- Volume
- 21
- Number
- 7
- Start Page
- 593
- End Page
- 604
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/60670
- DOI
- 10.1109/32.392980
- ISSN
- 0098-5589
1939-3520
- Abstract
- An accurate and safe estimation of a task's worst case execution time (WCET) is crucial for reasoning about the timing properties of real-time systems. In RISC processors, the execution time of a program construct (e.g., a statement) is affected by various factors such as cache hits/misses and pipeline hazards, and these factors impose serious problems in analyzing the WCETs of tasks. To analyze the timing effects of RISC's pipelined execution and cache memory, we propose extensions to the original timing schema where the timing information associated with each program construct is a simple time-bound. In our approach, associated with each program construct is worst case timing abstraction, (WCTA), which contains detailed timing information of every execution path that might be the worst case execution path of the program construct. This extension leads to a revised timing schema that is similar to the original timing schema except that concatenation and pruning operations on WCT As are newly defined to replace the add and max operations on time-bounds in the original timing schema. Our revised timing schema accurately accounts for the timing effects of pipelined execution and cache memory not only within but also across program constructs. This paper also reports on preliminary results of WCET analysis for a RISC processor. Our results show that tight WCET bounds (within a maximum of about 30% overestimation) can be obtained by using the revised timing schema approach.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.