Nearly on-line scheduling of multiprocessor systems with memories☆
References (10)
- et al.
Computers and Intractability, a Guide to the Theory of NP-Completeness
(1979) - et al.
A new algorithm for preemptive scheduling of trees
J. Assoc. Comput. Mach.
(1980) - et al.
Preemptive scheduling of uniform processor systems
J. Assoc. Comput. Mach.
(1978) - et al.
Task scheduling on a multiprocessor system with independent memories
SICOMP
(1977) - et al.
Preemptive Scheduling of Uniform Machines Subject to Release Dates
There are more references available in the full text version of this article.
Cited by (0)
- ☆
The research reported here was supported, in part, by the Office of Naval Research under Contract N00014-80-C-0650.
Copyright © 1983 Published by Elsevier Inc.