Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
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
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009