Approximation of Worst-case Execution Time for Preemptive ...

More documents

Recommendations

Info

Cycles Per Instruction (CPI) • Instruction length components: – From the processor architecture • execution time • miss penalty – Estimated with help of run-time data • stalls • cache misses • instruction parallelism – Estimated by the program structure • distance between instructions of the same type Matteo Corti, ETH Zurich, LCTES 2000 16
Testing the Predictor • First phase: approximation tuning – simple tests with known WCET (matrix multiplication, Runge-Kutta, …) – different components of the approximator and of the processor can be tested separately • Second phase: real applications – longest path and exact WCET unknown – not all the paths can be tested Matteo Corti, ETH Zurich, LCTES 2000 17
Page 1 and 2: Approximation of Worst-case Executi
Page 3 and 4: Environment: User Needs • Complex
Page 5 and 6: Problem Description • Admission t
Page 7 and 8: Other approaches • Longest path:
Page 9 and 10: Longest Path ... instr op op op ins
Page 11 and 12: Instruction Length • Preemption,
Page 13 and 14: Performance Monitor • Not specifi
Page 15: Cycles Per Instruction (CPI) …
Page 19 and 20: Results: Approximations • Worst c
Page 21 and 22: Results: Real Applications • Only
Page 23 and 24: Comments … • Performance monito
Page 25: Conclusions • The WCET can be app

Approximation of Worst-case Execution Time for Preemptive ...

Create successful ePaper yourself

Delete template?

Save as template?