A task-scheduling algorithm for a multiprogramming computer system

Authors:
K. L. Krause;V. Y. Shen;H. D. Schwetman
Affiliations:
Air Force Weapons Laboratory, Kirtland AFB, Albuquerque, NM;Purdue University, West Lafayette, Indiana;Purdue University, West Lafayette, Indiana
Venue:
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
Year:
1973

Citing 4
Cited 3

Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems

Journal of the ACM (JACM)
Memory Requirements in a Multiprocessing Environment

Journal of the ACM (JACM)
The working set model for program behavior

Communications of the ACM
Analysis of computer scheduling with memory constraints.

Analysis of computer scheduling with memory constraints.

Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems

Journal of the ACM (JACM)
An Algorithm to Design the Memory Configuration of a Computer Network

Journal of the ACM (JACM)
Scheduling independent processors with different storage capacities

ACM '74 Proceedings of the 1974 annual conference - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a description and analysis of a task scheduling algorithm which is applicable to third generation computer systems. The analysis is carried out using a model of a computer system having several identical task processors and a fixed amount of memory. The algorithm schedules tasks having different processor-time and memory requirements. The goal of the algorithm is to produce a task schedule which is near optimal in terms of the time required to process all of the tasks. An upper bound on the length of this schedule is the result of deterministic analysis of the algorithm. Computer simulations demonstrate the applicability of the algorithm in actual systems, even when some of the basic assumptions are violated.