会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 39. 发明授权
    • Scalable multi-client scheduling
    • 可扩展的多客户机调度
    • US09485326B1
    • 2016-11-01
    • US14242338
    • 2014-04-01
    • Marvell Israel (M.I.S.L) Ltd.
    • Sharon UlmanRoi ShermanDror BrombergCarmi Arad
    • H04L29/08G06F15/16
    • H04L47/60H04L49/9084
    • A method includes receiving a plurality of requests, determining a plurality of first bank identifiers specifying respective physical memory banks, and selecting, based at least on the first bank identifiers, a first set of requests to be processed according to a scheduling hierarchy. Selecting the first set of requests includes prohibiting any two requests from being associated with a same first bank identifier. The method also includes processing, during a single processing cycle, ones of the first set of requests at respective nodes within a single level of the scheduling hierarchy. The method also includes, responsively at least to processing ones of the first set of requests at respective nodes within the single level of the scheduling hierarchy, selecting a queue, and, responsively at least to selecting the queue, causing one or more packets corresponding to a traffic class associated with the queue to be sent to an egress port.
    • 一种方法包括接收多个请求,确定指定相应物理存储体的多个第一组标识符,以及至少基于第一组标识符,根据调度层次选择要处理的第一组请求。 选择第一组请求包括禁止任何两个请求与相同的第一个银行标识符相关联。 该方法还包括在单个处理周期期间处理在调度层次结构的单个级别内的相应节点处的第一组请求中的一个。 该方法还包括响应于至少在调度层次结构的单个级别中的相应节点处处理第一组请求中的一个请求,选择队列,并且至少响应于选择队列,引起一个或多个对应于 与队列相关联的流量类要发送到出口端口。
    • 40. 发明授权
    • Exact match lookup in network switch devices
    • 网络交换机设备中的精确匹配查找
    • US09171030B1
    • 2015-10-27
    • US13737608
    • 2013-01-09
    • Marvell Israel (M.I.S.L) Ltd.
    • Carmi AradGil Levy
    • G06F17/30
    • G06F17/3033H04L45/74H04L45/7453
    • In a method for populating a lookup table, a plurality of hash tables are provided. Each hash table is accessed by a respective hash function. A plurality of hashed values for a key are generated using the hash functions corresponding to the plurality of hash tables. The plurality of hashed values are used to determine whether the key can be inserted into one or more hash tables of the plurality of hash tables without colliding with keys previously stored at respective locations corresponding to the determined hashed values. When it is determined that the key can be inserted into multiple hash tables, it is then determined which one of the multiple hash tables is populated with the greatest number of keys. The hash table that is populated with the greatest number of keys is selected for insertion of the key, and the key is inserted into the selected hash table.
    • 在用于填充查找表的方法中,提供多个哈希表。 每个散列表都由相应的散列函数访问。 使用与多个哈希表相对应的哈希函数来生成密钥的多个散列值。 多个散列值用于确定密钥是否可以被插入到多个散列表的一个或多个哈希表中,而不会与先前存储在与确定的散列值对应的各个位置处的密钥相冲突。 当确定可以将密钥插入到多个散列表中时,则确定用最大数量的密钥填充多个散列表中的哪一个。 选择填充有最大数量的密钥的哈希表用于插入密钥,并将密钥插入到所选择的散列表中。