| Sign In to gain access to subscriptions and/or personal tools. |
Scheduling Multiple Divisible LoadsINSTITUTE OF COMPUTING SCIENCE POZNAN UNIVERSITY OF TECHNOLOGY, POLAND (MACIEJ.DROZDOWSKI{at}CS.PUT.POZNAN.P)
POZNAN SUPERCOMPUTING AND NETWORKING CENTER POLAND
LABORATOIRE DINFORMATIQUE DU HAVRE UNIVERSITÉ DU HAVRE, FRANCE 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.
Key Words: divisible loads scheduling computational complexity
International Journal of High Performance Computing Applications, Vol. 20, No. 1,
19-30 (2006) |
|||