Implementing lottery scheduling: Matching the specializations in traditional schedulers

Proceedings of the 1999 USENIX Annual Technical Conference

Volumn , Issue , 1999, Pages

  Petrou, David ^a   Milford, John W ^b   Gibson, Garth A ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b NERSC ^*

Author keywords

[No Author keywords available]

Indexed keywords

LOCKS (FASTENERS); PROCESS CONTROL;

LOCK CONTENTIONS; LOTTERY SCHEDULING; PERFORMANCE ASSURANCES; PROCESS EXECUTION; PROCESS SCHEDULER; PRODUCTION MACHINES; PROPORTIONAL-SHARE; RESOURCE MANAGEMENT ALGORITHMS;

SCHEDULING;

EID: 85084160584     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Andrea C. Arpaci-Dusseau and David E. Culler. Extending Proportional-Share Scheduling to a Network of Workstations. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'97), June 1997.
2. D. L. Black. Processors, priority, and policy: Mach scheduling for new environments. In Proceedings of the USENIX 1991 Winter Conference, pages 1-12, January 1991.
3. R. W. Conway, W. L. Maxwell, and L. W. Miller. Theory of Scheduling. Addison-Wesley, Reading, 1967.
4. Fernando J. Corbató, Marjorie Merwin-Daggett, and Robert C. Daley. An experimental time-sharing system. In Proceedings of the 1962 AFIPS Spring Joint Computer Conference, Volume 21, pages 335-344, May 1962.
5. Raymond B. Essick. An event-based fair share scheduler. In Proceedings of the Winter 1990 USENIX Conference, pages 147-162. USENIX, January 1990.
6. Steve Evans, Kevin Clarke, Dave Singleton, and Bart Smaalders. Optimizing Unix Resource Scheduling for User Interaction. In Proceedings of the 1993 Summer USENIX, pages 205-218. USENIX, June 1993.
7. The FreeBSD Operating System, 1999. See http://www.-freebsd.org/.
8. Berny Goodheart and James Cox. The Magic Garden Explained: The Internals of UNIX System V Release 4, an Open Systems Design. Prentice-Hall, 1994.
9. Joseph L. Hellerstein. Achieving Service Rate Objectives with Decay Usage Scheduling. IEEE Transactions on Software Engineering, 19(8):813-825, August 1993.
10. Kevin Jeffay, F. Donelson Smith, Arun Moorthy, and James Anderson. Proportional share scheduling of operating system services for real-time applications. In Proceedings of the 19th IEEE Real-Time Systems Symposium, December 1998.
11. L. Kleinrock. A continuum of time-sharing scheduling. In Proceedings of the AFIPS Spring Joint Computer Conference, pages 453-458, 1970.
12. J. Larmouth. Scheduling for immediate turnround. Software-Practice and Experience, 8(5):559-578 September/October 1978.
13. J. M. McKinney. A survey of analytical time-sharing models. ACM Computing Surveys, 1, 2:105-116, 1969.
14. Marshall Kirk McKusick, Keith Bostic, Michael J. Karels, and John S. Quarterman. The Design and Implementation of the 4.4BSD Operating System. Addison-Wesley Publishing Company, Inc., 1996.
15. Ben Shneiderman. Designing the User Interface: Strategies for Effective Human-Computer Interaction. Addison-Wesley Publishing Co., 2nd edition, 1992.
16. David C. Steere, Ashvin Goel, Joshua Gruenberg, Dylan McNamee, Calton Pu, and Jonathan Walpole. A feedback-driven proportion allocator for real-rate scheduling. In Proceedings of the 3rd Symposium on Operating Systems Design and Implementation (OSDI), February 1999.
17. Ion Stoica, Hussein Abdel-Wahab, Kevin Jeffay, Sanjoy Baruah, Johannes Gehrke, and C. Greg Plaxton. A Proportional Share Resource Allocation Algorithm for Real-Time, Time-Shared Systems. In IEEE Real-Time Systems Symposium, December 1996.
18. Jeffrey H. Straathof, Ashok K. Thareja, and Ashok K. Agrawala. UNIX scheduling for large systems. In Proceedings of the USENIX 1986 Winter Conference, pages 111-139. USENIX, Winter 1986.
19. David G. Sullivan, Robert Haas, and Margo I. Seltzer. Tickets and currencies revisited: Extensions to multi-resource lottery scheduling. In Proceedings of the 7th Workshop on Hot Topics in Operating Systems (HotOS-VII), March 1999.
20. Carl A. Waldspurger. Lottery and Stride Scheduling: Flexible Proportional-Share Resource Management. PhD thesis, Massachusetts Institute of Technology, September 1995.
21. Carl A. Waldspurger and William E. Weihl. Lottery Scheduling: Flexible Proportional-Share Resource Management. In Proceedings of the 1st USENIX Symposium on Operating Systems Design and Implementation (OSDI), pages 1-11, November 14-17 1994.
22. Carl A. Waldspurger and William E. Weihl. Stride Scheduling: Deterministic Proportional-Share Resource Mangement. Technical Report MIT/LCS/TM-528, Massachusetts Institute of Technology, MIT Laboratory for Computer Science, June 1995.