Thomas M. Cheng
IT Professional
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
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002