首页> 外文会议>ACM/IEEE Design Automation Conference >Double Patterning Lithography Aware Gridless Detailed Routing with Innovative Conflict Graph
【24h】

Double Patterning Lithography Aware Gridless Detailed Routing with Innovative Conflict Graph

机译:双重图案化光刻意识到无线网络详细路由与创新冲突图

获取原文

摘要

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.
机译:双图案化光刻(DPL)是由于下一代光刻中的复发延迟的子32nm节点最可行的解决方案。 DPL尝试将单层一个布局分解成两个掩模,以增加间距尺寸并改善焦点(DOF)。考虑到详细路由阶段的DPL可以提高布局分解的灵活性,与路由后布局分解相比。 [8]中提出的冲突图提供了布局中所有网的全局视图,以获得高度可分解的布局,含量较少。但是,采用使用基于网格的模型或无缝模型的路由过程中的冲突图都带来了巨大的开销。这项工作介绍了一个创新的冲突图(ICG),以实现在路由过程中采用冲突图。 ICG的三个路由友好特征是恒定冲突循环检测,懒惰的ICG更新和轻量级路由开销。为了有效地利用用于拥挤区域的路由资源,无缝的模型提供比基于网格的模型更好的解决方案。这项工作还开发了我们的知识,第一个使用ICG的DPL感知无线网络详细路由,以产生高度可分解的路由结果。此外,用于路由网的贪婪分配颜色可能导致不必要的缝线甚至着色冲突。这项工作介绍了一种基于延迟的着色分配的路由流,以逃避贪婪着色方法的局部最佳。实验结果表明,DPL感知路由结果不含着色冲突,并且由拟议路由器产生的针迹小于通过贪婪着色方法产生的41%,平均只有0.22%和30%的Wirelength和运行时间增加了41%,分别。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号