Chemical Reaction Optimization for the Grid Scheduling Problem

Grid computing collects geographically dispersed resources ranging from laptops to supercomputers to compute tasks requested by clients. Grid scheduling, i.e., assigning tasks to resources, is an NP-hard problem, and thus, metaheuristic methods are employed to find the optimal solutions. In this paper, we propose a Chemical Reaction Optimization (CRO) algorithm for the grid scheduling problem. CRO is a population-based metaheuristics mimicking the interactions between molecules in a chemical reaction. We compare the CRO approach with four generally acknowledged metaheuristics, and show that CRO performs the best.

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

[2]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[3]  Francisco Vilar Brasileiro,et al.  Trading Cycles for Information: Using Replication to Schedule Bag-of-Tasks Applications on Computational Grids , 2003, Euro-Par.

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

[5]  David Abramson,et al.  High performance parametric modeling with Nimrod/G: killer application for the global grid? , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[6]  Filippo Menczer,et al.  Emerging small-world referral networks in evolutionary labor markets , 2001, IEEE Trans. Evol. Comput..

[7]  Krishna P. Gummadi,et al.  Measurement and analysis of online social networks , 2007, IMC '07.

[8]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[9]  Jon M. Kleinberg,et al.  Query incentive networks , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[10]  Fatos Xhafa,et al.  Meta-heuristics for Grid Scheduling Problems , 2008 .

[11]  Howard Jay Siegel,et al.  Task execution time modeling for heterogeneous computing systems , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[12]  Stefano Battiston,et al.  A model of a trust-based recommendation system on a social network , 2006, Autonomous Agents and Multi-Agent Systems.

[13]  Jun Zhang,et al.  SWIM: fostering social network based information search , 2004, CHI EA '04.

[14]  Bart Selman,et al.  Referral Web: combining social networks and collaborative filtering , 1997, CACM.

[15]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[16]  Hongbo Liu,et al.  Nature inspired meta-heuristics for grid scheduling: single and multi-objective optimization approaches , 2008 .

[17]  Ajith Abraham,et al.  Scheduling Jobs on Computational Grids Using Fuzzy Particle Swarm Algorithm , 2006, KES.

[18]  Rajkumar Buyya,et al.  Peer-to-peer-based resource discovery in global grids: a tutorial , 2008, IEEE Communications Surveys & Tutorials.

[19]  Victor O. K. Li,et al.  Chemical-Reaction-Inspired Metaheuristic for Optimization , 2010, IEEE Transactions on Evolutionary Computation.

[20]  Stefka Fidanova,et al.  Simulated Annealing for Grid Scheduling Problem , 2006, IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing (JVA'06).

[21]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.

[22]  G. Theraulaz,et al.  Inspiration for optimization from social insect behaviour , 2000, Nature.

[23]  M E J Newman,et al.  Identity and Search in Social Networks , 2002, Science.

[24]  Lik Mui,et al.  A Computational Model of Trust and Reputation for E-businesses , 2002 .

[25]  R. Buyya,et al.  A Study on Peer-to-Peer Based Discovery of Grid Resource Information , 2006 .

[26]  G. Sumathi,et al.  Priority Based Scheduling for Heterogeneous Grid Environments , 2006, 2006 10th IEEE Singapore International Conference on Communication Systems.

[27]  Antonio Capone,et al.  Scheduling Optimization in wireless MESH Networks with Power Control and Rate Adaptation , 2006, 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks.

[28]  Kamran Zamanifar,et al.  A Novel Particle Swarm Optimization Approach for Grid Job Scheduling , 2009, ICISTM.

[29]  Vito Latora,et al.  Impact of altruism on opportunistic communications , 2009, 2009 First International Conference on Ubiquitous and Future Networks.

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

[31]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[32]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

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

[34]  Rodrigo Fernandes de Mello,et al.  On Simulated Annealing for the Scheduling of Parallel Applications , 2008, 2008 20th International Symposium on Computer Architecture and High Performance Computing.

[35]  Victor O. K. Li,et al.  Scheduling algorithms in broadband wireless networks , 2001, Proc. IEEE.

[36]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[37]  Shajulin Benedict,et al.  Threshold Accepting Scheduling Algorithm for Scientific Workflows in Wireless Grids , 2008, 2008 Fourth International Conference on Networked Computing and Advanced Information Management.

[38]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.