-
11.发明申请SYSTEM FOR MANAGING MULTI-FIELD CLASSIFICATION RULES RELATING TO INGRESS CONTEXTS AND EGRESS CONTEXTS 失效用于管理与生态系统和排气系统有关的多领域分类规则的系统公开(公告)号：US20080249973A1
公开(公告)日：2008-10-09
申请号：US12143641
申请日：2008-06-20
IPC分类号： G06N5/02
CPC分类号： G06N99/005
摘要： The present invention relates to a system for managing a plurality of multi-field classification rules. The system provides a first table that includes a plurality of entries corresponding to a plurality of rules relating to an ingress context and a second table that includes a plurality of entries corresponding to a plurality of rules relating to an egress context. The system also includes a network processor for classifying packets of information, wherein the network processor is programmed to utilize the first table and the second table to identify any rules relating to the ingress context and any one rules relating to the egress context that match a search key.
摘要翻译： 本发明涉及一种用于管理多个多场分类规则的系统。 该系统提供第一表，其包括对应于与入口上下文相关的多个规则的多个条目，以及第二表，其包括对应于与出口上下文相关的多个规则的多个条目。 该系统还包括用于对信息包进行分类的网络处理器，其中网络处理器被编程为利用第一表和第二表来识别与入口上下文有关的任何规则以及与搜索匹配的出口上下文相关的任何规则 键。
-
12.发明授权公开(公告)号：US07412431B2
公开(公告)日：2008-08-12
申请号：US10832958
申请日：2004-04-27
CPC分类号： G06N99/005
摘要： The present invention relates to a method for managing a plurality of multi-field classification rules. The method includes providing a first table that includes a plurality of entries corresponding to a plurality of rules relating to an ingress context and providing a second table that includes a plurality of entries corresponding to a plurality of rules relating to an egress context. The method also includes utilizing the first table and the second table to identify any rules relating to the ingress context and any rules relating to the egress context that match a search key.
摘要翻译： 本发明涉及一种用于管理多个多场分类规则的方法。 该方法包括提供第一表格，该第一表格包括对应于与入口上下文有关的多个规则的多个条目，并提供第二表格，该第二表格包括对应于与出口上下文有关的多个规则的多个条目。 该方法还包括利用第一表和第二表来识别与入口上下文有关的任何规则以及与搜索关键字匹配的出口上下文相关的任何规则。
-
公开(公告)号：US20080162525A1
公开(公告)日：2008-07-03
申请号：US12048667
申请日：2008-03-14
IPC分类号： G06F17/30
CPC分类号： H03M7/30 , Y10S707/99942
摘要： Method for compressing search tree structures used in rule classification is provided. The method includes classifying packets based on filter rules, compressing a tree structure comprising multiple levels of single bit test nodes and leaf nodes, storing the compressed tree structure in a first memory structure of a storage such that the multiple levels of single bit test nodes and leaf nodes can be accessed from the first memory structure through a single memory access of the storage, collecting single bit test nodes of the tree structure that are in a lowest level of the tree structure, storing only the collected single bit test nodes within a second memory structure of the storage that is contiguous to the first memory structure, collecting leaf nodes of the tree structure, and storing only the collected leaf nodes within a third memory structure of the storage that is contiguous to second memory structure.
摘要翻译： 提供了规则分类中使用的搜索树结构的压缩方法。 该方法包括基于过滤器规则对分组进行分类，压缩包括多个单位测试节点和叶节点的树结构，将压缩的树结构存储在存储器的第一存储器结构中，使得多个单位测试节点和 可以通过存储器的单个存储器访问从第一存储器结构访问叶节点，收集处于树结构的最低级别的树结构的单位测试节点，仅在第二存储器结构中存储所收集的单个位测试节点 与第一存储器结构相邻的存储器的存储器结构，收集树结构的叶节点，以及仅存储所收集的叶节点在与第二存储器结构相邻的存储器的第三存储器结构内。
-
公开(公告)号：US07149749B2
公开(公告)日：2006-12-12
申请号：US10453245
申请日：2003-06-03
申请人： Claude Basso , Jean L. Calvignac , Gordon T. Davis , Marco Heddes , Piyush C. Patel , Steven R. Perrin , Grayson W. Randall , Sonia K. Rovner
发明人： Claude Basso , Jean L. Calvignac , Gordon T. Davis , Marco Heddes , Piyush C. Patel , Steven R. Perrin , Grayson W. Randall , Sonia K. Rovner
IPC分类号： G06F17/30
CPC分类号： G06F17/30625 , Y10S707/99936 , Y10S707/99942 , Y10S707/99943
摘要： A technique is provided to either insert or delete a leaf in a Patricia tree having a direct table and a plurality of PSCB's which decode portions of the pattern of a leaf in the tree without shutting down the functioning of the tree. A leaf having a pattern is identified as either a leaf to be inserted or deleted. Using the pattern, the tree is walked once to identify the location of the leaf to be deleted or the location where the leaf is to be inserted. If it is a delete operation, the leaf to be deleted is identified and deleted, and any relevant PSCB modified, if necessary. If it is an insert operation, the tree is walked a second time to insert the leaf and reform or create any PSCB in the chain that needs to be reformed or created. The technique also is applicable to inserting or deleting a prefix of a prefix.
摘要翻译： 提供了一种技术来插入或删除具有直接表的Patricia树中的叶子，以及多个PSCB，其解码树中的叶子的图案的部分，而不关闭树的功能。 具有图案的叶被识别为要插入或删除的叶。 使用图案，树一次走一次，以确定要删除的叶的位置或叶被插入的位置。 如果是删除操作，则要删除的叶被识别和删除，并且必要时修改任何相关的PSCB。 如果是插入操作，则树第二次移动以插入叶，并在需要重新创建或创建的链中重新构建或创建任何PSCB。 该技术也适用于插入或删除前缀的前缀。
-
公开(公告)号：US06963868B2
公开(公告)日：2005-11-08
申请号：US10448528
申请日：2003-05-30
申请人： Claude Basso , Jean L. Calvignac , Gordon T. Davis , Marco Heddes , Piyush C. Patel , Steven R. Perrin , Grayson W. Randall
发明人： Claude Basso , Jean L. Calvignac , Gordon T. Davis , Marco Heddes , Piyush C. Patel , Steven R. Perrin , Grayson W. Randall
CPC分类号： H04L45/00 , H04L45/56 , H04L45/7457 , Y10S707/99933
摘要： A tree structure and method to organize routing information for processing messages within a network, each message being associated with a search key of “n” bits. The processing determines where to send the message next. The structure has a direct table (DT) of 2x entries for decoding the first “x” bits of the search key, and one or more pattern search control blocks (PSCB's), each having 2m entries for decoding subsequent groups of “m” bits. Each PSCB entry and DT entry includes a pointer to data associated with a specific route, if at this point a specific routing table entry is a potential match to the search key or a pointer to a subsequent PSCB if the end of a search trail is not identified. Each PSCB entry DT entry also indicates that the search has been resolved to the end of the search trail.
摘要翻译： 一种用于组织用于处理网络内的消息的路由信息的树结构和方法，每个消息与“n”比特的搜索关键字相关联。 该处理确定接下来发送消息的位置。 该结构具有用于对搜索关键字的第一个“x”比特进行解码的2个“<”条目的直接表（DT），以及一个或多个模式搜索控制块（PSCB），每个具有2个
-
公开(公告)号：US08347037B2
公开(公告)日：2013-01-01
申请号：US12256002
申请日：2008-10-22
申请人： Guy L. Guthrie , Thomas L. Jeremiah , William L. McNeil , Piyush C. Patel , William J. Starke , Jeffrey A. Stuecheli
发明人： Guy L. Guthrie , Thomas L. Jeremiah , William L. McNeil , Piyush C. Patel , William J. Starke , Jeffrey A. Stuecheli
IPC分类号： G06F12/08
CPC分类号： G06F12/0897 , G06F12/0811 , G06F12/0831 , G06F12/0862 , G06F12/128 , G06F2212/1028 , Y02D10/13
摘要： A data processing system includes a processor core having an associated upper level cache and a lower level victim cache. In response to a memory access request of the processor core that specifies a non-modifying access to a target coherency granule, a determination is made whether the memory access request hits or misses in a directory of the lower level victim cache. In response to determining that the memory access request hits in the lower level victim cache in a data-valid coherence state, the lower level victim cache provides the target coherency granule of the memory access request to the upper level cache. The lower level victim cache preserves the target coherency granule in the lower level victim cache in a shared coherence state if the memory access request is of a first type and invalidates the target coherency granule if the memory access request is of a second type.
摘要翻译： 数据处理系统包括具有相关联的高级缓存和较低级别的受害缓存的处理器核心。 响应于指定对目标一致性粒子的不修改访问的处理器核心的存储器访问请求，确定存储器访问请求是否在较低级别的受害缓存的目录中命中或丢失。 响应于确定存储器访问请求在数据有效的相干状态中击中较低级别的受害者高速缓存，则较低级别的受害者缓存将存储器访问请求的目标一致性颗粒提供给高级缓存。 如果存储器访问请求是第一类型，则较低级别的受害者缓存在共享相干状态下保留较低级别的受害者缓存中的目标一致性粒子，如果存储器访问请求是第二类型，则使目标一致性粒子无效。
-
公开(公告)号：US08135752B2
公开(公告)日：2012-03-13
申请号：US12350493
申请日：2009-01-08
申请人： Claude Basso , Jean L. Calvignac , Gordon T. Davis , Marco Heddes , Piyush C. Patel , Steven R. Perrin , Grayson W. Randall , Sonia K. Rovner
发明人： Claude Basso , Jean L. Calvignac , Gordon T. Davis , Marco Heddes , Piyush C. Patel , Steven R. Perrin , Grayson W. Randall , Sonia K. Rovner
CPC分类号： G06F17/30625 , Y10S707/99936 , Y10S707/99942 , Y10S707/99943
摘要： Techniques and articles of manufacture are provided comprising computer readable programs that, when executed on the computer, cause the computer to delete a leaf from a patricia tree having leaf keys and pattern search control blocks containing a prefix and either an end-of-trail leaf or a pointer to another of the pattern search control blocks, by placing each of the prefixes in a tree prefix table; searching for a key in the tree; searching for the key in the prefix table if the tree searching does not find the key in the tree; confirming that the key is deleted if the key is not found in the prefix table; deleting the key from one of the pattern search control blocks; and collapsing the patricia tree by eliminating the left most pattern search control block from the patricia tree if the patricia tree searching finds the key.
摘要翻译： 提供的技术和制品包括计算机可读程序，当在计算机上执行计算机可读程序时，使计算机从具有叶键的图案搜索控制块和包含前缀的叶片的叶片中删除叶 或指向另一个模式搜索控制块的指针，通过将每个前缀放置在树前缀表中; 在树中搜索一个键; 如果树搜索没有在树中找到密钥，则在前缀表中搜索密钥; 如果在前缀表中没有找到密钥，则确认该密钥被删除; 从模式搜索控制块之一删除密钥; 并且如果所述爱好者树搜索找到所述密钥，则通过从所述爱好树中消除所述最左图案搜索控制块来折叠所述爱好者树。
-
公开(公告)号：US08005869B2
公开(公告)日：2011-08-23
申请号：US12048667
申请日：2008-03-14
IPC分类号： G06F7/00
CPC分类号： H03M7/30 , Y10S707/99942
摘要： Method for compressing search tree structures used in rule classification is provided. The method includes classifying packets based on filter rules, compressing a tree structure comprising multiple levels of single bit test nodes and leaf nodes, storing the compressed tree structure in a first memory structure of a storage such that the multiple levels of single bit test nodes and leaf nodes can be accessed from the first memory structure through a single memory access of the storage, collecting single bit test nodes of the tree structure that are in a lowest level of the tree structure, storing only the collected single bit test nodes within a second memory structure of the storage that is contiguous to the first memory structure, collecting leaf nodes of the tree structure, and storing only the collected leaf nodes within a third memory structure of the storage that is contiguous to second memory structure.
摘要翻译： 提供了规则分类中使用的搜索树结构的压缩方法。 该方法包括基于过滤器规则对分组进行分类，压缩包括多个单位测试节点和叶节点的树结构，将压缩的树结构存储在存储器的第一存储器结构中，使得多个单位测试节点和 可以通过存储器的单个存储器访问从第一存储器结构访问叶节点，收集处于树结构的最低级别的树结构的单位测试节点，仅在第二存储器结构中存储所收集的单位测试节点 与第一存储器结构相邻的存储器的存储器结构，收集树结构的叶节点，以及仅存储所收集的叶节点在与第二存储器结构相邻的存储器的第三存储器结构内。
-
19.发明授权System for managing multi-field classification rules relating to ingress contexts and egress contexts 失效用于管理与入口上下文和出口上下文相关的多字段分类规则的系统公开(公告)号：US07941390B2
公开(公告)日：2011-05-10
申请号：US12143641
申请日：2008-06-20
申请人： Everett A. Corl, Jr. , Gordon T. Davis , Marco C. Heddes , Piyush C. Patel , Ravinder K. Sabhikhi
发明人： Everett A. Corl, Jr. , Gordon T. Davis , Marco C. Heddes , Piyush C. Patel , Ravinder K. Sabhikhi
IPC分类号： G06F17/00 , G06F11/00 , G06F15/173 , G06N5/02 , G01R31/08 , G08C15/00 , H04J1/16 , H04J3/14 , H04L1/00 , H04L12/26
CPC分类号： G06N99/005
摘要： The present invention relates to a system for managing a plurality of multi-field classification rules. The system provides a first table that includes a plurality of entries corresponding to a plurality of rules relating to an ingress context and a second table that includes a plurality of entries corresponding to a plurality of rules relating to an egress context. The system also includes a network processor for classifying packets of information, wherein the network processor is programmed to utilize the first table and the second table to identify any rules relating to the ingress context and any one rules relating to the egress context that match a search key.
摘要翻译： 本发明涉及一种用于管理多个多场分类规则的系统。 该系统提供第一表，其包括对应于与入口上下文相关的多个规则的多个条目，以及第二表，其包括对应于与出口上下文相关的多个规则的多个条目。 该系统还包括用于对信息包进行分类的网络处理器，其中网络处理器被编程为利用第一表和第二表来识别与入口上下文有关的任何规则以及与搜索匹配的出口上下文相关的任何规则 键。
-
公开(公告)号：US20100153650A1
公开(公告)日：2010-06-17
申请号：US12335809
申请日：2008-12-16
申请人： Guy L. Guthrie , Thomas L. Jeremiah , William L. McNeil , Piyush C. Patel , William J. Starke , Jeffrey A. Stuecheli
发明人： Guy L. Guthrie , Thomas L. Jeremiah , William L. McNeil , Piyush C. Patel , William J. Starke , Jeffrey A. Stuecheli
CPC分类号： G06F12/126 , G06F12/0817 , G06F12/0862 , G06F12/0897 , Y02D10/13
摘要： A cache memory includes a cache array including a plurality of congruence classes each containing a plurality of cache lines, where each cache line belongs to one of multiple classes which include at least a first class and a second class. The cache memory also includes a cache directory of the cache array that indicates class membership. The cache memory further includes a cache controller that selects a victim cache line for eviction from a congruence class. If the congruence class contains a cache line belonging to the second class, the cache controller preferentially selects as the victim cache line a cache line of the congruence class belonging to the second class based upon access order. If the congruence class contains no cache line belonging to the second class, the cache controller selects as the victim cache line a cache line belonging to the first class based upon access order.
摘要翻译： 高速缓存存储器包括包含多个等同类的高速缓存阵列，每个级别包含多条高速缓存行，其中每条高速缓存行属于至少包括第一类和第二类的多个类中的一个。 缓存存储器还包括指示类成员资格的高速缓存阵列的高速缓存目录。 高速缓冲存储器还包括高速缓存控制器，其选择用于从同余类驱逐的受害缓存行。 如果同余类包含属于第二类的高速缓存行，则高速缓存控制器基于访问顺序优先选择属于第二类的同余类的高速缓存行作为受害缓存行。 如果同余类不包含属于第二类的高速缓存行，则高速缓存控制器基于访问顺序选择属于第一类的高速缓存行作为受害缓存行。
-
-
-
-
-
-
-
-
-
搜索结果
26 条记录 (耗时 0.018 秒)
