会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Pre-fetching and invalidating packet information in a cache memory
    • 在高速缓冲存储器中预取和使分组信息无效
    • US07155576B1
    • 2006-12-26
    • US10446021
    • 2003-05-27
    • Trevor S. GarnerWilliam R. LeeMartin W. Hughes
    • Trevor S. GarnerWilliam R. LeeMartin W. Hughes
    • G06F12/00G06F15/16
    • G06F12/0862
    • A technique for managing a cache memory coupled to an intermediate node's processor. Packets acquired by the intermediate node that are destined for processing by the processor are tracked, without the processor's intervention, to determine if the processor is lagging in processing the acquired packets. If so, data associated with unprocessed packets are pre-fetched from an external memory and placed in the cache memory without the processor's intervention. Moreover, packets destined for processing by the processor and placed into the cache memory are tracked, without the processor's intervention, to determine if the processor has, in fact, completed the processing of those packets. If so, data contained in the cache memory that is associated with the processed packets are invalidated, again without the processor's intervention.
    • 一种用于管理耦合到中间节点处理器的高速缓冲存储器的技术。 在处理器干预的情况下,跟踪由中间节点获取的目的地由处理器处理的数据包,以确定处理器是否滞后于处理所获取的数据包。 如果是这样,与未处理的数据包相关联的数据将从外部存储器预取,并放置在高速缓冲存储器中,而无需处理器的干预。 而且,由处理器进行处理并被放置在高速缓冲存储器中的分组被跟踪,而无需处理器的介入,以确定处理器实际上是否完成了那些分组的处理。 如果是这样,与处理的数据包相关联的高速缓冲存储器中包含的数据无效,无需处理器的干预。
    • 2. 发明授权
    • Header range check hash circuit
    • 标题范围检查散列电路
    • US07346059B1
    • 2008-03-18
    • US10657497
    • 2003-09-08
    • Trevor GarnerWilliam R. LeeJohn Kenneth StacyMartin W. HughesDennis Briddell
    • Trevor GarnerWilliam R. LeeJohn Kenneth StacyMartin W. HughesDennis Briddell
    • H04L12/26H04J3/14G08C15/00G06F11/00
    • H04L12/4625
    • A technique efficiently searches a hash table containing a plurality of “ranges.” In contrast with previous implementations, the technique performs fewer searches to locate one or more ranges stored in the hash table. To that end, the hash table is constructed so each hash-table entry is associated with a different linked list, and each linked-list entry stores, inter alia, “signature” information and at least one pair of values defining a range associated with the signature. The technique modifies the signature based on the results of one or more preliminary range checks. As a result, the signature's associated ranges are more evenly distributed among the hash table's linked lists. Thus, the linked lists are on average shorter in length, thereby enabling faster and more efficient range searches. According to an illustrative embodiment, the technique is applied to flow-based processing implemented in an intermediate network node, such as a router.
    • 技术有效地搜索包含多个“范围”的散列表。 与先前的实现相比,该技术执行较少的搜索来定位存储在散列表中的一个或多个范围。 为此,构建哈希表,使得每个散列表条目与不同的链表相关联,并且每个链表列表条目尤其存储“签名”信息和至少一对定义与 签名。 该技术基于一个或多个初步范围检查的结果修改签名。 因此,签名的关联范围在哈希表的链表之间更均匀地分布。 因此,链表的长度平均更短,从而实现更快更有效的范围搜索。 根据说明性实施例,该技术被应用于在诸如路由器的中间网络节点中实现的基于流的处理。