首页 | 本学科首页   官方微博 | 高级检索  
     


CNB: A critical-network-based timing optimization method for standard cell global routing
Authors:Email author" target="_blank">Hong?XianLong?Email author  Jing?Tong  Xu?JingYu  Bao?HaiYun  Gu?Jun
Affiliation:(1) Department of Computer Science and Technology, Tsinghua University, 100084 Beijing, P.R. China;(2) Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong, P.R. China
Abstract:A novel method, named critical-network-based (CNB), for timing optimization in global routing is presented in this paper. The essence of this method is different from that of the typical existing ones, named nets-based (NB) and critical-path-based (CPB). The main contribution of this paper is that the CNB delay reduction method is more efficient than the typical existing ones. This new method makes it possible to reduce the delay in an overall survey. Based on CNB, a timing optimization algorithm for global routing is implemented and tested on Microelectronics Center of North Carolina (MCNC) benchmarks in this paper. The experimental results are compared between this algorithm and the existing ones. The experimental results show that this algorithm is able to control the delay efficiently.
Keywords:layout  standard cell (SC)  global routing  timing optimization  critical-network- based (CNB)
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录!
点击此处可从《计算机科学技术学报》浏览原始摘要信息
点击此处可从《计算机科学技术学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号