公开(公告)号：US20090193376A1

公开(公告)日：2009-07-30

申请号：US12022849

申请日：2008-01-30

申请人： Charles J. Alpert ,  Ruchir Puri ,  Shyam Ramji ,  Ashish K. Singh ,  Chin Ngai Sze

发明人： Charles J. Alpert ,  Ruchir Puri ,  Shyam Ramji ,  Ashish K. Singh ,  Chin Ngai Sze

IPC分类号： G06F17/50

CPC分类号： G06F17/5077 ,  G06F2217/62

摘要： Power, routability and electromigration have become crucial issues in modem microprocessor designs. In high performance designs, clocks are the highest consumer of power. Arranging clocking components with regularity so as to minimize the capacitance on the clock nets can help reduce clock power, however, it may hurt performance due to some loss of flexibility in physically placing those components. The present invention provides techniques to optimally place clock components in a regular fashion so as to minimize clock power within a performance constraint. A rectangular grid is created and clock distribution structures are assigned to the grid intersection points. Latches are then located around the clock distribution structures to minimize an overall distance for connections between the latches and respective clock distribution structures. The horizontal and vertical pitches of the grid may be independently adjusted to achieve a more uniform spread of the clock distribution structures.

摘要翻译： 电源，路由和电迁移已成为现代微处理器设计中的关键问题。 在高性能设计中，时钟是功耗最大的消费者。 排列时钟元件的规律性，以便最小化时钟网络上的电容可以帮助降低时钟功率，但是，由于物理放置这些组件的一些灵活性可能会损害性能。 本发明提供了以规则方式最佳地放置时钟组件以便在性能约束内最小化时钟功率的技术。 创建矩形网格，并将时钟分配结构分配给网格交点。 然后锁存器位于时钟分布结构周围，以最小化锁存器和相应时钟分配结构之间的连接的总距离。 可以独立地调整网格的水平和垂直间距以实现时钟分配结构的更均匀的扩展。

公开(公告)号：US07448007B2

公开(公告)日：2008-11-04

申请号：US11457495

申请日：2006-07-14

申请人： Charles J. Alpert ,  Arvind K. Karandikar ,  Tuhin Mahmud ,  Stephen T. Quay ,  Chin Ngai Sze

发明人： Charles J. Alpert ,  Arvind K. Karandikar ,  Tuhin Mahmud ,  Stephen T. Quay ,  Chin Ngai Sze

IPC分类号： G06F17/50 ,  G06F9/45

CPC分类号： G06F17/5045

摘要： A buffer insertion technique addresses slew constraints while minimizing buffer cost. The method builds initial solutions for the sinks, each having an associated cost, slew and capacitance. As a solution propagates toward a source, wire capacitance and wire slew are added to the solution. When a buffer is selected for possible insertion, the slew of the solution is set to zero while the cost of the solution is incremented based on the selected buffer and the capacitance is set to an intrinsic capacitance of the buffer. The solutions of two intersecting wire branches are merged by adding branch capacitances and costs, and selecting the highest branch slew. The solution sets are updated by disregarding solutions which have a slew component greater than a slew constraint, and any solution that is dominated by another solution is eliminated. The solution having the smallest cost is selected as the final solution.

摘要翻译： 缓冲插入技术解决了压摆约束，同时最大限度地减少了缓冲区成本。 该方法构建了汇的初始解决方案，每个都具有相关的成本，压摆和电容。 当解决方案向源传播时，将线电容和线压力加到解决方案中。 当选择缓冲器进行可能的插入时，将解决方案的电压设置为零，同时根据所选择的缓冲器增加解决方案的成本，并将电容设置为缓冲器的固有电容。 通过增加分支电容和成本，并选择最高的分支电压，合并两条相交线分支的解决方案。 解决方案集通过忽略具有大于压摆约束的转矩分量的解决方案来更新，并且消除由另一解决方案主导的任何解决方案。 选择具有最小成本的解决方案作为最终解决方案。

公开(公告)号：US20080016479A1

公开(公告)日：2008-01-17

申请号：US11457495

申请日：2006-07-14

申请人： Charles J. Alpert ,  Arvind K. Karandikar ,  Tuhin Mahmud ,  Stephen T. Quay ,  Chin Ngai Sze

发明人： Charles J. Alpert ,  Arvind K. Karandikar ,  Tuhin Mahmud ,  Stephen T. Quay ,  Chin Ngai Sze

IPC分类号： G06F17/50

CPC分类号： G06F17/5045

摘要： A buffer insertion technique addresses slew constraints while minimizing buffer cost. The method builds initial solutions for the sinks, each having an associated cost, slew and capacitance. As a solution propagates toward a source, wire capacitance and wire slew arc added to the solution. When a buffer is selected for possible insertion, the slew of the solution is set to zero while the cost of the solution is incremented based on the selected buffer and the capacitance is set to an intrinsic capacitance of the buffer. The solutions of two intersecting wire branches are merged by adding branch capacitances and costs, and selecting the highest branch slew. The solution sets are updated by disregarding solutions which have a slew component greater than a slew constraint, and any solution that is dominated by another solution is eliminated. The solution having the smallest cost is selected as the final solution.

摘要翻译： 缓冲插入技术解决了压摆约束，同时最大限度地减少了缓冲区成本。 该方法构建了汇的初始解决方案，每个都具有相关的成本，压摆和电容。 当解决方案向源传播时，将线电容和电线电弧加到溶液中。 当选择缓冲器进行可能的插入时，将解决方案的电压设置为零，同时根据所选择的缓冲器增加解决方案的成本，并将电容设置为缓冲器的固有电容。 通过增加分支电容和成本，并选择最高的分支电压，合并两条相交线分支的解决方案。 解决方案集通过忽略具有大于压摆约束的转矩分量的解决方案来更新，并且消除由另一解决方案主导的任何解决方案。 选择具有最小成本的解决方案作为最终解决方案。

公开(公告)号：US20140071827A1

公开(公告)日：2014-03-13

申请号：US13612392

申请日：2012-09-12

申请人： CHARLES JAY ALPERT ,  Zhuo Li ,  Chin Ngai Sze ,  Yaoguang Wei

发明人： CHARLES JAY ALPERT ,  Zhuo Li ,  Chin Ngai Sze ,  Yaoguang Wei

IPC分类号： H04W28/10

CPC分类号： H04L47/125 ,  H04L45/22 ,  H04L45/28

摘要： A method, system, and computer program product for solving a network traffic congestion problem are provided in the illustrative embodiments. Using an application executing using a processor and a memory in a data processing system, a congested network route section is selected from a set of congested network route sections. A set of congesting devices is selected, where the set of congesting devices causes congestion in the selected congested network route sections by using the selected congested network route section. A vacancy data structure corresponding to the selected congested network route section is populated. A subset of the set of the congesting devices is selected. The subset of the set of the congesting devices is rerouted to a candidate network route section identified in the vacancy data structure.

摘要翻译： 在说明性实施例中提供了用于解决网络交通拥塞问题的方法，系统和计算机程序产品。 使用在数据处理系统中使用处理器和存储器执行的应用，从一组拥塞的网络路由部分中选择拥塞的网络路由部分。 选择一组拥塞装置，其中，所述一组拥塞装置通过使用所选择的拥塞网络路由部分在所选择的拥塞网络路由部分中引起拥塞。 填充与所选择的拥塞网络路由部分相对应的空位数据结构。 选择一组拥塞装置的子集。 拥塞设备的集合的子集被重新路由到在空白数据结构中标识的候选网络路由部分。

公开(公告)号：US08443324B2

公开(公告)日：2013-05-14

申请号：US13047492

申请日：2011-03-14

申请人： Charles Jay Alpert ,  Shiyan Hu ,  Zhuo Li ,  Chin Ngai Sze

发明人： Charles Jay Alpert ,  Shiyan Hu ,  Zhuo Li ,  Chin Ngai Sze

IPC分类号： G06F17/50

CPC分类号： G06F17/5031 ,  G06F17/5077

摘要： A method, system, and computer program product for improved routing using layer ranges in the design of an integrated circuit (IC) are provided in the illustrative embodiments. Using an application executing in a data processing system, a score is computed for a net in a set of nets routed using a set of layers in the design. The set of nets is sorted according to scores associated with nets in the set of nets. A layer range from a set of layer ranges is assigned to a net in the sorted list such that a net with a higher than threshold score is assigned a high layer range.

摘要翻译： 在说明性实施例中提供了用于在集成电路（IC）的设计中使用层范围的改进路由的方法，系统和计算机程序产品。 使用在数据处理系统中执行的应用程序，计算使用设计中的一组层路由的一组网络中的网络的得分。 网络集合根据与网络集中的网络相关联的分数进行排序。 来自一组层范围的层范围被分配给排序列表中的网，使得具有高于阈值得分的网被分配高层范围。

公开(公告)号：US08831875B2

公开(公告)日：2014-09-09

申请号：US13612331

申请日：2012-09-12

申请人： Charles Jay Alpert ,  Zhuo Li ,  Chin Ngai Sze ,  Yaoguang Wei

发明人： Charles Jay Alpert ,  Zhuo Li ,  Chin Ngai Sze ,  Yaoguang Wei

IPC分类号： G01C21/00 ,  G08G1/123

CPC分类号： G08G9/00 ,  G08G1/0104

摘要： A method, system, and computer program product for solving a traffic congestion problem are provided in the illustrative embodiments. Using an application executing using a processor and a memory in a data processing system, a congested route section is selected from a set of congested route sections. A set of congesting vehicles is selected, where the set of congesting vehicles cause congestion in the selected congested route sections by being positioned on the selected congested route section. A vacancy data structure corresponding to the selected congested route section is populated. A subset of the set of the congesting vehicles is selected. The subset of the set of the congesting vehicles is rerouted to a candidate route section identified in the vacancy data structure.

摘要翻译： 在说明性实施例中提供了用于解决交通拥堵问题的方法，系统和计算机程序产品。 使用在数据处理系统中使用处理器和存储器执行的应用程序，从一组拥塞的路由部分中选择拥塞的路由部分。 选择一组拥堵车辆，其中，所述一组拥堵车辆通过定位在所选择的拥塞路线部分上而导致所选择的拥塞路线部分中的拥塞。 填充与所选择的拥塞路由部分对应的空位数据结构。 选择一组拥堵车辆的一部分。 拥挤车辆的集合的子集被重新路由到在空缺数据结构中标识的候选路线部分。

公开(公告)号：US08601425B2

公开(公告)日：2013-12-03

申请号：US13445128

申请日：2012-04-12

申请人： Charles Jay Alpert ,  Zhuo Li ,  Chin Ngai Sze ,  Yaoguang Wei

发明人： Charles Jay Alpert ,  Zhuo Li ,  Chin Ngai Sze ,  Yaoguang Wei

IPC分类号： G06F17/50

CPC分类号： G06F17/5077

摘要： A method, system, and computer program product for solving a congestion problem in an integrated circuit (IC) design are provided in the illustrative embodiments. A congested g-edge is selected from a set of congested g-edges. A set of congesting nets is selected, wherein the set of congesting nets cause congestion in the selected congested g-edges by crossing the selected congested g-edge. A vacancy data structure corresponding to the selected congested g-edge is populated. A subset of the set of the congesting nets is selected. The subset of the set of the congesting nets is rerouted to a candidate g-edge identified in the vacancy data structure.

摘要翻译： 在说明性实施例中提供了用于解决集成电路（IC）设计中的拥塞问题的方法，系统和计算机程序产品。 从一组拥塞的g边缘中选择拥塞的g边。 选择一组拥塞网络，其中所述拥塞网络集合通过穿过所选择的拥塞的g边缘而导致所选择的拥塞的g边缘中的拥塞。 填充与所选择的拥塞的g边缘对应的空位数据结构。 选择一组拥塞网络的子集。 拥塞网络集合的子集被重新路由到在空白数据结构中标识的候选g边。

公开(公告)号：US20120240093A1

公开(公告)日：2012-09-20

申请号：US13047492

申请日：2011-03-14

申请人： Charles Jay Alpert ,  Shiyan Hu ,  Zhuo Li ,  Chin Ngai Sze

发明人： Charles Jay Alpert ,  Shiyan Hu ,  Zhuo Li ,  Chin Ngai Sze

IPC分类号： G06F17/50

CPC分类号： G06F17/5031 ,  G06F17/5077

摘要： A method, system, and computer program product for improved routing using layer ranges in the design of an integrated circuit (IC) are provided in the illustrative embodiments. Using an application executing in a data processing system, a score is computed for a net in a set of nets routed using a set of layers in the design. The set of nets is sorted according to scores associated with nets in the set of nets. A layer range from a set of layer ranges is assigned to a net in the sorted list such that a net with a higher than threshold score is assigned a high layer range.

摘要翻译： 在说明性实施例中提供了用于在集成电路（IC）的设计中使用层范围的改进路由的方法，系统和计算机程序产品。 使用在数据处理系统中执行的应用程序，计算使用设计中的一组层路由的一组网络中的网络的得分。 网络集合根据与网络集中的网络相关联的分数进行排序。 来自一组层范围的层范围被分配给排序列表中的网，使得具有高于阈值得分的网被分配高层范围。

公开(公告)号：US20140074389A1

公开(公告)日：2014-03-13

申请号：US13612331

申请日：2012-09-12

申请人： Charles Jay Alpert ,  Zhuo Li ,  Chin Ngai Sze ,  Yaoguang Wei

发明人： Charles Jay Alpert ,  Zhuo Li ,  Chin Ngai Sze ,  Yaoguang Wei

IPC分类号： G08G1/00

CPC分类号： G08G9/00 ,  G08G1/0104

摘要： A method, system, and computer program product for solving a traffic congestion problem are provided in the illustrative embodiments. Using an application executing using a processor and a memory in a data processing system, a congested route section is selected from a set of congested route sections. A set of congesting vehicles is selected, where the set of congesting vehicles cause congestion in the selected congested route sections by being positioned on the selected congested route section. A vacancy data structure corresponding to the selected congested route section is populated. A subset of the set of the congesting vehicles is selected. The subset of the set of the congesting vehicles is rerouted to a candidate route section identified in the vacancy data structure.

公开(公告)号：US20130272126A1

公开(公告)日：2013-10-17

申请号：US13445150

申请日：2012-04-12

申请人： Charles Jay Alpert ,  Zhuo Li ,  Chin Ngai Sze ,  Yaoguang Wei

发明人： Charles Jay Alpert ,  Zhuo Li ,  Chin Ngai Sze ,  Yaoguang Wei

IPC分类号： H04L12/24

CPC分类号： H04L41/145 ,  H04L45/125

摘要： In congestion aware point-to-point routing using a random point in an integrated circuit (IC) design, the random point is selected in a bounding area defined in a layout of the IC design. A set of pattern routes is constructed between a source pin and a sink pin in the bounding area, a pattern route in the set of pattern routes passing through the random point. A set of congestion cost corresponding to the set of pattern routes is computed. A congestion cost in the set of congestion costs corresponds to a pattern route in the set of pattern routes. A preferred pattern route is selected from the set of pattern routes, the preferred pattern route having the smallest congestion cost in the set of congestion costs. The preferred pattern route is output as a point-to-point route between the source pin and the sink pin.

摘要翻译： 在使用集成电路（IC）设计中的随机点的拥塞感知点对点路由中，随机点在IC设计的布局中定义的边界区域中选择。 在边界区域中的源极引脚和引脚引脚之间构成一组模式路由，即通过随机点的模式路由集合中的模式路由。 计算与该组模式路由相对应的一组拥塞成本。 该拥塞成本集中的拥塞成本对应于该组模式路由中的模式路由。 从一组模式路由中选择优选模式路由，优选模式路由在拥塞成本集合中具有最小拥塞成本。 优选的模式路由作为源引脚和引脚引脚之间的点到点路由输出。