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

More documents

Recommendations

Info

Issues • Static program analysis – automatic loop bounding – false paths – infeasible paths • Instruction length computation – caches (instruction and data) – pipelines Matteo Corti, ETH Zurich, LCTES 2000 6
Other approaches • Longest path: – user annotations – automatic tools (loop bounding, false paths, …) • Instruction length (w/o preemption): – cache prediction – active cache management – pipelines prediction • Dynamic systems: – trial-and-error experimentation Matteo Corti, ETH Zurich, LCTES 2000 7
Page 1 and 2: Approximation of Worst-case Executi
Page 3 and 4: Environment: User Needs • Complex
Page 5: Problem Description • Admission t
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?