Premium
Job scheduling in multiprogrammed computer systems
Author(s) -
Schwetman Herbert D.
Publication year - 1978
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380080302
Subject(s) - computer science , deadline monotonic scheduling , distributed computing , rate monotonic scheduling , computer multitasking , dynamic priority scheduling , fair share scheduling , scheduling (production processes) , two level scheduling , fixed priority pre emptive scheduling , round robin scheduling , earliest deadline first scheduling , parallel computing , operating system , mathematical optimization , schedule , mathematics
The job‐scheduling function in a multiprogramming computer system plays a key role in the achievement of the performance goals for the system. It is possible and convenient to partition this scheduling function into a priority assignment function and resource assignment function. Implementation of a general purpose resource assignment module permits a large family of scheduling strategies to be implemented via different priority calculation schemes. The implications of this partitioning of the scheduling function are studied by use of a simulation model. A system embodying this approach to job scheduling is discussed as an application of the approach to other types of systems.