Integer Linear Programming-based ECO Approach with Wire Length Consideration
碩士 === 中原大學 === 資訊工程研究所 === 98 === In the VLSI design process, a design implementation often needs to be corrected because of new specifications or design constraint violations. We usually use Engineering Change Ordering to reduce the cost. This paper identifies an integer linear programming-based a...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/95374683043709747648 |
| Summary: | 碩士 === 中原大學 === 資訊工程研究所 === 98 === In the VLSI design process, a design implementation often needs to be corrected because of new specifications or design constraint violations. We usually use Engineering Change Ordering to reduce the cost.
This paper identifies an integer linear programming-based approach regarding the spare cells selection as the problem of resource allocation. The objective aims to search the spare cell assignment with minimization of total wire length. A novel wire length estimation method is proposed to speedup the runtime of the ILP-based approach. In the proposed method, only the middle point of the interconnection and the spare cells are considered to obtain the spare cell assignment with the minimization of total ECO wire length. The circuit characteristics, including the demand of each engineering change ordering and the supply of spare cell resource, could be successfully integrated into the ILP formulations. Experimental results showed that the proposed integer linear programming-based approach significantly minimized the total wire length.
|
|---|