By Topic

Massively parallel simulated annealing embedded with downhill-a SPMD algorithm for cluster computing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Zhihui Du ; Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China ; Sanli Li ; Shuyou Li ; Mengyue Wu
more authors

Simulated Annealing (SA) is a frequently used stochastic algorithm to deal with combinatorial optimization problems and it converges with probability infinitely close to 1. SA is an NP algorithm and the long executive time prevents it from being accepted for many real-time applications. This paper presents a SPMD (Single Program Multiple Data) algorithm which combines SA with local searching algorithm-downhill. The hybrid method not only keeps the convergence of SA but also improves the convergence speed of SA. Approximate solutions can be found quickly for complex optimization problems and more precise solutions can also be found by employing the same algorithm to fine-tune the approximate solutions. SA is an essential serial algorithm, but the SPMD algorithm breaks up the serial bottleneck of SA and its performance scales up linearly with the increase of processors, at the same time, the SPMD algorithm does not require careful choice of control parameters. Application cases show that the algorithm is robust and it can find high quality solution with high speed

Published in:

Cluster Computing, 1999. Proceedings. 1st IEEE Computer Society International Workshop on

Date of Conference:

1999