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

ePAPER READ

DOWNLOAD ePAPER

inf.ethz.ch

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

START NOW

Longest Path ...

instr op op op

br addr

len

b

=

iter

b

⋅

∑

instr

length

instr

Matteo Corti, ETH Zurich, LCTES 2000 9

Summary Page - Department of Computer Science

Smallest Enclosing Balls - Department of Computer Science - ETH ...

Fast Robust Large-scale Mapping from Video and Internet Photo ...

Structuring Metatheory on Inductive 9eBnitions David Basin Institut ...

First Steps Towards an Infrastructure for Smart Things

A CIL Tutorial - Department of Computer Science - ETH ZÃ¼rich

Unique Sink Orientations of Cubes - Department of Computer ...

modeling of a distillation column using bond graphs - University of ...

Curriculum Vitae - Department of Computer Science - ETH ZÃ¼rich

Predictor Structure Source Compiler Object Performance Monitor Host Compiler WCET Run-time statistics Target Matteo Corti, ETH Zurich, LCTES 2000 8

Longest Path ... instr op op op instr op op op instr op op op instr op op op br addr len b = iter b ⋅ ∑ instr length instr Matteo Corti, ETH Zurich, LCTES 2000 9

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: Other approaches • Longest path:
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?