Tabu Search and Genetic Algorithms in Par-Synthesis of Multiprocessors Systems

M. Drabowski (Poland)


Partition at resources, task scheduling, cosynthesis, par synthesis, Tabu search


The paper includes a new model of par-synthesis (coherent co-synthesis), this is characteristic for the problems of computer system design. This paper presents the use of Tabu Search algorithm for solving the problems of coherent synthesis of computer systems. The paper includes a combined solution of both optimization of partition resources and optimization of tasks scheduling. These publications shows results of computational experiments for different instances of system synthesis problems and shows the comparison genetic algorithm with Tabu Search algorithm in par-synthesis The synergic solution is a result of cooperation between the scheduling algorithms and the algorithm responsible for resource partition. Par-synthesis may have a practical application in developing tools for computer aided rapid prototyping of such systems.

Important Links:

Go Back