Parallel Simulated Annealing Using Speculative Computation

IEEE Transactions on Parallel and Distributed Systems

Volumn 2, Issue 4, 1991, Pages 483-494

  Witte, Ellen E ^a   Chamberlain, Roger D ^a   Franklin, Mark A ^a  

^a WASHINGTON UNIVERSITY   (United States)

Author keywords

Hypercube applications; parallel simulated annealing; speculative computation; task assignment

Indexed keywords

ALGORITHMS; FAST RESPONSE COMPUTER SYSTEMS; MULTIPROCESSING SYSTEMS; OPTIMIZATION;

COMBINATORIAL OPTIMIZATION; HYPERCUBES; PARALLEL PROCESSORS; SIMULATED ANNEALING;

PARALLEL PROCESSING SYSTEMS;

EID: 0026232409     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.97904     Document Type: Article

References (18)

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, pp. 510–522 Apr. 1985.
3. S. Geman and D. Geman, “Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAM1-6, pp. 721-741, Nov. 1984.
4. D. Mitra, F. Romeo, and A. Sangiovanni-Vincentelli, “Convergence and finite-time behavior of simulated annealing,” in Proc. 1985 Decision and Contr. Conf., Dec. 1985.
5. R. Jayaraman and F. Darema, “Error tolerance in parallel simulated annealing techniques,” in Proc. Int. Conf. Comput. Design (ICCD88), 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. Comput.-Aided Design, vol. CAD-6, pp. 838–847, Sept. 1987.
7. F. Darema, S. Kirkpatrick, and V. A. Norton, “Parallel techniques for chip placement by simulated annealing,” in Proc. Int. Conf. Comput. Design (ICCD87), Oct. 1987, pp. 87–90.
8. E. H. L. Aarts, F. M. J. de Bont, E. H. A. Habers, and P.J.M. van Laarhoven, “Parallel implementations of the statistical cooling algorithm,” Integration, VLSI J., vol. 4 pp. 209–238, 1986.
9. S. A. Kravitz and R. Rutenbar, “Placement by simulated annealing on a multiprocessor,” IEEE Trans. Comput.-Aided Design, vol. CAD-6, pp. 534–549 1987.
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,” in Proc. Conf. Functional Programming Languages and Comput. Architecture, Oct. 1981, pp. 163–170.
12. R. Chamberlain, M. Edelman, M. Franklin, and E. Witte, “Simulated annealing on a multiprocessor,” in Proc. Int. Conf. Comput. Design (ICCD88), 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,” in Proc. 17th Allerton Conf Commun., Contr., Comput., Oct. 1979, pp. 624–633.