Page Andrew J, Keane Thomas M, Naughton Thomas J
Wellcome Trust Sanger Institute, Wellcome Trust Genome Campus, Cambridge, CB10 1SA, UK.
J Parallel Distrib Comput. 2010 Jul;70(7):758-766. doi: 10.1016/j.jpdc.2010.03.011.
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.
我们提出了一种多启发式进化任务分配算法，用于在异构分布式系统中将任务动态映射到处理器。它利用遗传算法，并结合八种常见启发式方法，以尽量减少总执行时间。该算法对一批未映射的任务进行操作，并且可以抢先将任务重新映射到处理器。该算法已在Java分布式系统上实现，并使用来自生物信息学、生物医学工程、计算机科学和密码学领域的一组六个问题进行了评估。使用多达150个异构处理器的实验表明，该算法比其他现有最先进的启发式算法具有更高的效率。
