Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
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
Soft x-ray diffraction of striated muscle
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989
Kento Tsubouchi, Yosuke Mitsuhashi, et al.
npj Quantum Information
Daniel M. Bikel, Vittorio Castelli
ACL 2008