Transcription of Scheduling: Proportional Share
{{id}} {{{paragraph}}}
9 scheduling : Proportional ShareIn this chapter, we ll examine a different type of scheduler known as aproportional-sharescheduler, also sometimes referred to as afair-sharescheduler. Proportional - Share is based around a simple concept:insteadof optimizing for turnaround or response time, a scheduler might insteadtry to guarantee that each job obtain a certain percentage of excellent early example of Proportional - Share scheduling isfoundin research by Waldspurger and Weihl [WW94], and is known aslotteryscheduling; however, the idea is certainly older [KL88]. The basic ideais quite simple: every so often, hold a lottery to determine which processshould get to run next; processes that should run more often should begiven more chances to win the lottery.
SCHEDULING: PROPORTIONAL SHARE 5 1 10 100 1000 0.0 0.2 0.4 0.6 0.8 1.0 Job Length Fairness Figure 9.2: Lottery Fairness Study To make this process most efficient, it might generally be best to or-ganize the list in sorted order, from the highest number of tickets to the
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}