This Article 
 Bibliographic References 
 Add to: 
Parallel N-ary Speculative Computation of Simulated Annealing
October 1995 (vol. 6 no. 10)
pp. 997-1005

Abstract—Simulated annealing is known to be an efficient method for combinatorial optimization problems. Its usage for realistic problem size, however, has been limited by the long execution time due to its sequential nature. This report presents a practical approach to synchronous simulated annealing for massively parallel distributed-memory multiprocessors. We use an n-ary speculative tree to execute n different iterations in parallel on n processors, called Generalized Speculative Computation (GSC). Execution results of the 100- to 500-city Traveling Salesman Problems on the AP1000 massively parallel multiprocessor demonstrate that the GSC approach can be an effective method for parallel simulated annealing as it gave over 20-fold speedup on 100 processors.

[1] J.R.A. Allwright and D.B. Carpenter,“A distributed implementation of simulated annealing for the traveling salesman problem,” Parallel Computing 10, pp. 335-338, 1989.
[2] P. Banerjee, M.H. Jones, and J.S. Sargent, “Parallel Simulated Annealing Algorithms for Cell Placement on Hypercube Multiprocessors,” IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 1, Jan. 1990.
[3] A. Casotto,F. Romeo,, and A. Sangiovanni-Vincentelli,“A parallel simulated annealing algorithm for the placement of macro-cells,” IEEE Trans. Computer Aided Design, vol. 6, pp. 838-847, Sept. 1987.
[4] D.R. Greening, “Parallel Simulated Annealing Techniques,” Physica, vol. 42, pp. 293-306, 1990.
[5] T. Horie,K. Hayashi,T. Shimizu,, and H. Ishihata,“Improving AP1000 parallel computer performance with message communication,” Proc. ACM Int’l Symp. Computer Architecture,San Diego, Calif., pp. 314-325, May 1993.
[6] S. Kirkpatrick,C.D. Gelatt,, and M.P. Vecchi,“Optimization by simulated annealing,” Science, vol. 220, pp. 671-680, 1983.
[7] S.A. Kravitz and R.A. Rutenbar,“Placement by simulated annealing on a multiprocessor,” IEEE Trans. Computer Aided Design, vol. 6, pp. 534-549, June 1987.
[8] S.Y. Lee and K.G. Lee,“Asynchronous communication of multiple Markov chains in parallel simulated annealing,” Proc. Int’l Conf. Parallel Processing, St. Charles, Ill., pp. III169-176, Aug. 1992.
[9] N. Metropolis,A. Rosenbluth,M. Rosenbluth,A. Teller,, and E. Teller,“Equations of state calculations by fast computing machines,” J. Chemical Physics, vol. 21, pp. 1,087-1,091, 1953.
[10] W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery, Numerical Recipes in C, second ed. Cambridge Univ. Press, 1992.
[11] J.S. Rose, W.M. Snelgrove, and Z.G. Vranesic, “Parallel Cell Placement Algorithms with Quality Equivalent to Simulated Annealing,” IEEE Trans. Computer-Aided Design, vol. 7, pp. 387-396, Mar. 1988.
[12] T. Shimizu, T. Horie, and H. Ishihata, "Low-Latency Message Comm. Support for the AP1000," Proc. 19th Int'l. Symp. Computer Architecture, ACM, pp. 288-297, 1988.
[13] A. Sohn,“Parallel speculative computation of simulated annealing,” Proc. Int’l Conf. Parallel Processing,St. Charles, Ill., pp. III-8-11, Aug. 1994.
[14] E.E. Witte, R.D. Chamberlain, and M.A. Franklin, "Parallel Simulated Annealing Using Speculative Computation," IEEE Trans. Parallel and Distributed Systems, vol. 2, pp. 483-494, 1991.

Index Terms:
Parallel simulated annealing, combinatorial optimization, synchronous simulated annealing, speculative computation, Traveling Salesman Problem, simulated annealing.
Andrew Sohn, "Parallel N-ary Speculative Computation of Simulated Annealing," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 10, pp. 997-1005, Oct. 1995, doi:10.1109/71.473510
Usage of this product signifies your acceptance of the Terms of Use.