@inproceedings{330c5a3180ad4da9ae3324ec76dfad78,

title = "Parallel simulated annealing by generalized speculative computation",

abstract = "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). While the conventional binary speculative computation can execute a maximum of (log n) iterations in parallel on n processors, 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.",

author = "Andrew Sohn and Zhihong Wu and Xue Jin",

year = "1993",

language = "English (US)",

isbn = "081864222X",

series = "Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing",

publisher = "Publ by IEEE",

pages = "416--419",

editor = "Anon",

booktitle = "Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing",

note = "Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing ; Conference date: 01-12-1993 Through 04-12-1993",

}