Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
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
Conference paper
Modeling polarization for Hyper-NA lithography tools and masks
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory