A FastAlgorithm forVLSIBuilding BlockPlacement
Feng Huang, Zhonghua Jiang · 2006
A blockplacement representation called sequence pairwasintroduced byMurata(MUR95). Manyalgorithms thatarebasedonsequence pairs usesimulated annealing wherethegeneration andevaluation ofa large numberof sequence pairs isrequired. Thispaperpresents anewap- proach toevaluate asequence pairbasedonantcolony opti- mization inapairofweighted-constraint graphs. Themethod isasignificant improvement compared totheoriginal O(M2) algorithm (MUR95). Experimental results showthatourap- proach canestimate theareaofaplacement faster. Keywords-VLSI Placement,Sequence Pair, AntColony Opti- mization, TheLongest Path