Task Scheduling in Multiprocessing Systems
Loading...
Authors
El-Rewini, Hesham
Ali, Hesham H.
Lewis, Ted
Subjects
Advisors
Date of Issue
1995-12
Date
Publisher
Language
Abstract
Jobs needing to be processed in a manufacturing plant, bank customers
waiting to be served by tellers, aircraft waiting for landing
clearances, and program tasks to be run on a parallel or distributed
computer: What do these situations have in common? They all encounter
the scheduling problem that emerges whenever there is a choice concerning
the order in which tasks can be performed and the assignment
of tasks to servers for processing. In general, the scheduling problem
assumes a set of resources and a set of consumers serviced by those
resources according to a certain policy. The nature of the consumers and
resources as well as the constraints on them affect the search for an efficient
policy for managing the way consumers access and use the resources
to optimize some desired performance measure. Thus, a scheduling system
comprises a set of consumers, a set of resources, and a scheduling
policy.
Type
Article
Description
Series/Report No
Department
Computer Science (CS)
Organization
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.