DocumentCode
3485598
Title
Parallel simulated annealing for the n -queen problem
Author
Shonkwiler, Ron ; Ghannadian, Farzad ; Alford, Cecil O.
Author_Institution
Georgia Inst. of Technol., Atlanta, GA, USA
fYear
1993
fDate
13-16 Apr 1993
Firstpage
690
Lastpage
694
Abstract
A parallel simulated annealing method, IIP, is applied to the n-queen problem. By this method, identical multiple copies of the single process algorithm are independently run in parallel. This technique gives superlinear speedup, in some cases on the order of 50 using only 8 processors. Convergence to the solution exceeds 99.96% for as few as 4 processors. In addition, simulated annealing was compared with a constant temperature version of itself since the resulting homogeneous Markov chain is amendable to Perron-Frobenius analysis. The two algorithms perform similarly
Keywords
games of skill; parallel algorithms; simulated annealing; IIP; Perron-Frobenius analysis; homogeneous Markov chain; n-queen problem; parallel simulated annealing method; superlinear speedup; Analytical models; Cooling; Energy states; Mathematics; Optimization methods; Sampling methods; Simulated annealing; Stochastic processes; Temperature; Thermodynamics;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing Symposium, 1993., Proceedings of Seventh International
Conference_Location
Newport, CA
Print_ISBN
0-8186-3442-1
Type
conf
DOI
10.1109/IPPS.1993.262797
Filename
262797
Link To Document