Idletime Scheduling with Preemption Intervals - Lars Eggert

More documents

Recommendations

Info

28 Network TCP/UDP • worst case: FG TCP vs. greedy BG UDP • PI length ~ RTT? (1.25ms minimum RTT) Lars Eggert 2005-10-26
29 Related Work • realtime systems – resource reservations • computation deadlines, predictability • network diffserv/QoS – many mechanisms • L2: drop priority flag (ATM, FR) • L3: IP TOS, diffserv, intserv, prop-share • L4: TCP-LP, TCP Nice, MulTCP • L7: Mozilla, BITS, LSAM, push-polite Lars Eggert 2005-10-26
Page 1 and 2: Idletime Scheduling with Preemption
Page 3 and 4: 3 Lars Eggert Challenges • syste
Page 5 and 6: 5 Applications & Benefits • prefe
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 30 and 31: 30 Related Work (2) • idle capaci
Page 32: 32 • generic idletime scheduler b

Idletime Scheduling with Preemption Intervals - Lars Eggert

Create successful ePaper yourself

Delete template?

Save as template?