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
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
William Hinsberg, Joy Cheng, et al.
SPIE Advanced Lithography 2010
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007