Parallel simulated annealing by generalized speculative computation

Author

Sohn, Andrew ; Wu, Zhihong ; Jin, Xue

Author_Institution

Dept. of Comput. & Inf. Sci., New Jersey Inst. of Technol., Newark, NJ, USA

fYear

1993

fDate

1-4 Dec 1993

Firstpage

416

Lastpage

419

Abstract

Simulated annealing is known to be highly sequential due to loop carried dependencies. This report present a new approach to parallel simulated annealing, called generalized speculative computation (GSC). The GSC can execute n iterations in parallel while maintaining the same decision sequence as a sequential version. To demonstrate the performance of GSC, we implement 100 to 500 city Traveling Salesman Problem on the AP1000 massively parallel machine. Actual experimental results demonstrate that the GSC is highly effective for the given problem as we obtain a nearly 20-fold speedup for the initial temperature of 1 on 100 processors

Keywords

computational complexity; parallel algorithms; simulated annealing; travelling salesman problems; AP1000 massively parallel machine; Traveling Salesman Problem; generalized speculative computation; loop carried dependencies; parallel simulated annealing; Cities and towns; Computational modeling; Computer simulation; Concurrent computing; Information science; Optimization methods; Parallel machines; Simulated annealing; Temperature; Traveling salesman problems;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on

Conference_Location

Dallas, TX

Print_ISBN

0-8186-4222-X

Type

conf

DOI

10.1109/SPDP.1993.395503

Filename

395503