Ghose, Debasish and Kim, HJ (2006) A generalized Linear Programming based approach to optimal divisible load scheduling. In: 3rd International Conference on Distributed Computing and Internet Technology,, Dec 20-23, 2006, Bhubaneswar, India, pp. 235-248.
fulltext.pdf000.pdf - Published Version
Restricted to Registered users only
Download (440Kb) | Request a copy
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.
|Item Type:||Conference Paper|
|Additional Information:||Copyright of this article belongs to Springer.|
|Department/Centre:||Division of Mechanical Sciences > Aerospace Engineering (Formerly, Aeronautical Engineering)|
|Date Deposited:||01 Sep 2010 05:22|
|Last Modified:||19 Sep 2010 06:12|
Actions (login required)