Title: Fast and Efficient Algorithm for Large Scale Global Placement
Speaker: Tao Lin, ECpE Graduate Student
Advisor: Chris Chu, Professor
Abstract: Placement has significant impact on chip performance and it is considered as one of the most important problems in electronic design automation. It is a NP-hard optimization problem. Although it has been investigated in the last two decades, faster and more efficient algorithms are still in urgent need to catch up with the continuously increasing scale of chip. In my thesis, a new placement engine is proposed and it is extended to consider routability. The experimental results over contest benchmarks verify its efficiency. Besides, parallelism is also explored to further speedup this engine in order to satisfy industrial request.