Scheduling on a hypercube
References (9)
- et al.
An O(n log n) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube
Inform. Process. Lett.
(1990) - et al.
Preemptive scheduling of independent jobs on a hypercube
Inform. Process. Lett.
(1988) NP-complete scheduling problems
J. Comput. System. Sci.
(1975)- et al.
Introduction to Algorithms
(1990)
There are more references available in the full text version of this article.
Cited by (3)
Scheduling multiprocessor tasks - An overview
1996, European Journal of Operational ResearchScheduling independent multiprocessor tasks on a uniform k-processor system
1994, Parallel ComputingScheduling parallel tasks — algorithms and complexity
2004, Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Copyright © 1991 Published by Elsevier B.V.