A parallel algorithm of simulated annealing for multiprocessor scheduling
- 1 June 2008
- journal article
- Published by Pleiades Publishing Ltd in Journal of Computer and Systems Sciences International
- Vol. 47 (3), 455-463
- https://doi.org/10.1134/s1064230708030155
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.Keywords
This publication has 11 references indexed in Scilit:
- Parallel simulated annealing for the delivery problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The Problem of Schedule Construction in the Joint Design of Hardware and SoftwareProgramming and Computer Software, 2002
- Parallel Simulated Annealing AlgorithmsJournal of Parallel and Distributed Computing, 1996
- Implications of classical scheduling results for real-time systemsComputer, 1995
- Scheduling hard real-time systems: a reviewSoftware Engineering Journal, 1991
- Parallel simulated annealing techniquesPhysica D: Nonlinear Phenomena, 1990
- A distributed implementation of simulated annealing for the travelling salesman problemParallel Computing, 1989
- Optimization by Simulated AnnealingScience, 1983
- Preemptive Scheduling with Release Times, Deadlines, and Due TimesJournal of the ACM, 1982
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973