Job scheduling based on reliability, time and cost constraints under Grid environment

The advent of Grid environments made feasible the solution of computational intensive problems in a reliable and cost-effective way. As scheduling carry out more complex and mission-critical applications, Quality of Service (QoS) analysis serves to ensure that each application meets user requirements. In that frame, author presents a novel Ant colony algorithm with a quick convergence of ant to move from source to destination which allows the mapping of job processes to Grid provided services assuring at the same time end-to-end provision of QoS (cost, makespan and reliability) based on user-defined parameters and preferences. Paper also demonstrate the operation of the implemented algorithm using three different heuristics and evaluate its effectiveness using a Grid scenario.

[1]  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..

[2]  Jizhou Sun,et al.  An Extendable Grid Simulation Environment Based on GridSim , 2003, GCC.

[3]  Keqin Li,et al.  Job scheduling and processor allocation for grid computing on metacomputers , 2005, J. Parallel Distributed Comput..

[4]  John Levine,et al.  A fast, effective local search for scheduling independent jobs in heterogeneous computing environments , 2003 .

[5]  Jizhou Sun,et al.  Ant algorithm-based task scheduling in grid computing , 2003, CCECE 2003 - Canadian Conference on Electrical and Computer Engineering. Toward a Caring and Humane Technology (Cat. No.03CH37436).

[6]  Jack J. Dongarra,et al.  Scheduling workflow applications on processors with different capabilities , 2006, Future Gener. Comput. Syst..

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

[8]  Radu Prodan,et al.  Overhead Analysis of Scientific Workflows in Grid Environments , 2008, IEEE Transactions on Parallel and Distributed Systems.

[9]  Pierluigi Ritrovato,et al.  A static mapping heuristics to map parallel applications to heterogeneous computing systems , 2005, Concurr. Comput. Pract. Exp..

[10]  Uwe Schwiegelshohn,et al.  Theory and Practice in Parallel Job Scheduling , 1997, JSSPP.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Dimosthenis Kyriazis,et al.  An innovative workflow mapping mechanism for Grids in the frame of Quality of Service , 2008, Future Gener. Comput. Syst..

[13]  Uwe Schwiegelshohn,et al.  On the Design and Evaluation of Job Scheduling Algorithms , 1999, JSSPP.

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

[15]  Hartmut Schmeck,et al.  Ant colony optimization for resource-constrained project scheduling , 2000, IEEE Trans. Evol. Comput..

[16]  Rajkumar Buyya,et al.  A taxonomy and survey of grid resource management systems for distributed computing , 2002, Softw. Pract. Exp..

[17]  Pierluigi Ritrovato,et al.  A static mapping heuristics to map parallel applications to heterogeneous computing systems: Research Articles , 2005 .

[18]  Hui Yan,et al.  An improved ant algorithm for job scheduling in grid computing , 2005, 2005 International Conference on Machine Learning and Cybernetics.

[19]  Ian T. Foster,et al.  The anatomy of the grid: enabling scalable virtual organizations , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.