| 摘要 |
PROBLEM TO BE SOLVED: To constitute an LSI arrangement system, which can ensure a wiring efficiency and easily satisfy delay restriction by making a partitioning processing by the use of a high-performance min-cut algorithm, while estimating increase int he length of wiring due to position restrictions. SOLUTION: Check is made as to whether a connection to be noted is a position restriction connection connected to a certain cell having position restrictions. If the connection is not a position restriction connection, an ordinary cost calculation is made based on slack. If the connection is a position restriction connection, a critical path is extracted and a mapping processing is made for the extracted critical path to calculate the cost of the critical path. Whether the processing is finished to all the nets is checked. If the processing is finished for all the nets, a partitioning processing is executed so as to minimize cost. If the partitioning processing is finished, whether partitioning is sufficiently fine is checked, and if the partitioning becomes sufficiently fine, the processing is finished.
|
