A choices implementation of the Universal Scheduling System
Leyens, Douglas Eric
This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/95780
Description
Title
A choices implementation of the Universal Scheduling System
Author(s)
Leyens, Douglas Eric
Issue Date
1989-04-24
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
M.S. (master's)
Degree Level
Thesis
Keyword(s)
Universal Scheduling System
SchedulerUSS class
Object-oriented programming
Hierarchical scheduling
List class hierarchy
Language
en
Abstract
A multiprocessor system often has more jobs ready to execute than processors available on which to run them. In such cases, some form of process scheduling is needed to determine which processes may run on which processors. This scheduling activity is similar to that of a single processor system except that in addition to a process, a processor has to be selected. There are many different scheduling policies to determine which process will execute next. The choice of the policy depends on the goals of the applications in the system. Different applications might need different policies or a single application might use different policies for different subsets of the processors.
The Universal Scheduling System (USS) described in [1][2] classifies scheduling policies according to a simple abstract model. A scheduling algorithm is specified in terms of a decision mode, a priority function, and an arbitration rule. This model makes it easy to define many different scheduling algorithms and provides a simple, efficient, and easily expandable framework for their implementations. This thesis uses the Universal Scheduling System as a model for an object-oriented implementation of schedulers in the Choices [3][4][5] operating system.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.