Floorplanning with boundary constraints by using AE-TCG
It is practical and crucial that a designer will want to control the positions-of some modules along the chip boundary in the final packing for I/O connection. To solve the problem we propose an algorithm named Area Estimate Transitive Closure Graphs (AE-TCG). By analyzing the feasible condition of boundary constraints, AE-TCG guarantees that the result of each perturbation is a feasible placement with boundary constraints, and doesnt need to transform the infeasible solution to feasible one. Unlike most of the previous algorithms getting the target area after packing, AE-TCG can satisfy the boundary constraints and estimate the area of feasible placement without packing after random perturbation, then accept the beneficial perturbation. For the property of concentrate itself, AE-TCG is running without Simulated Annealing (SA) process. The experimental results show that AE-TCG is effective and efficient than other algorithms with boundary constraints in commonly used MCNC benchmark circuits.
design automation computer aided design floorplanning transitive closure graph area estimate
YiMing Li MingTian Zhou Yi Li
School of Computer Science and Engineering University of Electronic Science and Technology of China School of Computer Science and Engineering University of Electronic Science and Technology of China
国际会议
重庆
英文
71-75
2011-01-21（万方平台首次上网日期，不代表论文的发表时间）