Data structure supporting random delete and aging/timer function
    11.
    发明申请
    Data structure supporting random delete and aging/timer function 失效
    数据结构支持随机删除和老化/定时器功能

    公开(公告)号:US20050050188A1

    公开(公告)日:2005-03-03

    申请号:US10654139

    申请日:2003-09-03

    IPC分类号: G06F15/173 G06F17/30

    摘要: 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,直到定时器进程前进到块链中的块位置。

    Facilitating Inter-DSP Data Communications
    12.
    发明申请

    公开(公告)号:US20080010390A1

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

    申请号:US11856509

    申请日:2007-09-17

    IPC分类号: G06F3/00

    CPC分类号: G06F13/28

    摘要: A method, computer program product and system for facilitating inter-digital signal processing (DSP) data communications. A direct memory access (DMA) controller may be configured to facilitate transfers of data between a first and a second DSP processor core coupled to the DMA controller. The DMA controller may read a data structure, referred to as a “buffer descriptor block,” to perform the data transfer. The buffer descriptor block may store both a source address and a destination address indicating where the data is to be retrieved and stored. The buffer descriptor block may further store a value, e.g., number of bytes, indicating a size of the data to be transferred. The DMA controller may then transfer the data located at the source address in the first DSP processor core, with a size, e.g., number of bytes, indicated from the buffer descriptor block, to the destination address in the second DSP processor core.

    Method and apparatus for translating a virtual address to a real address using blocks of contiguous page table entries
    13.
    发明申请
    Method and apparatus for translating a virtual address to a real address using blocks of contiguous page table entries 有权
    使用连续页表项的块将虚拟地址翻译成实地址的方法和装置

    公开(公告)号:US20070079106A1

    公开(公告)日:2007-04-05

    申请号:US11232773

    申请日:2005-09-22

    申请人: Gordon Davis

    发明人: Gordon Davis

    IPC分类号: G06F12/00 G06F7/00

    CPC分类号: G06F12/1018 G06F2212/1044

    摘要: A page table mechanism translates virtual addresses to real addresses. In a first aspect, page table entries are contained in equal-sized blocks, the entries within each block corresponding to contiguous pages of virtual address space. Preferably, the common high-order portion of the virtual address is contained in segments distributed among multiple page table entries of the block. In a second aspect, the virtual address indexes a binary tree definitional structure. Decode logic traverses a binary tree defined by the definitional structure by testing selective bits of the virtual address to reach a leaf of the binary tree, which defines the location of data defining the real address.

    摘要翻译: 页表机制将虚拟地址转换为实际地址。 在第一方面,页表条目包含在等大小的块中,每个块内的条目对应于虚拟地址空间的连续页面。 优选地,虚拟地址的公共高阶部分包含在分块在块的多个表表项之间的段中。 在第二方面,虚拟地址索引二进制树定义结构。 解码逻辑遍历由定义结构定义的二叉树,通过测试虚拟地址的选择性位以到达二叉树的叶,该二叉树定义了定义实际地址的数据的位置。

    Method and structure for enqueuing data packets for processing
    15.
    发明申请
    Method and structure for enqueuing data packets for processing 失效
    排队处理数据包的方法和结构

    公开(公告)号:US20060039376A1

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

    申请号:US10868725

    申请日:2004-06-15

    IPC分类号: H04L12/56 H04L12/28

    摘要: A method and structure is provided for buffering data packets having a header and a remainder in a network processor system. The network processor system has a processor on a chip and at least one buffer on the chip. Each buffer on the chip is configured to buffer the header of the packets in a preselected order before execution in the processor, and the remainder of the packet is stored in an external buffer apart from the chip. The method comprises utilizing the header information to identify the location and extent of the remainder of the packet. The entire selected packet is stored in the external buffer when the buffer of the stored header of the given packet is full, and moving only the header of a selected packet stored in the external buffer to the buffer on the chip when the buffer on the chip has space therefor.

    摘要翻译: 提供了一种在网络处理器系统中缓冲具有报头和余数的数据分组的方法和结构。 网络处理器系统在芯片上具有处理器和芯片上的至少一个缓冲器。 芯片上的每个缓冲器被配置为在处理器中执行之前以预先选择的顺序缓冲数据包的报头,并且数据包的剩余部分存储在与芯片分离的外部缓冲器中。 该方法包括利用报头信息来识别分组的其余部分的位置和范围。 当给定分组的存储报头的缓冲器已满时,整个所选分组被存储在外部缓冲器中,并且当芯片上的缓冲器仅将存储在外部缓冲器中的选定分组的报头移动到芯片上的缓冲器时 有空间。

    Method and system for managing multi-field classification rules relating to ingress contexts and egress contexts
    16.
    发明申请
    Method and system for managing multi-field classification rules relating to ingress contexts and egress contexts 失效
    用于管理与入口上下文和出口上下文相关的多字段分类规则的方法和系统

    公开(公告)号:US20050237939A1

    公开(公告)日:2005-10-27

    申请号:US10832958

    申请日:2004-04-27

    CPC分类号: G06N99/005

    摘要: The present invention relates to a method and system 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.

    摘要翻译: 本发明涉及一种用于管理多个多场分类规则的方法和系统。 该方法包括提供第一表格,该第一表格包括对应于与入口上下文有关的多个规则的多个条目,并提供第二表格,该第二表格包括对应于与出口上下文有关的多个规则的多个条目。 该方法还包括利用第一表和第二表来识别与入口上下文有关的任何规则以及与搜索关键字匹配的出口上下文相关的任何规则。

    Controller for multiple instruction thread processors
    17.
    发明申请
    Controller for multiple instruction thread processors 失效
    多指令线程处理器的控制器

    公开(公告)号:US20050022196A1

    公开(公告)日:2005-01-27

    申请号:US10915983

    申请日:2004-08-11

    CPC分类号: G06F9/3802 G06F9/3851

    摘要: A mechanism controls a multi-thread processor so that when a first thread encounters a latency event for a first predefined time interval temporary control is transferred to an alternate execution thread for duration of the first predefined time interval and then back to the original thread. The mechanism grants full control to the alternate execution thread when a latency event for a second predefined time interval is encountered. The first predefined time interval is termed short latency event whereas the second time interval is termed long latency event.

    摘要翻译: 机制控制多线程处理器,使得当第一线程遇到第一预定义时间间隔的等待时间事件时,临时控制在第一预定义时间间隔的持续时间内被传送到备用执行线程,然后返回到原始线程。 当遇到第二个预定义时间间隔的延迟事件时,机制将授权对备用执行线程的完全控制。 第一预定时间间隔称为短延迟事件,而第二时间间隔称为长延迟事件。

    LOOKUPS BY COLLISIONLESS DIRECT TABLES AND CAMS
    18.
    发明申请
    LOOKUPS BY COLLISIONLESS DIRECT TABLES AND CAMS 有权
    无连续直接表和CAMS的查询

    公开(公告)号:US20080098015A1

    公开(公告)日:2008-04-24

    申请号:US11962558

    申请日:2007-12-21

    IPC分类号: G06F17/30

    摘要: A structure and technique for preventing collisions using a hash table in conjunction with a CAM to identify and prevent collisions of binary keys. A portion of the hash value of a binary key, which does not collide with a portion of the hash value of any other reference binary key, is used as an entry in the hash table. If two or more binary keys have identical values of the portions of the hash values, each of these binary keys are stored in their entirety, in the CAM. The key in the CAM provides a pointer to a data structure where the action associated with that binary key is stored. If the binary key is not found in the CAM, the binary key is hashed, and a specific entry in the hash table is selected using a portion of this hash value.

    摘要翻译: 一种用于使用散列表与CAM结合来防止冲突的结构和技术,以识别和防止二进制键的冲突。 不与任何其他参考二进制密钥的散列值的一部分相冲突的二进制密钥的散列值的一部分被用作散列表中的条目。 如果两个或更多个二进制密钥具有相同的哈希值部分的值,则这些二进制密钥中的每一个都将全部存储在CAM中。 CAM中的关键字提供了指向数据结构的指针,其中存储与该二进制密钥相关联的动作。 如果在CAM中没有找到二进制密钥,则二进制密钥被散列,并且使用该哈希值的一部分来选择散列表中的特定条目。

    Method and Apparatus for Translating a Virtual Address to a Real Address Using Blocks of Contiguous Page Table Entries
    19.
    发明申请
    Method and Apparatus for Translating a Virtual Address to a Real Address Using Blocks of Contiguous Page Table Entries 有权
    用于将虚拟地址转换为实际地址的方法和装置,使用相邻页表项的块

    公开(公告)号:US20080052486A1

    公开(公告)日:2008-02-28

    申请号:US11930513

    申请日:2007-10-31

    申请人: Gordon Davis

    发明人: Gordon Davis

    IPC分类号: G06F12/00

    CPC分类号: G06F12/1018 G06F2212/1044

    摘要: A page table mechanism translates virtual addresses to real addresses. In a first aspect, page table entries are contained in equal-sized blocks, the entries within each block corresponding to contiguous pages of virtual address space. Preferably, the common high-order portion of the virtual address is contained in segments distributed among multiple page table entries of the block. In a second aspect, the virtual address indexes a binary tree definitional structure. Decode logic traverses a binary tree defined by the definitional structure by testing selective bits of the virtual address to reach a leaf of the binary tree, which defines the location of data defining the real address.

    摘要翻译: 页表机制将虚拟地址转换为实际地址。 在第一方面,页表条目包含在等大小的块中,每个块内的条目对应于虚拟地址空间的连续页面。 优选地,虚拟地址的公共高阶部分包含在分块在块的多个表表项之间的段中。 在第二方面,虚拟地址索引二进制树定义结构。 解码逻辑遍历由定义结构定义的二叉树,通过测试虚拟地址的选择性位以到达二叉树的叶,该二叉树定义了定义实际地址的数据的位置。

    LOOKUPS BY COLLISIONLESS DIRECT TABLES AND CAMS
    20.
    发明申请
    LOOKUPS BY COLLISIONLESS DIRECT TABLES AND CAMS 有权
    无连续直接表和CAMS的查询

    公开(公告)号:US20080028140A1

    公开(公告)日:2008-01-31

    申请号:US11867963

    申请日:2007-10-05

    IPC分类号: G06F12/00

    摘要: A structure and technique for preventing collisions using a hash table in conjunction with a CAM to identify and prevent collision of binary keys. A portion of the hash value of a binary key, which does not collide with a portion of the hash value of any other reference binary key, is used as an entry in the hash table. If two or more binary keys have identical values of the portions of the hash values, each of these binary keys are stored in their entirety, in the CAM. The key in the CAM provides a pointer to a data structure where the action associated with that binary key is stored. If the binary key is not found in the CAM, the binary key is hashed, and a specific entry in the hash table is selected using a portion of this hash value.

    摘要翻译: 一种用于使用散列表与CAM结合来防止冲突的结构和技术,以识别和防止二进制密钥的冲突。 不与任何其他参考二进制密钥的散列值的一部分相冲突的二进制密钥的散列值的一部分被用作散列表中的条目。 如果两个或更多个二进制密钥具有相同的哈希值部分的值,则这些二进制密钥中的每一个都将全部存储在CAM中。 CAM中的关键字提供了指向数据结构的指针,其中存储与该二进制密钥相关联的动作。 如果在CAM中没有找到二进制密钥,则二进制密钥被散列,并且使用该哈希值的一部分来选择散列表中的特定条目。