Job Scheduling Using Successive Linear Programming Approximations of a Sparse Model

Abstract

In this paper we tackle the well-known problem of scheduling a collection of parallel jobs on a set of processors either in a cluster or in a multiprocessor computer. For the makespan objective, i.e., the completion time of the last job, this problem has been shown to be NP-Hard and several heuristics have already been proposed to minimize the execution time. We introduce a novel approach based on successive linear programming (LP) approximations of a sparse model. The idea is to relax an integer linear program and use ℓp norm-based operators to force the solver to find almost-integer solutions that can be assimilated to an integer solution. We consider the case where jobs are either rigid or moldable. A rigid parallel job is performed with a predefined number of processors while a moldable job can define the number of processors that it is using just before it starts its execution. We compare the scheduling approach with the classic Largest Task First list based algorithm and we show that our approach provides good results for small instances of the problem. The contributions of this paper are both the integration of mathematical methods in the scheduling world and the design of a promising approach which gives good results for scheduling problems with less than a hundred processors.

A survey of cloud supporter: a load balancing framework in cloud using smartphone

“…For that we introduce an approach based on linear programming algorithm, The idea is to relax an integer number linear program and use ℓp norm-based [3] operators to force the solver to search out almost-integer solutions which will be assimilated to number solution. We have a tendency to think about the case wherever jobs are either rigid or moldable.…”