This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Relaxing Synchronization in Distributed Simulated Annealing
February 1995 (vol. 6 no. 2)
pp. 189-195
ASCII Text
x 
 
Chul-Eui Hong, Bruce M. McMillin, "Relaxing Synchronization in Distributed Simulated Annealing," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 2, pp. 189-195, February, 1995.
 
 
BibTex
x
 
@article{ 10.1109/71.342132,
author = {Chul-Eui Hong and Bruce M. McMillin},
title = {Relaxing Synchronization in Distributed Simulated Annealing},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {6},
number = {2},
issn = {1045-9219},
year = {1995},
pages = {189-195},
doi = {http://doi.ieeecomputersociety.org/10.1109/71.342132},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - Relaxing Synchronization in Distributed Simulated Annealing
IS - 2
SN - 1045-9219
SP189
EP195
EPD - 189-195
A1 - Chul-Eui Hong,
A1 - Bruce M. McMillin,
PY - 1995
VL - 6
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 

Abstract—This paper presents a cost error measurement scheme and relaxed synchronization method, for simulated annealing on a distributed memory multicomputer, which predicts the amount of cost error that an algorithm will tolerate. An adaptive error control method is developed and implemented on an Intel iPSC/2.

Index Terms—Optimization, partial synchrony, state maintenance, cost error, parallelism, algorithms.

[1] P. Banerjee, M. H. Jones, and J. S. Sargent,“Parallel simulated annealing algorithm for cell placement on hypercube multiprocessors,”IEEE Trans. Parallel and Distrib. Syst., vol. 1, Jan. 1990.
[2] M. Durand,“Parallel simulated annealing: Accuracy versus speed in placement,”IEEE Design and Test, pp. 8–34, June 1989.
[3] L. Grover,“A new simulated annealing algorithm for standard cell placement,”inProc. Int. Conf. Comput.-Aided Design,Nov. 1986.
[4] C.-E. Hong,“Relaxing synchronization in distributed simulated annealing,”Ph.D. dissertation, Univ. Missouri-Rolla, 1992.
[5] R. Jayaraman and F. Darma,“Error tolerance in parallel simulated annealing technique,”inProc. Int. Conf. Comput. Design,1988.
[6] R. Jayaraman and R. Rutenbar,“Floorplanning by annealing on a hypercube multiprocessor,”inProc. Int. Conf. Comput.-Aided Design,1987.
[7] S. Kirkpatrick, C. D. Gellatt, Jr., and M. P. Vecci,“Optimization by simulated annealing,”Science,vol. 220, pp. 975–986, 1983.
[8] H. Lutfiyya, B. McMillin, P. Poshyanonda, and C. Dagli,“Composite stock cutting through simulated annealing,”Mathematics Computer Modeling. New York: Pergamon, vol. 16, 1992, pp. 57–74.
[9] N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller,“Equation of state calculations by fast computing machines,”J. Chem. Phys.,vol. 21, pp. 1087–1092, 1953.
[10] J. Rose, D. Blythe, W. Snelgrove, and Z. Vranesic,“Fast, high quality VLSI placement on an MIMD multiprocessor,”Proc. Int. Conf. Comput.-Aided Design,1986, pp. 42–45.
[11] J. Rose, W. Klebsch, and J. Wolf,“Temperature measurement and equilibrium dynamics of simulated annealing placement,”IEEE Trans. Comput.-Aided Design,vol. 9, Mar. 1990.
[12] S. White,“Concepts of scales in simulated annealing,”inProc. IEEE Int. Conf. Comput. Design,Port Chester, NY, Nov. 1984, pp. 646–651.

Citation:
Chul-Eui Hong, Bruce M. McMillin, "Relaxing Synchronization in Distributed Simulated Annealing," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 2, pp. 189-195, Feb. 1995, doi:10.1109/71.342132
Usage of this product signifies your acceptance of the Terms of Use.