Approximation of Worst-case Execution Time for Preemptive ...
Approximation of Worst-case Execution Time for Preemptive ...
Approximation of Worst-case Execution Time for Preemptive ...
SHOW LESS
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Other approaches<br />
• Longest path:<br />
– user annotations<br />
– automatic tools (loop bounding, false paths, …)<br />
• Instruction length (w/o preemption):<br />
– cache prediction<br />
– active cache management<br />
– pipelines prediction<br />
• Dynamic systems:<br />
– trial-and-error experimentation<br />
Matteo Corti, ETH Zurich, LCTES 2000 7
Change language