A Parallel Simulated Annealing Algorithm with Low Communication Overhead

IEEE Transactions on Parallel and Distributed Systems

Volumn 6, Issue 12, 1995, Pages 1226-1233

  Nabhan, Tarek M ^a   Zomaya, Albert Y ^a  

^a UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

message passing systems; Parallel algorithms; simulated annealing; speculative computation; task scheduling; traveling salesman problem

Indexed keywords

COMMUNICATION OVERHEAD; MESSAGE PASSING SYSTEMS; PARALLEL SIMULATED ANNEALING ALGORITHM; TASK SCHEDULING; TRAVELING SALESMAN PROBLEM;

CALCULATIONS; CONVERGENCE OF NUMERICAL METHODS; DATA COMMUNICATION SYSTEMS; MARKOV PROCESSES; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; SCHEDULING; SIMULATED ANNEALING;

PARALLEL ALGORITHMS;

EID: 0029512311     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.476165     Document Type: Article

References (15)

1. E.H.L. Aarts and P.J.M. van Laarhoven, “Statistical cooling: A general approach to combinatorial optimization problems,” Phillips J. of Research, vol. 40, pp. 193-226, 1985.
2. J. Barhen, “Hypercube ensembles: An architecture for intelligent robots,” Computer Architectures for Robotics and Automation, J.H. Graham, ed., pp. 195-236. New York: Gordon and Breach Science Publishers, 1987.
3. A. Casotto, F. Romeo, and A. Sangiovanni-Vincentelli, “A parallel simulated annealing algorithm for the placement of macro-cells,” IEEE Trans. Computer-Aided Design, vol. 6, pp. 838-847, 1987.
4. F. Darema, S. Kirkpatrick, and V.A. Northon, “Parallel algorithms for chip placement by simulated annealing,” IBM J. Research and Development, vol. 31, no. 3, pp. 391-402,1987.
5. G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker, Solving Problems on Concurrent Processors. Englewood Cliffs, N.J.: Prentice Hall, 1988.
6. S.A. Kravitz and R. Rutenbar, “Placement by simulated annealing on a multiprocessor,” IEEE Trans. Computer-Aided Design, vol. 6, pp. 534-549,1987.
7. M. Lundy and A. Mees, “Convergence of an annealing algorithm,” Mathematical Programming, vol. 34, pp. 111-124, 1986.
8. S. Maella and L. Grover, “Clustering based simulated annealing for standard cell placement,” Proc. 25th IEEE Design Automation Conf, pp. 312-317,1988.
9. F. Romeo and A. Sangiovanni-Vincentelli, “Probabilistic hill climbing algorithms: Properties and applications,” Proc. Chapel Hill Conf. VLSI, pp. 393-417,1985.
10. P. Roussel-Ragot and G. Dreyfus, “A problem independent parallel implementation of simulated annealing: Models and experiments,” IEEE Trans. Computer-Aided Design, vol. 9, no. 8, pp. 827-835, 1990.
11. M.P. Vecchi and S.A. Kirkpatrick, “Global wiring by simulated annealing,” IEEE Trans. Computer-Aided Design, vol. 2, no. 4, pp. 215-222, 1983.
12. E.E. Witte, “Parallel simulated annealing using speculative computation,” MSc thesis, Dept. of Computer Science, Washington Univ., 1990.
13. E.E. Witte, R.D. Chamberlain, and M.A. Franklin, “Parallel simulated annealing using speculative computation,” IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 4, pp. 483-494, Apr. 1991.
14. T.M. Nabhan, “Parallel computations for a class of time critical processes,” PhD dissertation, Electrical and Electronics Dept., Univ. of Western Australia, Perth, Australia, 1994.
15. T.M. Nabhan and A. Zomaya, “Application of parallel processing to robotic computational tasks,” Int'l J. Robotics Research, vol. 14, no. 1, pp. 76-86, Feb. 1995.