论文信息 - A processor allocation method for time-sharing

A processor allocation method for time-sharing

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.

Graham C. Driscoll | Alvin P. Mullery

[1] Edward G. Coffman,et al. Analysis of Two Time-Sharing Algorithms Designed for Limited Swapping , 1968, JACM.

[2] Norman Weizer,et al. Resource management for a medium scale time-sharing operating system , 1968, CACM.

[3] Edward G. Coffman,et al. Computer scheduling methods and their countermeasures , 1968, AFIPS Spring Joint Computing Conference.

[4] Jack E. Shemer. Some Mathematical Considerations of Time-Sharing Scheduling Algorithms , 1967, JACM.

[5] C. R. Glassey,et al. Minimum Change-Over Scheduling of Several Products on One Machine , 1968, Oper. Res..