Fan Zhang, Junwei Cao, et al.
IEEE TETC
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
Lerong Cheng, Jinjun Xiong, et al.
ASP-DAC 2008
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
Conference paper
Strong and flexible domain typing for dynamic E-business
Yigal Hoffner, Simon Field, et al.
EDOC 2004