BOOSTING LINKED LIST THROUGHPUT
    1.
    发明申请

    公开(公告)号:US20200252345A1

    公开(公告)日:2020-08-06

    申请号:US16854212

    申请日:2020-04-21

    Abstract: Multiple listlets function as a single master linked list to manage data packets across one or more banks of memory in a first-in first-out (FIFO) order, while allowing multiple push and/or pop functions to be performed per cycle. Each listlet can be a linked list that tracks pointers and is stored in a different memory bank. The nodes can include a pointer to a data packet, a pointer to the next node in the listlet and a next listlet identifier that identifies the listlet that contains the next node in the master linked list. The head and tail of each listlet, as well as an identifier each to track the head and tail of the master linked list, can be maintained in cache. The individual listlets are updated accordingly to maintain order of the master linked list as pointers are pushed and popped from the master linked list.

    BOOSTING LINKED LIST THROUGHPUT
    3.
    发明申请
    BOOSTING LINKED LIST THROUGHPUT 审中-公开
    启动链接列表

    公开(公告)号:US20150124833A1

    公开(公告)日:2015-05-07

    申请号:US14494510

    申请日:2014-09-23

    Abstract: Multiple listlets function as a single master linked list to manage data packets across one or more banks of memory in a first-in first-out (FIFO) order, while allowing multiple push and/or pop functions to be performed per cycle. Each listlet can be a linked list that tracks pointers and is stored in a different memory bank. The nodes can include a pointer to a data packet, a pointer to the next node in the listlet and a next listlet identifier that identifies the listlet that contains the next node in the master linked list. The head and tail of each listlet, as well as an identifier each to track the head and tail of the master linked list, can be maintained in cache. The individual listlets are updated accordingly to maintain order of the master linked list as pointers are pushed and popped from the master linked list.

    Abstract translation: 多个列表用作单个主链表,以先进先出(FIFO)顺序管理跨一个或多个存储器组的数据包,同时允许每个周期执行多个推送和/或弹出功能。 每个列表可以是跟踪指针并被存储在不同存储体中的链表。 节点可以包括指向数据分组的指针,指向列表中的下一个节点的指针,以及标识包含主链表中下一个节点的列表的下一个列表标识符。 每个列表的头尾,以及每个跟踪主链表头部和尾部的标识符都可以保存在缓存中。 相应地更新单个列表以维持主链表的顺序,因为从主链表列表中推出并弹出指针。

    BOOSTING LINKED LIST THROUGHPUT
    4.
    发明申请

    公开(公告)号:US20250007855A1

    公开(公告)日:2025-01-02

    申请号:US18883513

    申请日:2024-09-12

    Abstract: Multiple listlets function as a single master linked list to manage data packets across one or more banks of memory in a first-in first-out (FIFO) order, while allowing multiple push and/or pop functions to be performed per cycle. Each listlet can be a linked list that tracks pointers and is stored in a different memory bank. The nodes can include a pointer to a data packet, a pointer to the next node in the listlet and a next listlet identifier that identifies the listlet that contains the next node in the master linked list. The head and tail of each listlet, as well as an identifier each to track the head and tail of the master linked list, can be maintained in cache. The individual listlets are updated accordingly to maintain order of the master linked list as pointers are pushed and popped from the master linked list.

    Boosting linked list throughput
    5.
    发明授权

    公开(公告)号:US10652163B2

    公开(公告)日:2020-05-12

    申请号:US14494510

    申请日:2014-09-23

    Abstract: Multiple listlets function as a single master linked list to manage data packets across one or more banks of memory in a first-in first-out (FIFO) order, while allowing multiple push and/or pop functions to be performed per cycle. Each listlet can be a linked list that tracks pointers and is stored in a different memory bank. The nodes can include a pointer to a data packet, a pointer to the next node in the listlet and a next listlet identifier that identifies the listlet that contains the next node in the master linked list. The head and tail of each listlet, as well as an identifier each to track the head and tail of the master linked list, can be maintained in cache. The individual listlets are updated accordingly to maintain order of the master linked list as pointers are pushed and popped from the master linked list.

    DYNAMIC PACKET BUFFERS WITH CONSOLIDATION OF LOW UTILIZED MEMORY BANKS

    公开(公告)号:US20180067683A1

    公开(公告)日:2018-03-08

    申请号:US15259602

    申请日:2016-09-08

    Abstract: Provided are a method, a non-transitory computer-readable storage device and an apparatus for managing use of a shared memory buffer that is partitioned into multiple banks and that stores incoming data received at multiple inputs in accordance with a multi-slice architecture. A particular bank is allocated to a corresponding slice. Received respective data packets are associated with corresponding slices based on which respective inputs they are received. Determine, based on a state of the shared memory buffer, to transfer contents of all occupied cells of the particular bank. Writes to the bank are stopped, contents of occupied cells are transferred to cells of one or more other banks associated with the particular bank's slice, information is stored indicating where the contents have been transferred, and the particular bank is returned to a shared pool after transferring is completed.

Patent Agency Ranking