David Petrou, John W. Milford, and Garth A. Gibson. Implementing lottery scheduling: Matching the specialisations in traditional schedulers. In Proceedings of the 1999 USENIX Technical Conference, pages 1-14, Monterey, CA, USA, June 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....in one currency, are converted into the base currency. This is shown in Figure 3.1, with the number of base tickets shown in brackets. 300(600) 10(40) 90(360) 1000 200(400) Root User1 Thread 2 User 2 Thread 1 Figure 3. 1: Lottery scheduling This scheme has been implemented in FreeBSD[PMG99] with slight modi cations. The modi cations introduced in this paper are such that nice semantics can be achieved, essentially by modifying the number of (user) tickets that a process receives. Although this system allows hierarchical scheduling and proportional share scheduling, it only gives ....

David Petrou, John W. Milford, and Garth A. Gibson. Implementing lottery scheduling: Matching the specialisations in traditional schedulers. In Proceedings of the 1999 USENIX Technical Conference, pages 1-14, Monterey, CA, USA, June 1999.

.... OS schedulers provide an opaque interface to application developers (e.g. priority values, period) Such an interface is unable to capture the increasing complexity of application requirements [13] Finally, an application may alternate between several computing behaviors during its lifetime [23] (e.g. interactive, CPU bound, I O bound) This unpredictability makes it difficult to build a clairvoyant scheduler that is able to identify behavioral changes and to adapt its operation accordingly. It is thus important that applications provide additional information so as to enhance the ....

....infrastructures. These approaches provided specific scheduling properties as well as adaptive scheduling strategies [9, 20, 26] For example, fair share schedulers [11, 14] enable unbiased CPU distribution and cumulative service guarantees [4] Hierarchical [10] and proportional share schedulers [23, 34] enforce load insulation, which allows for firewall protection among different schedulers. Beyond properties, other proposals such as rate controlled [36] and progress based schedulers [8, 28] provide additional support for adaptation by allowing applications to regulate their CPU use through the ....

David Petrou, John W. Milford, and Garth A. Gibson. Implementing lottery scheduling: Matching the specializations in traditional schedulers. In Proceedings of the USENIX Annual Technical Conference (USENIX-99), pages 1--14, Berkeley, CA, June 6--11 1999.

....to warp: it brings the effective deadline of an unblocking thread Chapter 2. A Survey of Multimedia Programming Models 15 warp values will, on average, be dispatched more quickly by BVT, but no bound on scheduling latency has been shown. The hybrid lottery scheduler described by Petrou et al. [71] automatically provides improved response time for interactive applications this is an important specialization for using proportional share schedulers in real situations. Other proportional share algorithms bound the allocation error of threads that they schedule this a necessary condition ....

....3.4. Other classes of schedulers that provide no guarantees to applications include feedback and progress based schedulers, hybrid real time schedulers such as SMART [67] and modified proportional share schedulers like BVT [20] and the modified Lottery scheduler developed by Petrou et al. [71]. The common theme across all of these schedulers is that they attempt to provide high value across the set of all running applications by dynamically allocating CPU time to where it is believed to be needed most. Because these schedulers retain the freedom to dynamically reallocate CPU time, they ....

[Article contains additional citation context not shown here]

David Petrou, John W. Milford, and Garth A. Gibson. Implementing Lottery Scheduling: Matching the Specializations in Traditional Schedulers. In Proc. of the USENIX 1999 Annual Technical Conf., pages 1--14, Monterey, CA, June 1999.

....blocked, increasing the chances that it will be scheduled when it wakes up. Nemesis provides a latency hint that is similar to warp: it brings the effective deadline of an unblocking thread closer, making it more likely to be scheduled. The hybrid lottery scheduler described by Petrou et al. [19] automatically provides improved response time for interactive applications. Without admission control, proportional share schedulers will not be able to guarantee that any particular application will receive even its minimum CPU requirement during overload. Therefore, proportional share ....

David Petrou, John W. Milford, and Garth A. Gibson. Implementing Lottery Scheduling: Matching the Specializations in Traditional Schedulers. In Proc. of the USENIX 1999 Annual Technical Conf., pages 1--14, Monterey, CA, June 1999.

....Nob97] Our extended lottery scheduling framework lets applications coordinate their resource usage with each other, as well as with the system as a whole. Besides Waldspurger s own prototypes, others have implemented portions of the lottery scheduling framework [Arp97, Nie97] Petrou et al. [Pet99] retrofitted lottery scheduling into FreeBSD to schedule the CPU, extending the framework to better support interactive jobs. VINO currently has a small, 10 ms quantum, so such extensions have not been needed in our prototype. Petrou et al. also suggest an alternative approach to overcoming the ....

Petrou, D., Milford, J., Gibson, G., "Implementing Lottery Scheduling: Matching the Specializations in Traditional Schedulers," Proc. of the USENIX 1999 Annual Tech. Conference, June 1999.

....Our extended framework provides added flexibility through ticket exchanges, and through the utility that we use to emulate the semantics of nice. Besides Waldspurger s own prototypes, others have implemented portions of the lottery scheduling framework [Arp97, Nie97] In particular, Petrou et al. [Pet99] retrofitted lottery scheduling into FreeBSD to schedule the CPU, extending the framework to better support interactive jobs. VINO currently has a small, 10 ms quantum (as compared to FreeBSD s 100 ms one) so such extensions have not been needed in our prototype. Petrou et al. also suggest an ....

Petrou, D., Milford, J., Gibson, G., "Implementing Lottery Scheduling: Matching the Specializations in Tradi- 17 tional Schedulers," Proc. of the USENIX 1999 Annual Technical Conference, June 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC