会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明申请
    • WORK CONSERVING SCHEDULAR BASED ON RANKING
    • 基于排名的工作守则
    • US20150124832A1
    • 2015-05-07
    • US14462453
    • 2014-08-18
    • Cisco Technology, Inc.
    • Sha MaPhilip Chen
    • H04L12/865H04L12/863
    • H04L47/6275G06F5/16G06F9/4881G06F2205/064H04L45/74H04L47/50H04L47/562H04L47/62H04L47/623
    • A work conserving scheduler can be implemented based on a ranking system to provide the scalability of time stamps while avoiding the fast search associated with a traditional time stamp implementation. Each queue can be assigned a time stamp that is initially set to zero. The time stamp for a queue can be incremented each time a data packet from the queue is processed. To provide varying weights to the different queues, the time stamp for the queues can be incremented at varying rates. The data packets can be processed from the queues based on the tier rank order of the queues as determined from the time stamp associated with each queue. To increase the speed at which the ranking is determined, the ranking can be calculate from a subset of the bits defining the time stamp rather than the entire bit set.
    • 可以基于排名系统来实现工作保存调度器,以提供时间戳的可扩展性,同时避免与传统时间戳实现相关联的快速搜索。 可以为每个队列分配最初设置为零的时间戳。 每当处理来自队列的数据包时,队列的时间戳可以递增。 为了向不同的队列提供变化的权重,队列的时间戳可以以不同的速率递增。 可以根据从与每个队列相关联的时间戳确定的队列的层次顺序,从队列处理数据分组。 为了提高确定排名的速度,可以从定义时间戳而不是整个比特集的比特的子集中计算排名。
    • 10. 发明申请
    • BOOSTING LINKED LIST THROUGHPUT
    • 启动链接列表
    • US20150124833A1
    • 2015-05-07
    • US14494510
    • 2014-09-23
    • Cisco Technology, Inc.
    • Sha MaFelice BonardiPhilip Chen
    • H04L12/863H04L12/741
    • H04L47/6275G06F5/16G06F9/4881G06F2205/064H04L45/74H04L47/50H04L47/562H04L47/62H04L47/623
    • 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.
    • 多个列表用作单个主链表,以先进先出(FIFO)顺序管理跨一个或多个存储器组的数据包,同时允许每个周期执行多个推送和/或弹出功能。 每个列表可以是跟踪指针并被存储在不同存储体中的链表。 节点可以包括指向数据分组的指针,指向列表中的下一个节点的指针,以及标识包含主链表中下一个节点的列表的下一个列表标识符。 每个列表的头尾,以及每个跟踪主链表头部和尾部的标识符都可以保存在缓存中。 相应地更新单个列表以维持主链表的顺序,因为从主链表列表中推出并弹出指针。