GAA: A New Optimization Technique for Task Matching and Scheduling in HCSs *
Po‐Jen Chuang, Chia-Hsin Wei, Yu-Shian Chiu · 2005
A new optimization technique, called the Genetic Annealing Algorithm (GAA), is proposed in this paper to solve the task matching and scheduling problem in a heteroge-neous computing system (HCS). Simple in design and easy to implement, the GAA em-ploys only a stir operation, a novel idea based on the annealing concept, to locate opti-mal solutions for the problem. Extensive simulation runs have been conducted to evalu-ate and compare the performance of the proposed GAA with that of other optimization techniques, such as the Genetic Algorithm, Simulated Annealing, and Guided Evolu-tionary Simulated Annealing approaches. The GAA is shown to consistently perform better than the other techniques in terms of speedup, running time, cost, and complexity.