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

71Citations
Citations of this article
57Readers
Mendeley users who have this article in their library.

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. © 2010 Elsevier Inc. All rights reserved.

Cite

CITATION STYLE

APA

Page, A. J., Keane, T. M., & Naughton, T. J. (2010). Multi-heuristic dynamic task allocation using genetic algorithms in a heterogeneous distributed system. Journal of Parallel and Distributed Computing, 70(7), 758–766. https://doi.org/10.1016/j.jpdc.2010.03.011

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free