Task assignment for minimizing application completion time using honeybee mating optimization

Effective task assignment is essential for achieving high performance in heterogeneous distributed computing systems. This paper proposes a new technique for minimizing the parallel application time cost of task assignment based on the honeybee mating optimization (HBMO) algorithm. The HBMO approach combines the power of simulated annealing, genetic algorithms, and an effective local search heuristic to find the best possible solution to the problem within an acceptable amount of computation time. The performance of the proposed HBMO algorithm is shown by comparing it with three existing task assignment techniques on a large number of randomly generated problem instances. Experimental results indicate that the proposed HBMO algorithm outperforms the competing algorithms.

[1]  Hussein A. Abbass,et al.  A True Annealing Approach to the Marriage in Honey-Bees Optimization Algorithm , 2003, Int. J. Comput. Intell. Appl..

[2]  S. Arunkumar,et al.  Genetic algorithm based heuristics for the mapping problem , 1995, Comput. Oper. Res..

[3]  Thomas Stützle,et al.  Ant colony optimization: artificial ants as a computational intelligence technique , 2006 .

[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]  Tien-Fu Chen,et al.  Branch-and-bound task allocation with task clustering-based pruning , 2004, J. Parallel Distributed Comput..

[6]  Jonathan Timmis,et al.  Theoretical advances in artificial immune systems , 2008, Theor. Comput. Sci..

[7]  Peng-Yeng Yin,et al.  A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems , 2006, Comput. Stand. Interfaces.

[8]  Peter J. Bentley,et al.  Artificial Immune Systems , 2004, Lecture Notes in Computer Science.

[9]  Chien-Chung Shen,et al.  A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion , 1985, IEEE Trans. Computers.

[10]  C. Siva Ram Murthy,et al.  Optimal task allocation in distributed systems by graph matching and state space search , 1999, J. Syst. Softw..

[11]  Mitica Craus,et al.  A Genetic Algorithm for mapping tasks in heterogeneous computing systems , 2011, 15th International Conference on System Theory, Control and Computing.

[12]  Anthony A. Maciejewski,et al.  Characterizing Task-Machine Affinity in Heterogeneous Computing Environments , 2011, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum.

[13]  Jun Gu,et al.  Efficient Local Search for DAG Scheduling , 2001, IEEE Trans. Parallel Distributed Syst..

[14]  Yskandar Hamam,et al.  Optimal Allocation of Tasks onto Networked Heterogeneous Computers Using Minimax Criterion , 2003 .

[15]  Howard Jay Siegel,et al.  Representing Task and Machine Heterogeneities for Heterogeneous Computing Systems , 2000 .

[16]  Mouloud Koudil,et al.  Using artificial bees to solve partitioning and scheduling problems in codesign , 2007, Appl. Math. Comput..

[17]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[18]  Yskandar Hamam,et al.  Task allocation for maximizing reliability of distributed systems: A simulated annealing approach , 2006, J. Parallel Distributed Comput..

[19]  Nawwaf N. Kharma,et al.  A hybrid heuristic-genetic algorithm for task scheduling in heterogeneous processor networks , 2011, J. Parallel Distributed Comput..

[20]  Ishfaq Ahmad,et al.  Optimal task assignment in heterogeneous distributed computing systems , 1998, IEEE Concurr..

[21]  Hussein A. Abbass,et al.  A Monogenous MBO Approach to Satisfiability , 2001 .

[22]  Bo Yang,et al.  Cost-oriented task allocation and hardware redundancy policies in heterogeneous distributed computing systems considering software reliability , 2009, Comput. Ind. Eng..

[23]  Yskandar Hamam,et al.  Assignment of program modules to processors: A simulated annealing approach , 2000, Eur. J. Oper. Res..

[24]  Aisha Hassan Abdalla Hashim,et al.  Execution time prediction of imperative paradigm tasks for grid scheduling optimization , 2009 .

[25]  Thomas M. Keane,et al.  Multi-heuristic dynamic task allocation using genetic algorithms in a heterogeneous distributed system , 2010, J. Parallel Distributed Comput..

[26]  Georgios Dounias,et al.  Honey bees mating optimization algorithm for the Euclidean traveling salesman problem , 2011, Inf. Sci..

[27]  Katta G. Murty,et al.  A hybrid genetic/optimization algorithm for a task allocation problem , 1999 .

[28]  Omid Bozorg Haddad,et al.  Honey-Bees Mating Optimization (HBMO) Algorithm: A New Heuristic Approach for Water Resources Optimization , 2006 .

[29]  Imtiaz Ahmad,et al.  Task assignment using a problem-space genetic algorithm , 1995, Concurr. Pract. Exp..

[30]  D. Dasgupta,et al.  Advances in artificial immune systems , 2006, IEEE Computational Intelligence Magazine.

[31]  Imtiaz Ahmad,et al.  Particle swarm optimization for task assignment problem , 2002, Microprocess. Microsystems.

[32]  H A Abbass,et al.  MARRIAGE IN HONEY-BEE OPTIMIZATION (MBO): A HAPLOMETROSIS POLYGYNOUS SWARMING APPROACH , 2001 .

[33]  Ali Maroosi,et al.  Application of honey-bee mating optimization algorithm on clustering , 2007, Appl. Math. Comput..

[34]  Graham Kendall,et al.  A honey-bee mating optimization algorithm for educational timetabling problems , 2012, Eur. J. Oper. Res..

[35]  H. Abbass.  A single queen single worker honey–bees approach to 3-SAT , 2001 .

[36]  Hussein A. Abbass,et al.  MBO: marriage in honey bees optimization-a Haplometrosis polygynous swarming approach , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[37]  Matthieu Cord,et al.  An application of swarm intelligence to distributed image retrieval , 2012, Inf. Sci..

[38]  Barry J. Adams,et al.  Honey-bee mating optimization (HBMO) algorithm for optimal reservoir operation , 2007, J. Frankl. Inst..