Idletime Scheduling with Preemption Intervals - Lars Eggert

More documents

Recommendations

Info

6 Lars Eggert Goals • ideal: utilize all available capacity of all resources for BG work with zero impact on FG • difficult: high preemption costs without hardware support, always some preemption costs • primary goal: minimize FG impact • or people won’t use it • secondary goal: reasonable BG throughput 2005-10-26
7 1. isolation Idletime Principles • BG side effects interfere with FG • can affect FG correctness & performance 2. prioritization • never serve BG if FG queued 3. preemptability • preempt/abort BG when FG arrives • preemption cost – main factor delaying FG Lars Eggert 2005-10-26
Page 1 and 2: Idletime Scheduling with Preemption
Page 3 and 4: 3 Lars Eggert Challenges • syste
Page 5: 5 Applications & Benefits • prefe
Page 10: 10 Lars Eggert Idea • work conse
Page 13 and 14: 13 Idletime Scheduler • priority
Page 15 and 16: 15 shorter PI utilize more idle cap
Page 17 and 18: 17 Lars Eggert Long PIs • too lo
Page 20 and 21: 20 Implementation • localized mod
Page 22 and 23: 22 • FG/BG throughput Lars Eggert
Page 24 and 25: 24 Lars Eggert Disk Setup • UFS
Page 26 and 27: 26 Network Setup • direct, isolat
Page 28 and 29: 28 Network TCP/UDP • worst case:
Page 30 and 31: 30 Related Work (2) • idle capaci
Page 32: 32 • generic idletime scheduler b

Idletime Scheduling with Preemption Intervals - Lars Eggert

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?