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

More documents

Recommendations

Info

Environment: System • XOberon: – Loading/unloading of modules (tasks) at runtime – Deadline driven scheduler with admission testing – Resources are shared between RT and non-RT tasks – Preemptive scheduling • Modern RISC processors: PowerPC 604e • Modern language: Oberon-2 – Automatic garbage collection – Strong type checking Matteo Corti, ETH Zurich, LCTES 2000 4
Problem Description • Admission test – deadline: determined by the problem – max. duration: determined by the task and the system • Preemptive scheduling and processor complexity hinder a precise computation of the worst-case execution time (WCET) • The system is able to stop safely if the given duration is to small (w/o damaging the robot or the operator) Matteo Corti, ETH Zurich, LCTES 2000 5
Page 1 and 2: Approximation of Worst-case Executi
Page 3: Environment: User Needs • Complex
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?