Skip Navigation

The Computer Journal 1977 20(1):27-29; doi:10.1093/comjnl/20.1.27
© 1977 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Forbes, K.
Right arrow Articles by Goldsworthy, A. W.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A prescheduling algorithm—scheduling a suitable mix prior to processing

K. Forbes * and A. W. Goldsworthy *

State Government Insurance Office, G.P.O. Box 1453, Brisbane, Queensland, Australia

Scheduling algorithms within operating systems concentrate on short-term allocation of resources among a limited number of jobs. This ensures that none of these jobs has to wait inordinately long, and, at the same time, reasonably efficient use of computer resources is obtained. However, a more comprehensive approach to scheduling is necessary if the operating system scheduler is to be supplied with a mix which enables it to more effectively optimise the use of the computer resources. This paper discusses a system being implemented in the SGIO to achieve these aims.

Received March 1976.

* State Government Insurance Office, G.P.O. Box 1453, Brisbane, Queensland, Australia 4001


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.