Please use this identifier to cite or link to this item:
Title: Modeling out-of-order processors for software timing analysis
Authors: Li, X.
Roychoudhury, A. 
Mitra, T. 
Issue Date: 2004
Citation: Li, X.,Roychoudhury, A.,Mitra, T. (2004). Modeling out-of-order processors for software timing analysis. Proceedings - Real-Time Systems Symposium : 92-103. ScholarBank@NUS Repository.
Abstract: Estimating the Worst Case Execution Time (WCET) of a program on a given processor is important for the schedulability analysis of real-time systems. WCET analysis techniques typically model the timing effects of microarchitectural features in modern processors (such as the pipeline, caches, branch prediction, etc.) to obtain safe but tight estimates. In this paper, we model out-of-order processor pipelines for WCET analysis. This analysis is, in general, difficult even for a basic block (a sequence of instructions with single-entry and single-exit points) if some of the instructions have variable latencies. This is because the WCET of a basic block on out-of-order pipelines cannot be obtained by assuming maximum latencies of the individual instructions. Our timing estimation technique for a basic block is inspired by an existing performance analysis technique for tasks with data dependences and resource contentions in real-time distributed systems. We extend our analysis by modeling the interaction among consecutive basic blocks as well as the effect of instruction cache. Finally, we employ Integer Linear Programming (ILP) to compute the WCET of an entire program. The accuracy of our analysis is demonstrated via tight estimates obtained for several benchmarks. © 2004 IEEE.
Source Title: Proceedings - Real-Time Systems Symposium
ISBN: 0769522475
ISSN: 10528725
DOI: 10.1109/REAL.2004.33
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Mar 22, 2020

Page view(s)

checked on Mar 22, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.