A parallel algorithm of simulated annealing for multiprocessor scheduling

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.

[1]  R. Bellman.  Dynamic programming. , 1957, Science.

[2]  Philip D. Wasserman,et al.  Neural computing - theory and practice , 1989 .

[3]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[4]  A. Burns,et al.  Scheduling hard real-time systems: a review , 1991, Softw. Eng. J..

[5]  Daniel R. Greening,et al.  Parallel simulated annealing techniques , 1990 .

[6]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[7]  Eli Gafni,et al.  A Distributed Implementation of Simulated Annealing , 1989, J. Parallel Distributed Comput..

[8]  Valery A. Kostenko,et al.  The Problem of Schedule Construction in the Joint Design of Hardware and Software , 2002, Programming and Computer Software.

[9]  James R. A. Allwright,et al.  A distributed implementation of simulated annealing for the travelling salesman problem , 1989, Parallel Comput..

[10]  Charles U. Martel,et al.  Preemptive Scheduling with Release Times, Deadlines, and Due Times , 1982, JACM.

[11]  Marco Spuri,et al.  Implications of Classical Scheduling Results for Real-Time Systems , 1995, Computer.

[12]  Zbigniew J. Czech.  Parallel simulated annealing for the delivery problem , 2001, Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing.

[13]  Zbigniew Nahorski,et al.  One stage systems , 1983 .

[14]  D. Janaki Ram,et al.  Parallel Simulated Annealing Algorithms , 1996, J. Parallel Distributed Comput..

[15]  BurnsA..  Scheduling hard real-time systems , 1991 .