| Summary: | 碩士 === 國立中正大學 === 電機工程研究所 === 104 === The routability-driven placement problem has been studied for a long period and handled by so many researches. But the solution to detailed routability-driven placement is few and even to the region constraints. The placement with region constraints is defined as a new problem formulation in this work.
In this thesis, a new solution to deal with the placement problem with region constraint and is proposed. It contains (1) region-based clustering, (2) placement sequence among different regions to handle the region constraints, (3) iterative region-based placement to break the quality limitation after placement sequence among the different regions (4) a heuristic method in the legalization stage to solve the design rules roughly. However, there are some benchmarks we could not solve effectively due to the high complexity of the designs. Although the quality of our results could not achieve to the top three teams in the ISPD 2015 Contest, our experimental results have been improved a big progress from the submitted version in the contest. And our placer also achieves the 4th total score in the ISPD 2015 Contest.
|
|---|
