Multi-heuristic dynamic task allocation using genetic algorithms in a heterogeneous distributed system

Authors:
Andrew J. Page;Thomas M. Keane;Thomas J. Naughton
Affiliations:
Wellcome Trust Sanger Institute, Wellcome Trust Genome Campus, Cambridge, CB10 1SA, UK;Wellcome Trust Sanger Institute, Wellcome Trust Genome Campus, Cambridge, CB10 1SA, UK;Department of Computer Science, National University of Ireland, Maynooth, Co.Kildare, Ireland and University of Oulu, RFMedia Laboratory, Oulu Southern Institute, Vierimaantie 5, 84100 Ylivieska, ...
Venue:
Journal of Parallel and Distributed Computing
Year:
2010

Citing 19
Cited 3

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
A study of permutation crossover operators on the traveling salesman problem

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs to Multiprocessors

IEEE Transactions on Parallel and Distributed Systems
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors

Journal of the ACM (JACM)
Genetic Scheduling for Parallel Processor Systems: Comparative Studies and Performance Issues

IEEE Transactions on Parallel and Distributed Systems
Dynamic mapping of a class of independent tasks onto heterogeneous computing systems

Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Benchmarking and comparison of the task graph scheduling algorithms

Journal of Parallel and Distributed Computing
Observations on Using Genetic Algorithms for Dynamic Load-Balancing

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
A Genetic Algorithm for Multiprocessor Scheduling

IEEE Transactions on Parallel and Distributed Systems
A Framework for Reinforcement-Based Scheduling in Parallel Processor Systems

IEEE Transactions on Parallel and Distributed Systems
Distributed Java Platform with Programmable MIMD Capabilities

FIDJI '01 Revised Papers from the International Workshop on Scientific Engineering for Distributed Java Applications
Computing with Heterogeneous Parallel Machines: Advantages and Challenges

ISPAN '96 Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks
DSEARCH: sensitive database searching using distributed computing

Bioinformatics
DPRml: distributed phylogeny reconstruction by maximum likelihood

Bioinformatics
Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing

IEEE Transactions on Computers
Distributed Monte Carlo simulation of light transportation in tissue

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
A public key cryptosystem and a signature scheme based on discrete logarithms

IEEE Transactions on Information Theory
Multiprocessor scheduling with interprocessor communication delays

Operations Research Letters

Population-based metaheuristics for tasks scheduling in heterogeneous distributed systems

NMA'10 Proceedings of the 7th international conference on Numerical methods and applications
Self Adaptive Particle Swarm Optimization for Efficient Virtual Machine Provisioning in Cloud

International Journal of Intelligent Information Technologies
Task assignment for minimizing application completion time using honeybee mating optimization

Frontiers of Computer Science: Selected Publications from Chinese Universities

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a multi-heuristic evolutionary task allocation algorithm to dynamically map tasks to processors in a heterogeneous distributed system. It utilizes a genetic algorithm, combined with eight common heuristics, in an effort to minimize the total execution time. It operates on batches of unmapped tasks and can preemptively remap tasks to processors. The algorithm has been implemented on a Java distributed system and evaluated with a set of six problems from the areas of bioinformatics, biomedical engineering, computer science and cryptography. Experiments using up to 150 heterogeneous processors show that the algorithm achieves better efficiency than other state-of-the-art heuristic algorithms.