By Topic

Parallel Speculative Computation of Simulated Annealing

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
$33 $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

1 Author(s)

Simulated annealing is known to be highly sequential due to loop-carried dependencies. This report presents a new approach to parallel simulated annealing, called generalized speculative computation (GSC). We use an n-ary speculative tree and loop indices to execute n iterations in parallel on n processors while maintaining the same decision sequence as sequential simulated annealing. To verify the performance of GSC, we implement 100- to 500-city Traveling Salesman Problems on the AP1000 massively parallel multiprocessor. Execution results demonstrate that the GSC approach can indeed be an effective method for simulated annealing. We obtain over 20-fold speedup for the initial temperature of 0.1 and 11-fold speedup for the initial temperature of 10, all on 100 processors.

Published in:

Parallel Processing, 1994. ICPP 1994 Volume 3. International Conference on  (Volume:3 )

Date of Conference:

15-19 Aug. 1994