Task assignment for minimizing application completion time using honeybee mating optimization

Authors:
Qinma Kang;Hong He
Affiliations:
School of Information Engineering, Shandong University, Weihai, China 264209 and State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China 100190;School of Information Engineering, Shandong University, Weihai, China 264209
Venue:
Frontiers of Computer Science: Selected Publications from Chinese Universities
Year:
2013

Citing 18
Cited 0

Genetic algorithm based heuristics for the mapping problem

Computers and Operations Research - Special issue on genetic algorithms
Optimal task allocation in distributed systems by graph matching and state space search

Journal of Systems and Software
Efficient Local Search for DAG Scheduling

IEEE Transactions on Parallel and Distributed Systems
A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems

Journal of Parallel and Distributed Computing
Optimal Task Assignment in Heterogeneous Distributed Computing Systems

IEEE Concurrency
Branch-and-bound task allocation with task clustering-based pruning

Journal of Parallel and Distributed Computing
Task allocation for maximizing reliability of distributed systems: a simulated annealing approach

Journal of Parallel and Distributed Computing
A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion

IEEE Transactions on Computers
Theoretical advances in artificial immune systems

Theoretical Computer Science
Cost-oriented task allocation and hardware redundancy policies in heterogeneous distributed computing systems considering software reliability

Computers and Industrial Engineering
A hybrid particle swarm optimization algorithm for optimal task assignment in distributed systems

Computer Standards & Interfaces
Multi-heuristic dynamic task allocation using genetic algorithms in a heterogeneous distributed system

Journal of Parallel and Distributed Computing
Honey bees mating optimization algorithm for the Euclidean traveling salesman problem

Information Sciences: an International Journal
A hybrid heuristic-genetic algorithm for task scheduling in heterogeneous processor networks

Journal of Parallel and Distributed Computing
Characterizing Task-Machine Affinity in Heterogeneous Computing Environments

IPDPSW '11 Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum
An application of swarm intelligence to distributed image retrieval

Information Sciences: an International Journal
Ant colony optimization

IEEE Computational Intelligence Magazine
Advances in artificial immune systems

IEEE Computational Intelligence Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.