A parallel algorithm of simulated annealing for multiprocessor scheduling

Journal of Computer and Systems Sciences International

Volumn 47, Issue 3, 2008, Pages 455-463

  Kalashnikov, A V ^a   Kostenko, V A ^a  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ANNEALING; MULTIPROCESSING SYSTEMS; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; SCHEDULING; STEEL ANALYSIS; TREES (MATHEMATICS);

MULTI PROCESSOR SCHEDULING; PARALLELIZATION;

SIMULATED ANNEALING;

EID: 46749149639     PISSN: 10642307     EISSN: None     Source Type: Journal    
DOI: 10.1134/S1064230708030155     Document Type: Article

References (19)

1. Ph. D. Wasserman, Neural Computing: Theory and Practice (Van Nostrand, New York, 1988; Mir, Moscow, 1992).
2. V. A. Kostenko and A. V. Kalashnikov, "Investigation of Different Modifications of Simulated Annealing Methods for Solving the Problem of Constructing Multiprocessor Scheduling," in Proceedings of 7th International Conference on Discrete Models in the Theory of Controlling Systems, Moscow, Russia, 2007 (MAKS Press, Moscow, 2006) [in Russian].
3. R. L. Smelyanskii, "A Model of Functioning Distributed Computational Systems," Vestn. MGU. Ser, 15.
4. V. S. Tanaev, V. S. Gordon, and Ya. M. Shafranskii, "Scheduling Theory. One-Stage Systems," (Nauka, Moscow, 1984) [in Russian].
5. C. L. Liu and J. W. Layland, "Scheduling Algorithms for Multiprogramming in Hard Real-Time Environment," J. ACM 20(1), 46-61 (1973).
6. B. Marte, "Preemptive Scheduling with Release Times, Deadlines and Due Times," J. ACM 29(3), 812-829 (1982).
7. R. Bellman, Dynamic Programming (Princeton Univ. Press, Princeton, 1957; Inostrannaya Literatura, Moscow, 1960.
8. A. Burns, "Scheduling Hard Real-Time Systems: A Review," Software Eng. J. 6(3), 116-128 (1991).
9. J. A. Stankovic, Implications of Classical Scheduling Results for Real-Time Systems (IEEE Computer Society Press, 1995).
10. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by Simulated Annealing," Sci., No. 4598 (1983).
11. V. A. Kostenko, "The Problem of Schedule Construction in the Joint Design of Hardware and Software," Programmirovanie, No. 3 (2002)
12. [Program. Comput. Software 28 (3), 162-173 (2002)].
13. A. V. Kalashnikov, "An Algorithm for Computing the difference between Schedules," in Proceedings of 2nd All-Russian Conference on Data Processing Methods and Tools, Moscow, Russia, 2005 (KS Press, Moscow, 2005), pp. 546-552 [in Russian].
14. D. R. Greening, "Parallel Simulated Annealing Techniques," Emergent Computation, 293-306 (1991).
15. G. C. Gomez, "A General Interface for Distributed and Sequential Simulated Annealing," Qualifier II Research, Purdue University (1994).
16. Z. J. Czech, "Parallel Simulated Annealing for the Delivery Problem," in Proceedings of 9th Euromicro Workshop on Parallel and Distributed Processing, 2001.
17. R. D. Janaki and T. H. Sreenivas, "Ganapathy Subramaniam K. Parallel Simulated Annealing Algorithms," J. Parallel and Distributed Computing, No. 37, 207-212 (1996).
18. J. Allwright and D. Carpenter, "A Distributed Implementation of Simulated Annealing for Traveling Salesman Problem," Parallel Computing, No. 3, 335-338 (1989).
19. V. Barbosa and E. Gafni, "A Distributed Implementation of Simulated Annealing," J. Parallel Distributed Computing, 411-433 (1989).