Quantcast

A parallel algorithm of simulated annealing for multiprocessor scheduling

Research paper by A. V. Kalashnikov, V. A. Kostenko

Indexed on: 05 Jul '08Published on: 05 Jul '08Published in: Journal of Computer and Systems Sciences International



Abstract

Algorithms of simulated annealing for solving problems of multiprocessor scheduling are considered, an approach to parallelization is proposed, and the results of comparisons between the classical sequential, sequential, and parallel algorithms of simulated annealing using a partition of the initial space of solutions into regions are presented.