完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Lin, Yen-Hung | en_US |
dc.contributor.author | Li, Yih-Lang | en_US |
dc.date.accessioned | 2018-08-21T05:56:53Z | - |
dc.date.available | 2018-08-21T05:56:53Z | - |
dc.date.issued | 2010-01-01 | en_US |
dc.identifier.issn | 0738-100X | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/146776 | - |
dc.description.abstract | Double patterning lithography (DPL) is the most feasible solution for sub-32nm nodes owing to the recurrent delay in next generation lithography. DPL attempts to decompose a single layer of one layout into two masks in order to increase pitch size and improve depth of focus (DOF). Considering DPL at detailed routing stage can improve the flexibility of layout decomposition as compared to the post-routing layout decomposition. The conflict graph proposed in [8] provides a global view of all nets in a layout to obtain a highly decomposable layout with less yield loss. However, adopting conflict graph in routing process using grid-based model or gridless model both brings huge overhead. This work presents an innovative conflict graph (ICG) to realize adopting conflict graph in a routing process. Three routing-friendly characteristics of ICG are constant-time conflict cycle detection, lazy ICG update, and light-weight routing overhead. To efficiently utilize routing resources for a crowded region, gridless models provide a better solution space than grid-based models do. This work also develops, to our knowledge, the first DPL-aware gridless detailed routing with ICG to generate a highly decomposable routing result. Moreover, greedily assigning colors for routed nets may cause unnecessary stitches or even a coloring conflict. This work presents a deferred coloring assignment-based routing flow to escape local optimum of a greedy coloring approach. Experimental results indicate that DPL-aware routing results contain no coloring conflicts, and the stitches produced by the proposed router are less than those produced by a greedy coloring approach by 41% on average with only 0.22% and 30% increment in wirelength and runtime, respectively. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Gridless Model | en_US |
dc.subject | Detailed Routing | en_US |
dc.subject | Double Patterning | en_US |
dc.title | Double Patterning Lithography Aware Gridless Detailed Routing with Innovative Conflict Graph | en_US |
dc.type | Proceedings Paper | en_US |
dc.identifier.journal | PROCEEDINGS OF THE 47TH DESIGN AUTOMATION CONFERENCE | en_US |
dc.citation.spage | 398 | en_US |
dc.citation.epage | 403 | en_US |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:000409973500075 | en_US |
顯示於類別: | 會議論文 |