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.

[1]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[2]  Maciej Drozdowski,et al.  Selected problems of scheduling tasks in multiprocessor computer systems , 1997 .

[3]  Thomas G. Robertazzi,et al.  Ten Reasons to Use Divisible Load Theory , 2003, Computer.

[4]  Jacqueline Scherpen,et al.  Proceedings of the 1999 Conference on Information Sciences and Systems , 1999 .

[5]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Henri Casanova,et al.  A realistic network/application model for scheduling divisible loads on large-scale platforms , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[8]  Debasish Ghose,et al.  Scheduling Divisible Loads in Parallel and Distributed Systems , 1996 .

[9]  Thomas G. Robertazzi,et al.  A Multi-Job Load Sharing Strategy for Divisible Jobs on Bus Networks , 1993 .

[10]  Henri Casanova,et al.  Scheduling divisible loads on star and tree networks: results and open problems , 2005, IEEE Transactions on Parallel and Distributed Systems.

[11]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[12]  Bharadwaj Veeravalli,et al.  Efficient Scheduling Strategies for Processing Multiple Divisible Loads on Bus Networks , 2002, J. Parallel Distributed Comput..

[13]  Jacek Blazewicz,et al.  Distributed Processing of Divisible Jobs with Communication Startup Costs , 1997, Discret. Appl. Math..