Parallel simulated annealing by generalized speculative computation

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