The International Journal of High Performance Computing Applications · 2006 · 13 citations · 11 references
ComputingComputer EngineeringComputer ScienceAlgorithmsInterconnection NetworksSchedulingResource SchedulingScheduling TheoryTask SchedulingWorkload SchedulingLoad RedistributionLoad-aware SchedulingMultiprocessor SchedulingPolynomial Time ComplexityPolynomial-time AlgorithmsScheduling In Multiprocessor Systems
In this paper we study the scheduling of multiple divisible loads on a star network of processors. We show that this problem is computationally hard. Special cases solvable in polynomial time are identified.
11
Scheduling: Theory, Algorithms, and Systems
Michael Pinedo · IIE Transactions · 1996 · 6.3K citations
Research feature - Ten reasons to use divisible load theory
Thomas G. Robertazzi · Computer · 2003 · 261 citations