Building block layout by parallel simulated annealing algorithms

被引:0
作者
Luo, QL [1 ]
Hong, XL [1 ]
Dong, SQ [1 ]
Zhou, Q [1 ]
机构
[1] Tsing Hua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China
来源
2004 INTERNATIONAL CONFERENCE ON COMMUNICATION, CIRCUITS, AND SYSTEMS, VOLS 1 AND 2: VOL 1: COMMUNICATION THEORY AND SYSTEMS - VOL 2: SIGNAL PROCESSING, CIRCUITS AND SYSTEMS | 2004年
关键词
Building Block Layout; simulated annealing; parallel algorithms; sequence-pair;
D O I
10.1109/ICCCAS.2004.1346403
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The Building Block Layout (BBL) becomes a more and more important approach for VLSI physical design. In this paper, based on the BBL floorplan problem, we discussed several parallel Simulated Annealing (SA) strategies. Two parallel simulated annealing algorithms are realized, using sequence-pair (SP) as the representation. Parallel algorithm can be used either to speed up a problem or to achieve a higher accuracy of solutions to a problem. In this work we are interested in the latter goal. The results from the experiment indicate that the proposed method parallelizes the routine of state transitions in SA to obtain better states efficiently.
引用
收藏
页码:1262 / 1265
页数:4
相关论文
共 10 条
[1]   GENETIC PLACEMENT [J].
COHOON, JP ;
PARIS, WD .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1987, 6 (06) :956-964
[2]   BLOCK PLACEMENT WITH A BOLTZMANN MACHINE [J].
DEGLORIA, A ;
FARABOSCHI, P ;
OLIVIERI, M .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1994, 13 (06) :694-701
[3]  
KANG LS, 1994, NONNUMERICAL ALGORIT
[4]   OPTIMIZATION BY SIMULATED ANNEALING [J].
KIRKPATRICK, S ;
GELATT, CD ;
VECCHI, MP .
SCIENCE, 1983, 220 (4598) :671-680
[5]   CONVERGENCE OF AN ANNEALING ALGORITHM [J].
LUNDY, M ;
MEES, A .
MATHEMATICAL PROGRAMMING, 1986, 34 (01) :111-124
[6]   EQUATION OF STATE CALCULATIONS BY FAST COMPUTING MACHINES [J].
METROPOLIS, N ;
ROSENBLUTH, AW ;
ROSENBLUTH, MN ;
TELLER, AH ;
TELLER, E .
JOURNAL OF CHEMICAL PHYSICS, 1953, 21 (06) :1087-1092
[7]   VLSI module placement based on rectangle-packing by the sequence-pair [J].
Murata, H ;
Fujiyoshi, K ;
Nakatake, S ;
Kajitani, Y .
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1996, 15 (12) :1518-1524
[8]  
Murata H., 1997, Proceedings of the ASP-DAC '97. Asia and South Pacific Design Automation Conference 1997 (Cat. No.97TH8231), P625, DOI 10.1109/ASPDAC.1997.600346
[9]  
Reeves C.R., 1995, Modern Heuristic Techniques for Combinatorial Problems
[10]   SIMULATED ANNEALING ALGORITHMS - AN OVERVIEW [J].
RUTENBAR, RA .
IEEE CIRCUITS & DEVICES, 1989, 5 (01) :19-26