Scheduling for a share of the machine
作者:
J. Larmouth,
期刊:
Software: Practice and Experience
(WILEY Available online 1975)
卷期:
Volume 5,
issue 1
页码: 29-49
ISSN:0038-0644
年代: 1975
DOI:10.1002/spe.4380050105
出版商: John Wiley&Sons, Ltd.
关键词: Scheduling;Priority;Queues;Deadline‐scheduling
数据来源: WILEY
摘要:
AbstractThis paper describes the mechanism used to schedule jobs and control machine use on the IBM 370/165 at Cambridge University, England. The same algorithm is currently being used in part at the University of Bradford, and implementations are in progress at the Universities of Leeds, Salford and Liverpool for the ICL 1900 series machines. The mechanism relies on allocating a share of the machine to each user (or project), and then varying the turnround time for jobs according to whether the project in question is over‐ or under‐using its share of the machine. The approach is believed to be an original one, having a number of advantages over more conventional scheduling and control algorit
点击下载:
PDF
(1253KB)
返 回