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

More documents

Recommendations

Info

Comments • Simple approach: minimal user interaction needed (suitable for application experts) • No special hardware tools needed • Useful in complexenvironments with preemptive multitasking (dynamic constellation of real-time tasks) • Big and real applications can be analyzed Matteo Corti, ETH Zurich, LCTES 2000 24
Conclusions • The WCET can be approximated using run-time data – little or no user assistance is required • Processor’s performance monitors can help in program analysis – better support desirable • Approximations are good enough for many dynamic real-time systems Matteo Corti, ETH Zurich, LCTES 2000 25
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 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: Comments … • Performance monito

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

Create successful ePaper yourself

Delete template?

Save as template?