公开(公告)号：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.

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

公开(公告)号：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设计的布局中定义的边界区域中选择。 在边界区域中的源极引脚和引脚引脚之间构成一组模式路由，即通过随机点的模式路由集合中的模式路由。 计算与该组模式路由相对应的一组拥塞成本。 该拥塞成本集中的拥塞成本对应于该组模式路由中的模式路由。 从一组模式路由中选择优选模式路由，优选模式路由在拥塞成本集合中具有最小拥塞成本。 优选的模式路由作为源引脚和引脚引脚之间的点到点路由输出。

公开(公告)号：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边。

公开(公告)号：US09106560B2

公开(公告)日：2015-08-11

申请号：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 ,  H04L12/803 ,  H04L12/707 ,  H04L12/703

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.

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

公开(公告)号：US09026976B2

公开(公告)日：2015-05-05

申请号：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分类号： G06F17/50 ,  H04L12/24 ,  H04L12/729

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设计的布局中定义的边界区域中选择。 在边界区域中的源极引脚和引脚引脚之间构成一组模式路由，即通过随机点的模式路由集合中的模式路由。 计算与该组模式路由相对应的一组拥塞成本。 该拥塞成本集中的拥塞成本对应于该组模式路由中的模式路由。 从一组模式路由中选择优选模式路由，优选模式路由在拥塞成本集合中具有最小拥塞成本。 优选的模式路由作为源引脚和引脚引脚之间的点到点路由输出。

公开(公告)号：US20130275934A1

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

申请号：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边。

公开(公告)号：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）的设计中使用层范围的改进路由的方法，系统和计算机程序产品。 使用在数据处理系统中执行的应用程序，计算使用设计中的一组层路由的一组网络中的网络的得分。 网络集合根据与网络集中的网络相关联的分数进行排序。 来自一组层范围的层范围被分配给排序列表中的网，使得具有高于阈值得分的网被分配高层范围。

公开(公告)号：US08458634B2

公开(公告)日：2013-06-04

申请号：US12912919

申请日：2010-10-27

申请人： Charles Jay Alpert ,  Zhuo Li ,  Gi-Joon Nam ,  David Anthony Papa ,  Chin Ngai Sze ,  Natarajan Viswanathan

发明人： Charles Jay Alpert ,  Zhuo Li ,  Gi-Joon Nam ,  David Anthony Papa ,  Chin Ngai Sze ,  Natarajan Viswanathan

IPC分类号： G06F17/50

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

摘要： A method, system, and computer usable program product for latch clustering with proximity to local clock buffers (LCBs) where an algorithm is used to cluster a plurality of latches into a first plurality of groups in an integrated circuit. A number of groups in the first plurality of groups of clustered latches is determined. A plurality of LCBs are added where a number of added LCBs is the same as the number of groups in the first plurality of groups. A cluster radius for a subset of the first plurality of groups of clustered latches is determined, a group in the subset having a cluster radius that is a maximum cluster radius in the subset. The plurality of latches are reclustered into a second plurality of groups responsive to the maximum cluster radius exceeding a radius threshold, the second plurality of groups exceeding the first plurality of groups by one.

摘要翻译： 一种用于与本地时钟缓冲器（LCB）接近的锁存器聚类的方法，系统和计算机可用程序产品，其中使用算法将多个锁存器聚集成集成电路中的第一组多个组。 确定第一组多个群集锁存器中的多个组。 添加多个LCB，其中添加的LCB的数量与第一组中的组的数量相同。 确定第一组多个聚集锁存器的子集的簇半径，该子集中的组具有作为该子集中的最大簇半径的簇半径。 响应于最大簇半径超过半径阈值，将多个锁存器重新聚集成第二组，第二组群超过第一组多组。