Probabilistic optimization for FPGA board level routing problems

被引:3
作者
He, F [1 ]
Song, XY
Gu, M
Yang, GW
Hung, WNN
Sun, JG
机构
[1] Tsing Hua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China
[2] Tsing Hua Univ, Sch Software, Beijing 100084, Peoples R China
[3] Univ Portland, Dept Elect & Comp Engn, Portland, OR 97203 USA
关键词
board-level routing; Chernoff bound; field programmable gate array (FPGA); randomized rounding;
D O I
10.1109/TCSII.2005.859569
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Field programmable gate arrays (FPGAs) are an enabling technology in circuit designs. We consider the board-level multi-terminal net assignment in the FPGA-based logic emulation. A novel probabilistic optimization method is devised for solving the net assignment problem. The approach incorporates randomized rounding, genetic algorithm, and solution-improvement strategies. Experimental results demonstrate promising performance.
引用
收藏
页码:264 / 268
页数:5
相关论文
共 11 条
[1]  
Brown S. D., 1992, FIELD PROGRAMMABLE G
[2]   A MEASURE OF ASYMPTOTIC EFFICIENCY FOR TESTS OF A HYPOTHESIS BASED ON THE SUM OF OBSERVATIONS [J].
CHERNOFF, H .
ANNALS OF MATHEMATICAL STATISTICS, 1952, 23 (04) :493-507
[3]  
EJNIOUI A, 1999, P ACM INT S FPGA MON
[4]  
GOEMANS MX, 1993, SIAM J DISCR MATH
[5]   Multiterminal net assignments by scatter search [J].
Gu, M ;
He, F ;
Song, XY ;
Sun, JG .
MATHEMATICAL AND COMPUTER MODELLING, 2005, 41 (8-9) :997-1004
[6]  
HE F, 2005, PROBABILISTIC OPTIMI
[7]  
MAK WK, 1997, IEEE T COMPUT AIDED, V16
[8]  
Motwani Rajeev, 1995, RANDOMIZED ALGORITHM
[9]   RANDOMIZED ROUNDING - A TECHNIQUE FOR PROVABLY GOOD ALGORITHMS AND ALGORITHMIC PROOFS [J].
RAGHAVAN, P ;
THOMPSON, CD .
COMBINATORICA, 1987, 7 (04) :365-374
[10]  
SHMANEKADI M, 1994, P ACM SIGDA INT WORK