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

More documents

Recommendations

Info

Block Iterations • Static program analysis – loop iteration bounds • Real-time tasks are relatively well structured minimal compiler support – automatic loop bounding for simple loops – user annotations (driver calls, difficult loops, polymorphism, library calls) – user hints can be checked at run-time Matteo Corti, ETH Zurich, LCTES 2000 10
Instruction Length • Preemption, dynamic set of processes no exact knowledge of the cache and pipeline status • Maximal instruction lengths (caches are always empty, instructions always stall, ...) are not useful: the WCET is too high to be used in practice • Instruction length approximation using run-time information about the processor usage during the task’s execution Matteo Corti, ETH Zurich, LCTES 2000 11
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: Longest Path ... instr op op op ins
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 ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?