-
1.发明授权Method and apparatus for preventing starvation in a slotted ring data communications network 失效用于防止在时隙环数据通信网络中的饥饿的方法和装置公开(公告)号：US07760669B2
公开(公告)日：2010-07-20
申请号：US11426746
申请日：2006-06-27
IPC分类号： H04L12/43
CPC分类号： H04L12/4035 , H04L12/423
摘要： In a slotted ring network, a node may transmit a non-renewable slot reservation with any unreserved slot. The reservation restricts other nodes from transmitting a new packet in the slot. When the slot returns around the ring to the reserving node, the slot will be available. Preferably, reservation is made responsive to a starvation condition in the reserving node, which may be detected in any of various ways. In an optional enhancement, a reservation identifies the reserving node, and another node on the ring is free to transmit a new packet in the reserved slot if the new packet will reach its destination at or before the reserving node, and thus will not interfere with the reservation.
摘要翻译： 在时隙环网络中，节点可以用任何未预留的时隙发送不可更新的时隙预留。 该预约限制其他节点在时隙中发送新的分组。 当插槽返回环到保留节点时，插槽将可用。 优选地，响应于预留节点中的饥饿状况做出预约，其可以以各种方式中的任一种来检测。 在可选增强中，预留识别预留节点，并且如果新分组将在保留节点处或之前到达其目的地，则环上的另一个节点可以自由地在保留时隙中发送新分组，并且因此不会干扰 预订。
-
2.发明授权Structure for preventing starvation in a slotted ring data communications network 失效用于在时隙环数据通信网络中防止饥饿的结构公开(公告)号：US07826399B2
公开(公告)日：2010-11-02
申请号：US12042612
申请日：2008-03-05
IPC分类号： H04L12/43
CPC分类号： H04L12/4035 , H04L12/66
摘要： A design structure is provided for a slotted ring network, in which a node may transmit a non-renewable slot reservation with any unreserved slot. The reservation restricts other nodes from transmitting a new packet in the slot. When the slot returns around the ring to the reserving node, the slot will be available. Preferably, reservation is made responsive to a starvation condition in the reserving node, which may be detected in any of various ways. In an optional enhancement, a reservation identifies the reserving node, and another node on the ring is free to transmit a new packet in the reserved slot if the new packet will reach its destination at or before the reserving node, and thus will not interfere with the reservation.
摘要翻译： 为时隙环网提供了一种设计结构，其中节点可以用任何未预留的时隙发送不可再生的时隙预留。 该预约限制其他节点在时隙中发送新的分组。 当插槽返回环到保留节点时，插槽将可用。 优选地，响应于预留节点中的饥饿状况做出预约，其可以以各种方式中的任一种来检测。 在可选增强中，预留识别预留节点，并且如果新分组将在保留节点处或之前到达其目的地，则环上的另一个节点可以自由地在保留时隙中发送新分组，并且因此不会干扰 预订。
-
3.发明申请Method and Apparatus for Preventing Starvation in a Slotted Ring Data Communications Network 失效用于在开槽环数据通信网络中预防饥饿的方法和装置公开(公告)号：US20070297441A1
公开(公告)日：2007-12-27
申请号：US11426746
申请日：2006-06-27
IPC分类号： H04L12/43
CPC分类号： H04L12/4035 , H04L12/423
摘要： In a slotted ring network, a node may transmit a non-renewable slot reservation with any unreserved slot. The reservation restricts other nodes from transmitting a new packet in the slot. When the slot returns around the ring to the reserving node, the slot will be available. Preferably, reservation is made responsive to a starvation condition in the reserving node, which may be detected in any of various ways. In an optional enhancement, a reservation identifies the reserving node, and another node on the ring is free to transmit a new packet in the reserved slot if the new packet will reach its destination at or before the reserving node, and thus will not interfere with the reservation.
摘要翻译： 在时隙环网络中，节点可以用任何未预留的时隙发送不可更新的时隙预留。 该预约限制其他节点在时隙中发送新的分组。 当插槽返回环到保留节点时，插槽将可用。 优选地，响应于预留节点中的饥饿状况做出预约，其可以以各种方式中的任一种来检测。 在可选增强中，预留识别预留节点，并且如果新分组将在保留节点处或之前到达其目的地，则环上的另一个节点可以自由地在保留时隙中发送新分组，并且因此不会干扰 预订。
-
4.发明申请Structure for Preventing Starvation in a Slotted Ring Data Communications Network 失效在一个开槽环数据通信网络中预防饥饿的结构公开(公告)号：US20080159176A1
公开(公告)日：2008-07-03
申请号：US12042612
申请日：2008-03-05
IPC分类号： H04L12/28
CPC分类号： H04L12/4035 , H04L12/66
摘要： A design structure is provided for a slotted ring network, in which a node may transmit a non-renewable slot reservation with any unreserved slot. The reservation restricts other nodes from transmitting a new packet in the slot. When the slot returns around the ring to the reserving node, the slot will be available. Preferably, reservation is made responsive to a starvation condition in the reserving node, which may be detected in any of various ways. In an optional enhancement, a reservation identifies the reserving node, and another node on the ring is free to transmit a new packet in the reserved slot if the new packet will reach its destination at or before the reserving node, and thus will not interfere with the reservation.
摘要翻译： 为时隙环网提供了一种设计结构，其中节点可以用任何未预留的时隙发送不可再生的时隙预留。 该预约限制其他节点在时隙中发送新的分组。 当插槽返回环到保留节点时，插槽将可用。 优选地，响应于预留节点中的饥饿状况做出预约，其可以以各种方式中的任一种来检测。 在可选增强中，预留识别预留节点，并且如果新分组将在保留节点处或之前到达其目的地，则环上的另一个节点可以自由地在保留时隙中发送新分组，并且因此不会干扰 预订。
-
5.发明申请Secondary Cache Memory With A Counter For Determining Whether to Replace Cached Data 审中-公开具有用于确定是否替换缓存数据的计数器的二级缓存内存公开(公告)号：US20120124291A1
公开(公告)日：2012-05-17
申请号：US12946883
申请日：2010-11-16
申请人： Heather D. Achilles , Timothy Hume Heil , Anil Krishna , Nicholas David Lindberg , Steven Paul VanderWiel , Shaul Yifrach
发明人： Heather D. Achilles , Timothy Hume Heil , Anil Krishna , Nicholas David Lindberg , Steven Paul VanderWiel , Shaul Yifrach
IPC分类号： G06F12/08
CPC分类号： G06F12/0897 , G06F12/0888 , G06F12/122
摘要： A selective cache includes a set configured to receive data evicted from a number of primary sets of a primary cache. The selective cache also includes a counter associated with the set. The counter is configured to indicate a frequency of access to data within the set. A decision whether to replace data in the set with data from one of the primary sets is based on a value of the counter.
摘要翻译： 选择性高速缓存包括被配置为接收从主要高速缓存的多个主组驱逐的数据的集合。 选择性高速缓存还包括与该组相关联的计数器。 计数器被配置为指示访问集合内的数据的频率。 是否使用来自主要集合之一的数据替换集合中的数据的决定是基于计数器的值。
-
公开(公告)号：US08495334B2
公开(公告)日：2013-07-23
申请号：US13021756
申请日：2011-02-06
IPC分类号： G06F12/10
CPC分类号： G06F17/30985 , G06F12/10
摘要： A pattern matching accelerator (PMA) for assisting software threads to find the presence and location of strings in an input data stream that match a given pattern. The patterns are defined using regular expressions that are compiled into a data structure comprised of rules subsequently processed by the PMA. The patterns to be searched in the input stream are defined by the user as a set of regular expressions. The patterns to be searched are grouped in pattern context sets. The sets of regular expressions which define the pattern context sets are compiled to generate a rules structure used by the PMA hardware. The rules are compiled before search run time and stored in main memory, in rule cache memory within the PMA or a combination thereof. For each input character, the PMA executes the search and returns the search results.
摘要翻译： 模式匹配加速器（PMA），用于帮助软件线程查找匹配给定模式的输入数据流中字符串的存在和位置。 使用正则表达式定义模式，该正则表达式被编译成由PMA随后处理的规则组成的数据结构。 在输入流中要搜索的模式由用户定义为一组正则表达式。 要搜索的模式分组在模式上下文集中。 编译定义模式上下文集的正则表达式集合，以生成PMA硬件使用的规则结构。 该规则在搜索运行时间之前被编译并存储在主存储器中，在PMA内的规则高速缓冲存储器中或其组合中。 对于每个输入字符，PMA执行搜索并返回搜索结果。
-
公开(公告)号：US20120204000A1
公开(公告)日：2012-08-09
申请号：US13021756
申请日：2011-02-06
IPC分类号： G06F12/10
CPC分类号： G06F17/30985 , G06F12/10
摘要： A pattern matching accelerator (PMA) for assisting software threads to find the presence and location of strings in an input data stream that match a given pattern. The patterns are defined using regular expressions that are compiled into a data structure comprised of rules subsequently processed by the PMA. The patterns to be searched in the input stream are defined by the user as a set of regular expressions. The patterns to be searched are grouped in pattern context sets. The sets of regular expressions which define the pattern context sets are compiled to generate a rules structure used by the PMA hardware. The rules are compiled before search run time and stored in main memory, in rule cache memory within the PMA or a combination thereof. For each input character, the PMA executes the search and returns the search results.
摘要翻译： 模式匹配加速器（PMA），用于帮助软件线程查找匹配给定模式的输入数据流中字符串的存在和位置。 使用正则表达式定义模式，该正则表达式被编译成由PMA随后处理的规则组成的数据结构。 在输入流中要搜索的模式由用户定义为一组正则表达式。 要搜索的模式分组在模式上下文集中。 编译定义模式上下文集的正则表达式集合，以生成PMA硬件使用的规则结构。 该规则在搜索运行时间之前被编译并存储在主存储器中，在PMA内的规则高速缓冲存储器中或其组合中。 对于每个输入字符，PMA执行搜索并返回搜索结果。
-
8.发明授权公开(公告)号：US07739477B2
公开(公告)日：2010-06-15
申请号：US11733520
申请日：2007-04-10
申请人： Jeffrey Powers Bradford , Jason Nathaniel Dale , Kimberly Marie Fernsler , Timothy Hume Heil , James Allen Rose
发明人： Jeffrey Powers Bradford , Jason Nathaniel Dale , Kimberly Marie Fernsler , Timothy Hume Heil , James Allen Rose
CPC分类号： G06F12/1036 , G06F2212/652
摘要： Page size prediction is used to predict a page size for a page of memory being accessed by a memory access instruction such that the predicted page size can be used to access an address translation data structure. By doing so, an address translation data structure may support multiple page sizes in an efficient manner and with little additional circuitry disposed in the critical path for address translation, thereby increasing performance.
摘要翻译： 页面大小预测用于预测由存储器访问指令访问的存储器页面的页面大小，使得可以使用预测的页面大小来访问地址转换数据结构。 通过这样做，地址转换数据结构可以以有效的方式支持多个页面大小，并且在关键路径中设置少量额外的电路用于地址转换，从而提高性能。
-
9.发明授权公开(公告)号：US07284112B2
公开(公告)日：2007-10-16
申请号：US11035556
申请日：2005-01-14
申请人： Jeffrey Powers Bradford , Jason Nathaniel Dale , Kimberly Marie Fernsler , Timothy Hume Heil , James Allen Rose
发明人： Jeffrey Powers Bradford , Jason Nathaniel Dale , Kimberly Marie Fernsler , Timothy Hume Heil , James Allen Rose
CPC分类号： G06F12/1036 , G06F2212/652
摘要： Page size prediction is used to predict a page size for a page of memory being accessed by a memory access instruction such that the predicted page size can be used to access an address translation data structure. By doing so, an address translation data structure may support multiple page sizes in an efficient manner and with little additional circuitry disposed in the critical path for address translation, thereby increasing performance.
摘要翻译： 页面大小预测用于预测由存储器访问指令访问的存储器页面的页面大小，使得可以使用预测的页面大小来访问地址转换数据结构。 通过这样做，地址转换数据结构可以以有效的方式支持多个页面大小，并且在关键路径中设置少量额外的电路用于地址转换，从而提高性能。
-
10.发明授权Method and apparatus for re-using memory allocated for data structures used by software processes 有权用于重新使用由软件过程使用的数据结构分配的存储器的方法和装置公开(公告)号：US08255887B2
公开(公告)日：2012-08-28
申请号：US11564345
申请日：2006-11-29
申请人： Timothy Hume Heil
发明人： Timothy Hume Heil
IPC分类号： G06F9/45
CPC分类号： G06F12/0253
摘要： A memory management mechanism requires data structures to be explicitly deallocated in the programming code, but deallocation does not immediately make the memory available for reuse. Before a deallocated memory region can be reused, memory is scanned for pointers to the deallocated region, and any such pointer is set to null. The deallocated memory is then available for reuse. Preferably, deallocated memory regions are accumulated, and an asynchronous memory cleaning process periodically scans memory to nullify the pointers. In order to prevent previously scanned memory becoming contaminated with a dangling pointer before the scan is finished, any write to a pointer is checked to verify that the applicable target address has not been deallocated.
摘要翻译： 内存管理机制要求在编程代码中明确地分配数据结构，但是释放不会立即使内存可用于重用。 在释放分配的内存区域可以重新使用之前，将扫描内存到指定的分配区域，并将任何这样的指针设置为null。 然后释放的内存可用于重新使用。 优选地，释放分配的存储器区域被积累，并且异步存储器清洁处理周期性地扫描存储器以使指针无效。 为了防止先前扫描的存储器在扫描完成之前被悬挂的指针污染，检查对指针的任何写入，以验证适用的目标地址是否未被释放。
-
-
-
-
-
-
-
-
-
搜索结果
18 条记录 (耗时 0.031 秒)
