A generalized linear programming based approach to optimal divisible load scheduling

Authors:
D. Ghose;H. J. Kim
Affiliations:
Department of Aerospace Engineering, Indian Institute of Science, Bangalore, India;CIST, Korea University, Seoul, South Korea
Venue:
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
Year:
2006

Citing 10
Cited 0

Partitioning Techniques for Large-Grained Parallelism

IEEE Transactions on Computers
Distributed processing of divisible jobs with communication startup costs

GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
On the Influence of Start-Up Costs in Scheduling Divisible Loads on Bus Networks

IEEE Transactions on Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems

Scheduling Divisible Loads in Parallel and Distributed Systems
Ten Reasons to Use Divisible Load Theory

Computer
Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems

Cluster Computing
Scheduling Divisible Loads with Processor Release Times and Finite Size Buffer Capacity Constraints in Bus Networks

Cluster Computing
Adaptive Divisible Load Scheduling Strategies for Workstation Clusters with Unknown Network Resources

IEEE Transactions on Parallel and Distributed Systems
Design and analysis of load distribution strategies with start-up costs in scheduling divisible loads on distributed networks

Mathematical and Computer Modelling: An International Journal
Scheduling divisible loads on heterogeneous linear daisy chain networks with arbitrary processor release times

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.