A processor allocation method for time-sharing

A. P. Mullery, Graham C. Driscoll

Communications of the ACM · 1970 · 11 citations · 4 references

DOIFull text

Open access

Concepts

Abstract

A scheduling algorithm is proposed which is intended to minimize changes of tasks on processors and thereby reduce overhead. The algorithm also has application to more general resource allocation problems. It is implemented by means of a method for efficiently handling dynamically changing segmented lists.

References

4