Scheduling Multiple Divisible Loads

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

• Type: Journal
• Year: 2006
• Where: IJHPCA
• Authors: Maciej Drozdowski, Marcin Lawenda, Frédéric Guinand
• Keywords: Divisible Loads, IJHPCA 2006, Multiple Divisible Loads, Star Network