This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Simulated Annealing using Speculative Computation
October 1991 (vol. 2 no. 4)
pp. 483-494

A parallel simulated annealing algorithm that is problem-independent, maintains the serial decision sequence, and obtains speedup which can exceed log/sub 2/P on P processors is discussed. The algorithm achieves parallelism by using the concurrency technique of speculative computation. Implementation of the parallel algorithm on a hypercube multiprocessor and application to a task assignment problem are described. The simulated annealing solutions are shown to be, on average, 28% better than the solutions produced by a random task assignment algorithm and 2% better than the solutions produced by a heuristic.

[1] S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi, "Optimization by simulated annealing,"Science, vol. 220, no. 4598, pp. 671-680, May 13, 1983.
[2] C. Sechen and A. Sangiovanni-Vincentelli, "The TimberWolf Placement and Routing Package,"IEEE J. Solid-State Circuits, Vol. SC-20, No. 2, Apr. 1985, pp. 510-522.
[3] S. Geman and D. Geman, "Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-6, pp. 721-741, Nov. 1984.
[4] D. Mitra, F. Romeo, and A. Sangiovanni-Vincentelli, "Convergence and finite-time behavior of simulated annealing," inProc. 1985 Decision and Contr. Conf., Dec. 1985.
[5] R. Jayaraman and F. Darema, "Error tolerance in parallel simulated annealing techniques, " inProc. Int. Conf. Computer Design, New York, NY, Oct. 1988, pp. 545-548.
[6] 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. CAD-6, No. 5, Sept. 1987, pp. 838-847.
[7] F. Darema, S. Kirkpatrick, and V. A. Norton, "Parallel techniques for chip placement by simulated annealing," inProc. Int. Conf. Comput. Design (ICCD87), Oct. 1987, pp. 87-90.
[8] E.H.L. Aarts et al., "Parallel Implementations of the Statistical Cooling Algorithm,"Integration, Vol. 4, 1986, pp. 209-238.
[9] S. Kravitz and R. Ruttenbar, "Placement by Simulated Annealing on a Multiprocessor,"IEEE Trans. Computer-Aided Design, Vol. CAD-6, No. 4, July 1987, pp. 534-549.
[10] F. W. Burton, "Speculative computation, parallelism, and functional programming,"IEEE Trans. Comput., vol. C-34, pp. 1190-1193, Dec. 1985.
[11] J. S. Conery and D. F. Kibler, "Parallel interpretation of logic programs," inConf. Functional Program. Lung. and Compu' Architecture, Portsmouth, NH, 1981, pp. 163-170.
[12] R.D. Chamberlain et al., "Simulated Annealing on a Multiprocessor,"Proc. Int'l Conf. Computer Design, Oct. 1988, pp. 540-544.
[13] E. E. Witte, "Parallel simulated annealing using speculative computation," M.S. thesis, Dep. Comput. Sci., Washington Univ., May 1990.
[14] NCUBE Computer Systems,The NCUBE Parallel Processor.
[15] S. N. Bhatt and I. C. F. Ipsen, "How to embed trees in hypercubes," Res. Rep. YALEU/DCS/RR-443, Dep. Comput. Sci., Yale Univ., 1985.
[16] J. Ullman, "NP-complete scheduling problems,"J. Comput. Syst. Sci., vol. 10, pp. 384-393, 1975.
[17] E. G. Coffman, Jr., Ed.,Computer and Job/Shop Scheduling Theory. New York: Wiley, 1976.
[18] D. H. Cornett and M. A. Franklin, "Scheduling independent tasks with communications," inProc. 17th Allerton Conf. Commun., Contr., Comput., Oct. 1979, pp. 624-633.

Index Terms:
Index Termsproblem independent algorithm; speculative computation; parallel simulated annealingalgorithm; serial decision sequence; processors; concurrency; hypercube multiprocessor;task assignment problem; parallel algorithms; simulated annealing
Citation:
E.E. Witte, R.D. Chamberlain, M.A. Franklin, "Parallel Simulated Annealing using Speculative Computation," IEEE Transactions on Parallel and Distributed Systems, vol. 2, no. 4, pp. 483-494, Oct. 1991, doi:10.1109/71.97904
Usage of this product signifies your acceptance of the Terms of Use.