A Generalized Linear Programming Based Approach to Optimal Divisible Load Scheduling
In this paper we propose a general Linear Programming (LP) based formulation and solution methodology for obtaining optimal solution to the load distribution problem in divisible load scheduling. We exploit the power of the versatile LP formulation to propose algorithms that yield exact solutions to several very general load distribution problems for which either no solutions or only heuristic solutions were available. We consider both star (single-level tree) networks and linear daisy chain networks, having processors equipped with front-ends, that form the generic models for several important network topologies. We consider arbitrary processing node availability or release times and general models for communication delays and computation time that account for constant overheads such as start up times in communication and computation. The optimality of the LP based algorithms is proved rigorously.
KeywordsRelease Time Linear Programming Problem Load Distribution Timing Diagram Linear Programming Formulation
Unable to display preview. Download preview PDF.
- 3.Bharadwaj, V., et al.: Scheduling Divisible Loads in Parallel and Distributed Systems. IEEE Computer Society Press, Los Almitos (1996)Google Scholar
- 4.Drozdowski, M.: Selected Problems of Scheduling Tasks in Multiprocessor Computer Systems, Poznan University of Technology Press, Series Monographs, No. 321, Poznon, Poland (1997)Google Scholar
- 6.Robertazzi, T.: Ten reasons to use divisible load theory. IEEE Computer 36(5), 63–68 (2003)Google Scholar