Idletime Scheduling with Preemption Intervals - Lars Eggert
Idletime Scheduling with Preemption Intervals - Lars Eggert
Idletime Scheduling with Preemption Intervals - Lars Eggert
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.
18<br />
Effective PI Lengths<br />
• factors: resource, workload, user policy<br />
• lower bound: create FG burst length > 1<br />
• otherwise: no cost amortization<br />
• upper bound: FG inter-arrival gap<br />
• otherwise: BG starvation<br />
<strong>Lars</strong> <strong>Eggert</strong> <br />
2005-10-26
Change language