Deleting leaves in tree table structures
    41.
    发明授权
    Deleting leaves in tree table structures 失效
    删除树表结构中的树叶

    公开(公告)号:US08135752B2

    公开(公告)日:2012-03-13

    申请号:US12350493

    申请日:2009-01-08

    IPC分类号: G06F7/00 G06F17/00 G06F17/30

    摘要: 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.

    摘要翻译: 提供的技术和制品包括计算机可读程序,当在计算机上执行计算机可读程序时,使计算机从具有叶键的图案搜索控制块和包含前缀的叶片的叶片中删除叶 或指向另一个模式搜索控制块的指针,通过将每个前缀放置在树前缀表中; 在树中搜索一个键; 如果树搜索没有在树中找到密钥,则在前缀表中搜索密钥; 如果在前缀表中没有找到密钥,则确认该密钥被删除; 从模式搜索控制块之一删除密钥; 并且如果所述爱好者树搜索找到所述密钥,则通过从所述爱好树中消除所述最左图案搜索控制块来折叠所述爱好者树。

    System for defining data mappings between data structures
    42.
    发明授权
    System for defining data mappings between data structures 失效
    用于定义数据结构之间数据映射的系统

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

    摘要翻译: 提供了规则分类中使用的搜索树结构的压缩方法。 该方法包括基于过滤器规则对分组进行分类,压缩包括多个单位测试节点和叶节点的树结构,将压缩的树结构存储在存储器的第一存储器结构中,使得多个单位测试节点和 可以通过存储器的单个存储器访问从第一存储器结构访问叶节点,收集处于树结构的最低级别的树结构的单位测试节点,仅在第二存储器结构中存储所收集的单位测试节点 与第一存储器结构相邻的存储器的存储器结构,收集树结构的叶节点,以及仅存储所收集的叶节点在与第二存储器结构相邻的存储器的第三存储器结构内。

    Data structure supporting random delete and timer function
    43.
    发明授权
    Data structure supporting random delete and timer function 失效
    数据结构支持随机删除和定时功能

    公开(公告)号:US07792873B2

    公开(公告)日:2010-09-07

    申请号:US12015198

    申请日:2008-01-16

    IPC分类号: G06F17/30 G06F7/00

    摘要: A procedure is used to provide data structures that handle large numbers of active data entries and a high rate of additions and deletions of active entries. The procedure utilizes one or more of the following modifications. Timers are removed from individual session table entries and are linked via pointers. Bilateral links are established between the session table and the timer structure. Aging/timer checks are applied to the timer control block (TCB). A chain of TCBs, optionally including an excess of blocks, may be used along with packing of multiple TCBs into a single memory location. This excess of blocks permits a terminated session to continue to occupy a TCB until the timer process progresses to that block location in the chain of blocks.

    摘要翻译: 一个过程用于提供处理大量活动数据条目的数据结构以及高活动条目的添加和删除率。 该过程利用以下一个或多个修改。 定时器从单个会话表条目中删除,并通过指针进行链接。 在会话表和定时器结构之间建立双向链路。 老化/定时器检查应用于定时器控制块(TCB)。 可以使用可选地包括多余块的TCB链,以及将多个TCB打包到单个存储器位置中。 这个多余的块允许终止的会话继续占用TCB,直到定时器进程前进到块链中的块位置。

    System-On-A-Chip Supporting A Networked Array Of Configurable Symmetric Multiprocessing Nodes
    44.
    发明申请
    System-On-A-Chip Supporting A Networked Array Of Configurable Symmetric Multiprocessing Nodes 审中-公开
    系统级芯片支持可配置对称多处理节点的网络阵列

    公开(公告)号:US20100161938A1

    公开(公告)日:2010-06-24

    申请号:US12342660

    申请日:2008-12-23

    IPC分类号: G06F15/76 G06F9/02

    CPC分类号: G06F15/16

    摘要: An integrated circuit having an array of programmable processing elements linked by an on-chip communication network. Each processing element includes a plurality of processing cores, a local memory, and thread scheduling means for scheduling execution of threads on the processing cores of the given processing element. The thread scheduling means assigns threads to the processing cores of the given processing element in a configurable manner. The configuration of the thread scheduling means defines one or more logical symmetric multiprocessors for executing threads on the given processing element. A logical symmetric multiprocessor is realized by a defined set of processing cores assigned to a group of threads executing on the given processing element.

    摘要翻译: 一种具有由片上通信网络链接的可编程处理元件阵列的集成电路。 每个处理元件包括多个处理核心,本地存储器和用于调度给定处理元件的处理核上的线程执行的线程调度装置。 线程调度装置以可配置的方式将线程分配给给定处理元件的处理核心。 线程调度装置的配置定义了用于在给定处理元件上执行线程的一个或多个逻辑对称多处理器。 逻辑对称多处理器由分配给在给定处理元件上执行的一组线程的一组定义的处理核实现。

    Method for compressing multi-field rule specifications
    46.
    发明授权
    Method for compressing multi-field rule specifications 失效
    压缩多场规则规范的方法

    公开(公告)号:US07454396B2

    公开(公告)日:2008-11-18

    申请号:US10832957

    申请日:2004-04-27

    IPC分类号: G06F17/00 G06N5/02

    CPC分类号: G06N99/005

    摘要: The present invention relates to a method for storing a plurality of multi-field classification rules in a computer system. Each multi-field classification rule includes a rule specification that itself includes a plurality of fields and a plurality of field definitions corresponding to the fields. The method of the present invention includes providing a virtual rule table, where the table stores a plurality of field definitions, and for each of the plurality of multi-field classification rules, compressing the rule specification by replacing at least one field definition with an associated index into the virtual rule table. The method also includes storing each of the compressed rule specifications and the virtual rule table in a shared segment of memory.

    摘要翻译: 本发明涉及一种用于在计算机系统中存储多个多场分类规则的方法。 每个多字段分类规则包括本身包括多个字段的规则规范和对应于字段的多个字段定义。 本发明的方法包括提供虚拟规则表,其中表存储多个字段定义,并且对于多个多字段分类规则中的每一个,通过用相关联的替换来替换至少一个字段定义来压缩规则规范 索引到虚拟规则表。 该方法还包括将每个压缩规则规范和虚拟规则表存储在存储器的共享段中。

    PRIORITY BASED BANDWIDTH ALLOCATION WITHIN REAL-TIME AND NON-REAL-TIME TRAFFIC STREAMS
    47.
    发明申请
    PRIORITY BASED BANDWIDTH ALLOCATION WITHIN REAL-TIME AND NON-REAL-TIME TRAFFIC STREAMS 失效
    实时和非实时交通流中基于优先级的带宽分配

    公开(公告)号:US20080232386A1

    公开(公告)日:2008-09-25

    申请号:US12114767

    申请日:2008-05-03

    IPC分类号: H04L12/28

    摘要: A method and system for transmitting packets in a packet switching network. Packets received by a packet processor may be prioritized based on the urgency to process them. Packets that are urgent to be processed may be referred to as real-time packets. Packets that are not urgent to be processed may be referred to as non-real-time packets. Real-time packets have a higher priority to be processed than non-real-time packets. A real-time packet may either be discarded or transmitted into a real-time queue based upon its value priority, the minimum and maximum rates for that value priority and the current real-time queue congestion conditions. A non-real-time packet may either be discarded or transmitted into a non-real-time queue based upon its value priority, the minimum and maximum rates for that value priority and the current real-time and non-real-time queue congestion conditions.

    摘要翻译: 一种用于在分组交换网络中传送分组的方法和系统。 可以基于处理它们的紧急性来优先考虑由分组处理器接收的分组。 紧急处理的数据包可以称为实时数据包。 不紧急处理的数据包可能被称为非实时数据包。 实时数据包的优先级要高于非实时数据包。 可以根据其值优先级,该值优先级的最小和最大速率以及当前实时队列拥塞条件,将实时分组丢弃或传输到实时队列中。 可以基于其值优先级,该值优先级的最小和最大速率以及当前的实时和非实时队列拥塞将非实时分组丢弃或发送到非实时队列 条件。

    Priority based bandwidth allocation within real-time and non-real-time traffic streams
    48.
    发明授权
    Priority based bandwidth allocation within real-time and non-real-time traffic streams 失效
    实时和非实时业务流中基于优先级的带宽分配

    公开(公告)号:US07385997B2

    公开(公告)日:2008-06-10

    申请号:US10118493

    申请日:2002-04-08

    IPC分类号: H04L12/28 H04L12/56

    摘要: A method and system for transmitting packets in a packet switching network. Packets received by a packet processor may be prioritized based on the urgency to process them. Packets that are urgent to be processed may be referred to as real-time packets. Packets that are not urgent to be processed may be referred to as non-real-time packets. Real-time packets have a higher priority to be processed than non-real-time packets. A real-time packet may either be discarded or transmitted into a real-time queue based upon its value priority, the minimum and maximum rates for that value priority and the current real-time queue congestion conditions. A non-real-time packet may either be discarded or transmitted into a non-real-time queue based upon its value priority, the minimum and maximum rates for that value priority and the current real-time and non-real-time queue congestion conditions.

    摘要翻译: 一种用于在分组交换网络中传送分组的方法和系统。 可以基于处理它们的紧急性来优先考虑由分组处理器接收的分组。 紧急处理的数据包可以称为实时数据包。 不紧急处理的数据包可能被称为非实时数据包。 实时数据包的优先级要高于非实时数据包。 可以根据其值优先级,该值优先级的最小和最大速率以及当前实时队列拥塞条件,将实时分组丢弃或传输到实时队列中。 可以基于其值优先级,该值优先级的最小和最大速率以及当前的实时和非实时队列拥塞将非实时分组丢弃或发送到非实时队列 条件。

    DATA STRUCTURE SUPPORTING RANDOM DELETE AND TIMER FUNCTION
    49.
    发明申请
    DATA STRUCTURE SUPPORTING RANDOM DELETE AND TIMER FUNCTION 失效
    数据结构支持随机删除和定时器功能

    公开(公告)号:US20080133467A1

    公开(公告)日:2008-06-05

    申请号:US12015198

    申请日:2008-01-16

    IPC分类号: G06F7/10 G06F17/30 G06F7/00

    摘要: A procedure is used to provide data structures that handle large numbers of active data entries and a high rate of additions and deletions of active entries. The procedure utilizes one or more of the following modifications. Timers are removed from individual session table entries and are linked via pointers. Bilateral links are established between the session table and the timer structure. Aging/timer checks are applied to the timer control block (TCB). A chain of TCBs, optionally including an excess of blocks, may be used along with packing of multiple TCBs into a single memory location. This excess of blocks permits a terminated session to continue to occupy a TCB until the timer process progresses to that block location in the chain of blocks.

    摘要翻译: 一个过程用于提供处理大量活动数据条目的数据结构以及高活动条目的添加和删除率。 该过程利用以下一个或多个修改。 定时器从单个会话表条目中删除,并通过指针进行链接。 在会话表和定时器结构之间建立双向链路。 老化/定时器检查应用于定时器控制块(TCB)。 可以使用可选地包括多余块的TCB链,以及将多个TCB打包到单个存储器位置中。 这个多余的块允许终止的会话继续占用TCB,直到定时器进程前进到块链中的块位置。

    NETWORK PROCESSOR WITH SINGLE INTERFACE SUPPORTING TREE SEARCH ENGINE AND CAM
    50.
    发明申请
    NETWORK PROCESSOR WITH SINGLE INTERFACE SUPPORTING TREE SEARCH ENGINE AND CAM 失效
    网络处理器,具有单接口支持树搜索引擎和CAM

    公开(公告)号:US20060265363A1

    公开(公告)日:2006-11-23

    申请号:US11457952

    申请日:2006-07-17

    IPC分类号: G06F17/30

    摘要: A method and system for identifying a data structure associated with a packet of data. A processor internal to a packet processor may extract one or more fields in a packet header field of a received packet of data to generate a search key. The internal processor may then be configured to select which table, e.g., routing table, quality of service table, filter table, needs to be accessed using the search key in order to process the received packet of data. A determination may then be made by the internal processor as to whether a CAM or a hash table and a Patricia Tree are used to identify the data structure associated with the received packet of data. Based on table definitions in a register, the internal processor may make such a determination.

    摘要翻译: 一种用于识别与数据包相关联的数据结构的方法和系统。 分组处理器内部的处理器可以提取接收到的数据分组的分组报头字段中的一个或多个字段以生成搜索关键字。 然后可以将内部处理器配置为选择哪个表,例如路由表,服务质量表,过滤表,需要使用搜索关键字进行访问,以便处理接收的数据分组。 然后内部处理器可以确定CAM或散列表和Patricia Tree是否用于标识与所接收的数据分组相关联的数据结构。 根据寄存器中的表定义,内部处理器可以作出这样的确定。