Placement by thermodynamic simulated annealing

被引:52
作者
de Vicente, J
Lanchares, J
Hermida, R
机构
[1] CIEMAT, Elect Lab, E-28040 Madrid, Spain
[2] Univ Complutense Madrid, Dept Arquitectura Computadores & Automat, Madrid, Spain
关键词
combinatorial optimization; simulated annealing; information theory; entropy; placement;
D O I
10.1016/j.physleta.2003.08.070
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Combinatorial optimization problems arise in different fields of science and engineering. There exist some general techniques coping with these problems such as simulated annealing (SA). In spite of SA success, it usually requires costly experimental studies in fine tuning the most suitable annealing schedule. In this Letter, the classical integrated circuit placement problem is faced by Thermodynamic Simulated Annealing (TSA). TSA provides a new annealing schedule derived from thermodynamic laws. Unlike SA, temperature in TSA is free to evolve and its value is continuously updated from the variation of state functions as the internal energy and entropy. Thereby, TSA achieves the high quality results of SA while providing interesting adaptive features. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:415 / 423
页数:9
相关论文
共 11 条
[1]  
Aarts E., 1998, SIMULATED ANNEALING
[2]  
BETZ V, 1997, P INT WORKSH FIELD P
[3]   STOCHASTIC RELAXATION, GIBBS DISTRIBUTIONS, AND THE BAYESIAN RESTORATION OF IMAGES [J].
GEMAN, S ;
GEMAN, D .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1984, 6 (06) :721-741
[4]   COOLING SCHEDULES FOR OPTIMAL ANNEALING [J].
HAJEK, B .
MATHEMATICS OF OPERATIONS RESEARCH, 1988, 13 (02) :311-329
[5]   Structure of best possible strategies for finding ground states [J].
Hoffmann, KH ;
Franz, A ;
Salamon, P .
PHYSICAL REVIEW E, 2002, 66 (04) :7
[6]   OPTIMIZATION BY SIMULATED ANNEALING [J].
KIRKPATRICK, S ;
GELATT, CD ;
VECCHI, MP .
SCIENCE, 1983, 220 (4598) :671-680
[7]   CONVERGENCE OF AN ANNEALING ALGORITHM [J].
LUNDY, M ;
MEES, A .
MATHEMATICAL PROGRAMMING, 1986, 34 (01) :111-124
[8]   ARCHITECTURE OF FIELD-PROGRAMMABLE GATE ARRAYS [J].
ROSE, J ;
ELGAMAL, A ;
SANGIOVANNIVINCENTELLI, A .
PROCEEDINGS OF THE IEEE, 1993, 81 (07) :1013-1029
[9]  
Sechen C., 1984, Proceedings of the 1984 Custom Integrated Circuits Conference, P522
[10]  
SHERWANI NA, 1999, ALGORITHMS VLSI PHYS, P226