PIPELINED PROCESSORS AND WORST-CASE EXECUTION TIMES

TY - JOUR

T1 - PIPELINED PROCESSORS AND WORST-CASE EXECUTION TIMES

AU - Zhang, N

AU - Burns, A

AU - Nicholson, M

PY - 1993/10

Y1 - 1993/10

N2 - The calculation of worst case execution time (WCET) is a fundamental requirement of almost all scheduling approaches for hard real-time systems. Due to their unpredictability, hardware enhancements such as cache and pipelining are often ignored in attempts to find WCET of programs. This results in estimations that are excessively pessimistic. In this article a simple instruction pipeline is modeled so that more accurate estimations are obtained. The model presented can be used with any schedulability analysis that allows sections of nonpreemptable code to be included. Our results indicate the WCET overestimates at basic block level can be reduced from over 20% to less than 2%, and that the overestimates for typical structured real-time programs can be reduced by 17%-40%.

AB - The calculation of worst case execution time (WCET) is a fundamental requirement of almost all scheduling approaches for hard real-time systems. Due to their unpredictability, hardware enhancements such as cache and pipelining are often ignored in attempts to find WCET of programs. This results in estimations that are excessively pessimistic. In this article a simple instruction pipeline is modeled so that more accurate estimations are obtained. The model presented can be used with any schedulability analysis that allows sections of nonpreemptable code to be included. Our results indicate the WCET overestimates at basic block level can be reduced from over 20% to less than 2%, and that the overestimates for typical structured real-time programs can be reduced by 17%-40%.

M3 - Article

SN - 0922-6443

VL - 5

SP - 319

EP - 343

JO - Real-Time Systems

JF - Real-Time Systems

IS - 4

ER -