Hybrid Meta-Heuristics Algorithms for Task Assignment in Heterogeneous Computing Systems

S Salcedo-Sanz, Yong Xu, Xin Yao

Research output: Contribution to journalArticle

58 Citations (Scopus)


In this paper we tackle the task assignment problem (TSAP) in heterogeneous computer systems. The TSAP consists of assigning a given distributed computer program formed by a number of tasks to a number of processors, subject to a set of constraints, and in such a way a given cost function to be minimized. We introduce a novel formulation of the problem, in which each processor is limited in the number of task it can handle, due to the so called resource constraint. We propose two hybrid meta-heuristic approaches for solving this problem. Both hybrid approaches use a Hopfield neural network to solve the problem's constraints, mixed with a genetic algorithm (GA) and a simulated annealing for improving the quality of the solutions found. We test the performance of the proposed algorithms in several computational TSAP instances, using a GA with a penalty function and a GA with a repairing heuristic for comparison purposes. We will show that both meta-heuristics approaches are very good approaches for solving the TSAP. (c) 2004 Elsevier Ltd. All rights reserved.
Original languageEnglish
Pages (from-to)820-835
Number of pages16
JournalComputers & Operations Research
Issue number3
Publication statusPublished - 1 Mar 2006


  • simulated annealing
  • meta-heuristics
  • genetic algorithms
  • task assignment
  • heterogeneous computer systems


Dive into the research topics of 'Hybrid Meta-Heuristics Algorithms for Task Assignment in Heterogeneous Computing Systems'. Together they form a unique fingerprint.

Cite this