Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
Paper
A Processor Allocation Method for Time-Sharing
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. © 1970, ACM. All rights reserved.
Related
Paper
The Qx-coder
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum