Idletime Scheduling with Preemption Intervals - Lars Eggert

More documents

Recommendations

Info

4 Idletime Service • system-wide, least-priority service class • default service class = FG (inverse of traditional QoS) • in some sense, generalization of POSIX “idprio” CPU scheduling • ideal: utilize all available capacity of all resources for BG work – with zero impact on FG work • talk focuses on temporally shared resources, paper discusses ideas for spatially shared (storage) Lars Eggert 2005-10-26
5 Applications & Benefits • prefetching/caching = reduce access costs • disk: block replication, arm movement • network: IKE, DNS, PMTU, “prefetch means” • currently: conservative limits to avoid overload • system optimization & maintenance • fsck, defrag, virus scan, update, etc. • process/data migration systems • Condor, Sprite, x@home, Mether, etc. • coarse-grained, single-resource, remote benefit Lars Eggert 2005-10-26
Page 1 and 2: Idletime Scheduling with Preemption
Page 3: 3 Lars Eggert Challenges • syste
Page 7: 7 1. isolation Idletime Principles
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?