发明授权
US06915361B2 Optimal buffered routing path constructions for single and multiple clock domains systems
有权
用于单时钟和多时钟域系统的最优缓冲路由路径结构
- 专利标题: Optimal buffered routing path constructions for single and multiple clock domains systems
- 专利标题(中): 用于单时钟和多时钟域系统的最优缓冲路由路径结构
-
申请号: US10264165申请日: 2002-10-03
-
公开(公告)号: US06915361B2公开(公告)日: 2005-07-05
- 发明人: Charles Jay Alpert , Soha Hassoun
- 申请人: Charles Jay Alpert , Soha Hassoun
- 申请人地址: US NY Armonk
- 专利权人: International Business Machines Corporation
- 当前专利权人: International Business Machines Corporation
- 当前专利权人地址: US NY Armonk
- 代理商 Duke W. Yee; Casimer K. Salys; Michael R. Nichols
- 主分类号: G06F3/00
- IPC分类号: G06F3/00 ; G06F12/00 ; G06F17/50
摘要:
A method, computer program product, and data processing system for automatically designing routing paths in an integrated circuit is disclosed. The present invention allows for the design of paths that are optimal in terms of the signal delay in circuits that may require registers for signal to travel over multiple clock cycles or in circuits that may contain multiple clock domains.An integrated circuit die is modeled as a weighted grid graph in which the edges represent wire segments and the weights represent the delays associated with those wire segments. Designing for optimum delay involves finding a shortest path between two vertices in the grid graph using a modified single-source shortest path algorithm. Registers, buffers, and dual-clock domain synchronizers are modeled according to a labeling function that assigns components to selected vertices in the routing path for optimal results.
公开/授权文献
信息查询