Memory buffering with fast packet information access for a network device
    1.
    发明授权
    Memory buffering with fast packet information access for a network device 有权
    具有网络设备快速分组信息访问的内存缓冲

    公开(公告)号:US07944930B2

    公开(公告)日:2011-05-17

    申请号:US11298965

    申请日:2005-12-09

    申请人: Sha Ma Earl T. Cohen

    发明人: Sha Ma Earl T. Cohen

    IPC分类号: H04L12/28 H04L12/54

    CPC分类号: G06F12/023

    摘要: A networking device employing memory buffering in which a first memory is logically configured into blocks, and the blocks are logically configured into particles, where a second memory is configured to mirror the first memory in which a fixed number of bits in the second memory are allocated for each particle in the first memory so that scheduling and datagram lengths of packets stored in the first memory may be stored in the second memory. Other embodiments are described and claimed.

    摘要翻译: 一种采用存储器缓冲的网络设备,其中第一存储器在逻辑上被配置成块,并且所述块被逻辑地配置成颗粒,其中第二存储器被配置为镜像其中分配了第二存储器中固定位数的第一存储器 对于第一存储器中的每个粒子,使得存储在第一存储器中的分组的调度和数据报长度可以存储在第二存储器中。 描述和要求保护其他实施例。

    INCREASING DATA ACCESS PERFORMANCE
    2.
    发明申请
    INCREASING DATA ACCESS PERFORMANCE 审中-公开
    提高数据访问性能

    公开(公告)号:US20120054427A1

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

    申请号:US12870566

    申请日:2010-08-27

    IPC分类号: G06F12/00 G06F15/173

    摘要: Techniques are described for increasing data access performance for a memory device. In various embodiments, a scheduler/controller is configured to manage data as it read to or written from a memory. Read access is increased by partitioning a memory into a group of sub-blocks, associating a parity block with the sub-blocks, and accessing the sub-blocks to read data as needed. Write speeds may be improved by adding a pending write buffer to a group of memory sub-blocks. Such a buffer may be sized to be equal to the group of memory sub-blocks. The pending write buffer is used to handle collisions for write accesses to the same block, allowing two simultaneous writes to any regular memory block to occur.

    摘要翻译: 描述了用于增加存储器设备的数据访问性能的技术。 在各种实施例中,调度器/控制器被配置为在从存储器读取或从存储器写入时管理数据。 通过将存储器划分成一组子块,将奇偶校验块与子块相关联,以及根据需要访问子块以读取数据来增加读取访问。 通过将一个待处理的写入缓冲区添加到一组存储器子块可以改善写入速度。 这样的缓冲器的大小可以等于存储器子块组。 待处理写缓冲区用于处理对同一块的写入访问的冲突,允许发生任何常规内存块的两次同时写入。

    Method, system and apparatus for scheduling a large pool of resources
    4.
    发明授权
    Method, system and apparatus for scheduling a large pool of resources 有权
    用于调度大量资源的方法,系统和设备

    公开(公告)号:US07489689B2

    公开(公告)日:2009-02-10

    申请号:US11260587

    申请日:2005-10-26

    申请人: Sha Ma William Lynch

    发明人: Sha Ma William Lynch

    IPC分类号: H04L12/56

    CPC分类号: H04L41/0896

    摘要: A system and method for scheduling resources utilizes a data structure that supports quick sorting to find a highest priority eligibility key. The data structure provides for guaranteed storage efficiency, supports insertion and deletion, and assures that the worst-case operation to maintain its properties after assertion is O(log N) where N is the number of active keys.

    摘要翻译: 用于调度资源的系统和方法利用支持快速排序的数据结构以找到最高优先级的资格密钥。 数据结构提供保证的存储效率,支持插入和删除,并确保在断言后维持其属性的最坏情况操作为O(log N),其中N是活动密钥的数量。

    Method, system and apparatus for scheduling a large pool of resources
    8.
    发明申请
    Method, system and apparatus for scheduling a large pool of resources 有权
    用于调度大量资源的方法,系统和设备

    公开(公告)号:US20070091803A1

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

    申请号:US11260587

    申请日:2005-10-26

    申请人: Sha Ma William Lynch

    发明人: Sha Ma William Lynch

    IPC分类号: H04L12/26

    CPC分类号: H04L41/0896

    摘要: A system and method for scheduling resources utilizes a data structure that supports quick sorting to find a highest priority eligibility key. The data structure provides for guaranteed storage efficiency, supports insertion and deletion, and assures that the worst-case operation to maintain its properties after assertion is O(log N) where N is the number of active keys.

    摘要翻译: 用于调度资源的系统和方法利用支持快速排序的数据结构以找到最高优先级的资格密钥。 数据结构提供保证的存储效率,支持插入和删除,并确保在断言后维持其属性的最坏情况操作为O(log N),其中N是活动密钥的数量。

    Per-port multicast processing
    10.
    发明授权
    Per-port multicast processing 有权
    每端口组播处理

    公开(公告)号:US09166902B1

    公开(公告)日:2015-10-20

    申请号:US13618056

    申请日:2012-09-14

    摘要: In a multicast networking device having a plurality of output ports, a hierarchical packet scheduling tree is generated for a first port. The hierarchical packet scheduling tree is generated from a transmission queue for the first port. A sequential search of the hierarchical scheduling tree is performed to determine a packet pointer to a first packet in the transmission queue of the first port. Based on the packet pointer, packet data for the first packet is obtained and the first packet comprising the packet data is transmitted to a destination device via the first port.

    摘要翻译: 在具有多个输出端口的组播网络设备中,为第一端口生成分层分组调度树。 从第一端口的传输队列生成分层分组调度树。 执行分级调度树的顺序搜索以确定到第一端口的传输队列中的第一分组的分组指针。 基于分组指针,获得用于第一分组的分组数据,并且包括分组数据的第一分组经由第一端口被发送到目的地设备。