Design and evaluation of tabu search method for job scheduling in distributed environments

The efficient allocation of jobs to grid resources is indispensable for high performance grid-based applications. The scheduling problem is computationally hard even when there are no dependencies among jobs. Thus, we present in this paper a new tabu search (TS) algorithm for the problem of batch job scheduling on computational grids. We consider the job scheduling as a bi-objective optimization problem consisting of the minimization of the makespan and flowtime. The bi-objectivity is tackled through a hierarchic approach in which makespan is considered a primary objective and flowtime a secondary one. An extensive experimental study has been first conducted in order to fine-tune the parameters of our TS algorithm. Then, our tuned TS is compared versus two well known TS algorithms in the literature (one of them is hybridized with an ant colony optimization algorithm) for the problem. The computational results show that our TS implementation clearly outperforms the compared algorithms. Finally, we evaluated the performance of our TS algorithm on a new set of instances that better fits with the concept of computational grid. These instances are composed of a higher number of -heterogeneous- machines (up to 256) and emulate the dynamic behavior of these systems.

[1]  Stephen J. Wright.  Solving optimization problems on computational grids. , 2001 .

[2]  Ian Foster,et al.  The Grid 2 - Blueprint for a New Computing Infrastructure, Second Edition , 1998, The Grid 2, 2nd Edition.

[3]  Denis Trystram,et al.  Multiple Sequence Alignment and Phylogenetic Inference , 2007, Grid Computing for Bioinformatics and Computational Biology.

[4]  Ian T. Foster,et al.  The Anatomy of the Grid: Enabling Scalable Virtual Organizations , 2001, Int. J. High Perform. Comput. Appl..

[5]  Jack Dongarra,et al.  Applying NetSolve's network-enabled server , 1998 .

[6]  Ami Marowka,et al.  The GRID: Blueprint for a New Computing Infrastructure , 2000, Parallel Distributed Comput. Pract..

[7]  Bharatendu Srivastava,et al.  An effective heuristic for minimising makespan on unrelated parallel machines , 1998, J. Oper. Res. Soc..

[8]  Francine Berman,et al.  Heuristics for scheduling parameter sweep applications in grid environments , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[9]  Francine Berman,et al.  The AppLeS Parameter Sweep Template: User-Level Middleware for the Grid , 2000, ACM/IEEE SC 2000 Conference (SC'00).

[10]  Steven Hotovy,et al.  Workload Evolution on the Cornell Theory Center IBM SP2 , 1996, JSSPP.

[11]  Fatos Xhafa,et al.  Parallel Skeletons for Tabu Search Method Based on Search Strategies and Neighborhood Partition , 2001, PPAM.

[12]  Fatos Xhafa,et al.  Use of genetic algorithms for scheduling jobs in large scale grid applications , 2006 .

[13]  John Levine,et al.  A hybrid ant algorithm for scheduling independent jobs in heterogeneous computing environments , 2004 .

[14]  Sven Leyffer,et al.  Solving Large MINLPs on Computational Grids , 2002 .

[15]  Fatos Xhafa,et al.  Generic parallel implementations for Tabu search , 2006, Comput. Syst. Sci. Eng..

[16]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[17]  Enrique Alba,et al.  Efficient parallel LAN/WAN algorithms for optimization. The mallba project , 2006, Parallel Comput..

[18]  Albert Y. Zomaya,et al.  Grid Computing for Bioinformatics and Computational Biology , 2007, Wiley series on bioinformatics.

[19]  G. Wright.  Solving Optimization Problems on Computational , 2000 .

[20]  Henri Casanova,et al.  NetSolve: a network-enabled solver; examples and users , 1998, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98).

[21]  Arne Thesen,et al.  Design and Evaluation of Tabu Search Algorithms for Multiprocessor Scheduling , 1998, J. Heuristics.

[22]  Enrique Alba,et al.  Observations in using Grid-enabled technologies for solving multi-objective optimization problems , 2006, Parallel Comput..

[23]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[24]  Stephen J. Wright,et al.  Decomposition Algorithms for Stochastic Programming on a Computational Grid , 2001, Comput. Optim. Appl..

[25]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..