摘要
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.
基金
国家高技术研究发展计划(863计划)，国家重点基础研究发展计划(973计划)，高等学校博士学科点专项科研项目，国家自然科学基金，美国自然科学基金，清华大学校科研和教改项目
