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

More documents

Recommendations

Info

Outline • Environment • Other approaches • <strong>Worst</strong>-<strong>case</strong> execution time approximation • Results • Conclusions Matteo Corti, ETH Zurich, LCTES 2000 2
Environment: User Needs • Complex mechatronic applications • Timing correctness • Concurrency (RT and non-RT tasks) • Rapid development: dynamic system • Modern programming languages • Modern processors Matteo Corti, ETH Zurich, LCTES 2000 3
Page 1: Approximation of Worst-case Executi
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 and 16: Cycles Per Instruction (CPI) …
Page 17 and 18: Testing the Predictor • First pha
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?