专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20060029079A1 Pipeline scheduler including a hierarchy of schedulers and multiple scheduling lanes 有权
标题翻译：流水线调度器包括调度器和多个调度通道的层次结构
公开(公告)号：US20060029079A1
公开(公告)日：2006-02-09
申请号：US10913055
申请日：2004-08-05
申请人： Earl Cohen , Robert Olsen , Eugene Feinberg , Gregory Ries
发明人： Earl Cohen , Robert Olsen , Eugene Feinberg , Gregory Ries
IPC分类号： H04L12/56 , H04L12/28
CPC分类号： H04L47/6215 , H04L47/263 , H04L47/50 , H04L47/60 , Y02D50/10
摘要： Disclosed is a hierarchy of individual schedulers with multiple scheduling lanes for scheduling items, such as, but not limited to packets or indications thereof, such that different classes of priority items can be propagated through the hierarchy of schedulers accordingly. A pipeline scheduler typically includes a root scheduler and one or more layers of schedulers with each of these layers including at least one scheduler. Each scheduler is configured to maintain items of different scheduling categories received from each of the particular scheduler's immediate children schedulers within the pipeline scheduler if any and from each immediate external source coupled to the particular scheduler if any, and to schedule the sending of the items of the different scheduling categories currently maintained to its parent schedule or external scheduler client. The items may correspond to packets, indications of packets, or any other entity.
摘要翻译：公开了具有用于调度项目的多个调度通道的单独调度器的层级，诸如但不限于分组或其指示，使得不同类别的优先级项目可以相应地通过调度器的分层传播。流水线调度器通常包括根调度器和一个或多个调度器层，其中每个层包括至少一个调度器。每个调度器被配置为维护从流水线调度器内的每个特定调度器的直接子调度器接收的不同调度类别的项目，如果有的话，并且从耦合到特定调度器的每个直接外部源（如果有的话），并且调度发送当前维护到其父计划或外部调度程序客户端的不同调度类别。这些项目可以对应于分组，分组的指示或任何其他实体。

2. 发明申请

US20050152374A1 Propagation of minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule 有权
标题翻译：在分级调度中调度层之间的最小保证调度速率的传播
公开(公告)号：US20050152374A1
公开(公告)日：2005-07-14
申请号：US11022246
申请日：2004-12-23
申请人： Earl Cohen , Robert Olsen , Christopher Kappler , Anna Charny
发明人： Earl Cohen , Robert Olsen , Christopher Kappler , Anna Charny
IPC分类号： H04L12/56
CPC分类号： H04L47/6215 , H04L47/263 , H04L47/50 , H04L47/521 , H04L47/522 , H04L47/60
摘要： Disclosed are, inter alia, methods, apparatus, data structures, computer-readable media, and mechanisms, which may include or be used with a hierarchy of schedules with propagation of minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule. The minimum guaranteed scheduling rate for a parent schedule entry is typically based on the summation of the minimum guaranteed scheduling rates of its immediate child schedule entries. This propagation of minimum rate scheduling guarantees for a class of traffic can be dynamic (e.g., based on the active traffic for this class of traffic, active services for this class of traffic), or statically configured. One embodiment also includes multiple scheduling lanes for scheduling items, such as, but not limited to packets or indications thereof, such that different categories of traffic (e.g., propagated minimum guaranteed scheduling rate, non-propagated minimum guaranteed scheduling rate, high priority, excess rate, etc.) of scheduled items can be propagated through the hierarchy of schedules accordingly without being blocked behind a lower priority or different type of traffic.
摘要翻译：公开的方法，装置，数据结构，计算机可读介质和机制，其可以包括或者与具有在分级调度中的调度层之间的最小保证调度速率的传播的调度层级一起使用。父计划条目的最小保证调度速率通常基于其直接子进程表项的最小保证调度速率的总和。对一类流量的最小速率调度保证的这种传播可以是动态的（例如，基于该类流量的活动流量，用于该类流量的活动服务）或静态配置。一个实施例还包括用于调度项目的多个调度通道，诸如但不限于分组或其指示，使得不同类别的业务（例如，传播的最小保证调度速率，非传播最小保证调度速率，高优先级，超量调度项目的速率等）可以相应地通过调度层次传播，而不会被阻塞在较低优先级或不同类型的业务量之上。

3. 发明申请

US20060153243A1 Scheduling eligible entries using an approximated finish delay identified for an entry based on an associated speed group 有权
公开(公告)号：US20060153243A1
公开(公告)日：2006-07-13
申请号：US11022220
申请日：2004-12-23
申请人： Doron Shoham , Christopher Kappler , Anna Charny , Earl Cohen , Robert Olsen
发明人： Doron Shoham , Christopher Kappler , Anna Charny , Earl Cohen , Robert Olsen
IPC分类号： H04J3/06
CPC分类号： H04L47/564 , H04L47/50
摘要： Eligible entries are scheduled using an approximated finish delay identified for an entry based on an associated speed group. One implementation maintains schedule entries, each respectively associated with a start time and a speed group. Each speed group is associated with an approximated finish delay. An approximated earliest finishing entry from the eligible schedule entries is determined that has an earliest approximated finish time, with the approximated finish time of an entry being determined based on the entry's start time and the approximated finish delay of the associated speed group. The scheduled action corresponding to the approximated earliest finishing entry is then typically performed. The action performed may, for example, correspond to the forwarding of one or more packets, an amount of processing associated with a process or thread, or any activity associated with an item.

4. 发明申请

US20060029080A1 Using burst tolerance values in time-based schedules 有权
标题翻译：在基于时间的计划中使用突发公差值
公开(公告)号：US20060029080A1
公开(公告)日：2006-02-09
申请号：US11070932
申请日：2005-03-03
申请人： Christopher Kappler , Anna Charny , Robert Olsen , Earl Cohen
发明人： Christopher Kappler , Anna Charny , Robert Olsen , Earl Cohen
IPC分类号： H04L12/28
CPC分类号： H04L47/6215 , H04L47/263 , H04L47/50 , H04L47/60 , Y02D50/10
摘要： Schedules may use burst tolerance values to adjust the scheduling in a time-based schedule, such as, but not limited to, adjusting for accumulated but not used bandwidth, and/or adjusting eligibility of schedule entries. A best schedule item associated with an eligible schedule entry of a schedule is identified. Whether or not a particular schedule entry is eligible is typically determined based on the relationship of an associated timestamp with a current scheduling time, such as its timestamp being less than or equal to the current time. A burst tolerance time bound might also be used to allow certain priorities and/or types of items to be considered eligible if even its timestamp exceeds the current time by an amount, but less than or equal to the burst tolerance time bound. When a schedule entry which has been dormant becomes active, its one or more timestamps are typically initialized, which may include setting at least one of these timestamps behind current time by a wakeup burst tolerance value to guarantee its immediate eligibility for one or more consecutive scheduling iterations.
摘要翻译：时间表可以使用突发容忍值来调整基于时间的时间表中的调度，例如但不限于调整累积但未使用的带宽，和/或调整调度条目的资格。识别与计划的合格日程表项相关联的最佳计划项目。通常基于相关联的时间戳与当前调度时间（例如其时间戳小于或等于当前时间）的关系来确定特定调度条目是否合格。如果即使其时间戳超过当前时间但小于或等于突发容忍时间限制，则突发公差时间限制也可用于允许某些优先级和/或类型的项目被认为是合格的。当已经休眠的调度项目变为活动时，其一个或多个时间戳通常被初始化，其可以包括将当前时间后面的这些时间戳中的至少一个设置为唤醒突发容忍值，以保证其立即符合一个或多个连续调度迭代。

5. 发明申请

US20070248110A1 Dynamically switching streams of packets among dedicated and shared queues 有权
标题翻译：在专用和共享队列之间动态切换数据包流
公开(公告)号：US20070248110A1
公开(公告)日：2007-10-25
申请号：US11407805
申请日：2006-04-20
申请人： Doron Oz , Earl Cohen , Eyal Oren
发明人： Doron Oz , Earl Cohen , Eyal Oren
IPC分类号： H04L12/56
CPC分类号： H04L47/10 , H04L47/2408 , H04L47/2441 , H04L49/90 , H04L49/9047
摘要： Streams of packets are dynamically switched among dedicated and shared queues. For example, when a packet stream is in a maintenance mode (such as to keep a tunnel or packet stream associated with a server active) all packet traffic received over a packet stream is directed into the shared queue while the packet stream is not associated with one of the dedicated queues. In response to a detected change in the packet activity status of packet traffic (e.g., the establishment of a call or an increase in packet traffic, especially desirous of individualized quality of service) over a particular packet stream of the packet streams, the particular packet stream is associated with a particular group of dedicated queues such that at least non-control data traffic received over the particular packet stream is subsequently directed into the particular group of dedicated queues while the particular packet stream remains associated with the particular group of dedicated queues.
摘要翻译：数据包流在专用和共享队列之间动态切换。例如，当分组流处于维护模式（例如保持与服务器活动的隧道或分组流相关联）时，通过分组流接收的所有分组流量被引导到共享队列中，而分组流不与其中一个专用队列。响应于分组流的特定分组流检测到分组业务的分组活动状态（例如，建立呼叫或增加分组业务，特别是希望个体化服务质量）的变化，特定分组流与特定组的专用队列相关联，使得至少在特定分组流上接收到的非控制数据业务随后被引导到特定的专用队列组，而特定分组流保持与特定组的专用队列相关联。

6. 发明申请

US20070133581A1 Memory buffering with fast packet information access for a network device 有权
标题翻译：具有网络设备快速分组信息访问的内存缓冲
公开(公告)号：US20070133581A1
公开(公告)日：2007-06-14
申请号：US11298965
申请日：2005-12-09
申请人： Sha Ma , Earl Cohen
发明人： Sha Ma , Earl Cohen
IPC分类号： H04L12/56 , H04L12/28
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.
摘要翻译：一种采用存储器缓冲的网络设备，其中第一存储器在逻辑上被配置成块，并且所述块被逻辑地配置成颗粒，其中第二存储器被配置为镜像其中分配了第二存储器中固定位数的第一存储器对于第一存储器中的每个粒子，使得存储在第一存储器中的分组的调度和数据报长度可以存储在第二存储器中。描述和要求保护其他实施例。

7. 发明申请

US20130290618A1 HIGHER-LEVEL REDUNDANCY INFORMATION COMPUTATION 有权
标题翻译：高水平的冗员信息计算
公开(公告)号：US20130290618A1
公开(公告)日：2013-10-31
申请号：US13979805
申请日：2012-01-18
申请人： Jeremy Isaac Nathaniel Werner , Leonid Baryudin , Timothy Canepa , Earl Cohen
发明人： Jeremy Isaac Nathaniel Werner , Leonid Baryudin , Timothy Canepa , Earl Cohen
IPC分类号： G06F12/02
CPC分类号： G06F12/0246 , G06F11/1044 , G06F11/108 , G06F11/2094
摘要： Higher-level redundancy information computation enables a Solid-State Disk (SSD) controller to provide higher-level redundancy capabilities to maintain reliable operation in a context of failures of non-volatile (e.g. flash) memory elements during operation of an SSD. A first portion of higher-level redundancy information is computed using parity coding via an XOR of all pages in a portion of data to be protected by the higher-level redundancy information. A second portion of the higher-level redundancy information is computed using a weighted-sum technique, each page in the portion being assigned a unique non-zero “index” as a weight when computing the weighted-sum. Arithmetic is performed over a finite field (such as a Galois Field). The portions of the higher-level redundancy information are computable in any order, such as an order based on order of read operation completion of non-volatile memory elements.
摘要翻译：高级冗余信息计算使得固态盘（SSD）控制器能够提供更高级别的冗余能力，以在SSD的运行期间在非易失性（例如闪存）存储器元件的故障的上下文中维持可靠的操作。高级冗余信息的第一部分是使用奇偶校验编码来计算的，该奇偶编码经由待被较高级别冗余信息保护的数据的一部分中的所有页面的异或。使用加权和技术来计算较高级冗余信息的第二部分，当计算加权和时，该部分中的每个页面被分配唯一的非零“索引”作为权重。在有限域（例如伽罗瓦域）上执行算术。高级冗余信息的部分可以以任何顺序计算，诸如基于非易失性存储器元件的读操作完成顺序的顺序。

8. 发明申请

US20070201870A1 Buffering schemes for optical packet processing 有权
标题翻译：用于光分组处理的缓冲方案
公开(公告)号：US20070201870A1
公开(公告)日：2007-08-30
申请号：US11410566
申请日：2006-04-24
申请人： Earl Cohen , Garry Epps
发明人： Earl Cohen , Garry Epps
IPC分类号： H04J14/00
CPC分类号： H04J14/0227 , H04J14/0238 , H04J14/0241 , H04Q11/0005 , H04Q11/0066 , H04Q2011/002 , H04Q2011/0032 , H04Q2011/0039 , H04Q2011/0041 , H04Q2011/0045 , H04Q2011/005
摘要： An optical packet processor includes one or more optical packet inputs that receive asynchronous optical packets. An optical packet interconnect directs the optical packets from the different optical packet inputs to different optical packet outputs. The optical packets are buffered either before or after being directed from the inputs to the different outputs. Problems associated with optical buffering are overcome by synchronizing the asynchronous optical packets with the optical packet buffers. The novel optical buffer architectures described also reduce or eliminate the use of certain high cost optical components.
摘要翻译：光分组处理器包括接收异步光分组的一个或多个光分组输入。光分组互连将光分组从不同的光分组输入引导到不同的光分组输出。光分组在从输入引导到不同输出之前或之后被缓冲。通过使异步光学分组与光学分组缓冲器同步来克服与光学缓冲相关的问题。所描述的新型光学缓冲器架构还减少或消除了某些高成本光学部件的使用。

9. 发明申请

US20070022084A1 Hashing assist for network processors 有权
标题翻译：网络处理器的哈希协助
公开(公告)号：US20070022084A1
公开(公告)日：2007-01-25
申请号：US11189584
申请日：2005-07-25
申请人： Earl Cohen , Ibrahim Delibalta , Jonathan Rosen
发明人： Earl Cohen , Ibrahim Delibalta , Jonathan Rosen
IPC分类号： G06F7/00
CPC分类号： G06F17/30286 , H04L45/745
摘要： A resource unit has a request interface to allow the unit to receive a request and associated data. The resource unit also has a hashing engine to create a hash of the associated data, a modulo engine to create a modulus result, a read engine to perform a memory read, and a results interface to allow the device to return results.
摘要翻译：资源单元具有允许单元接收请求和关联数据的请求接口。资源单元还具有哈希引擎来创建关联数据的散列，用于创建模数结果的模引擎，执行存储器读取的读引擎，以及允许设备返回结果的结果接口。

10. 发明申请

US20060262720A1 Method and system for providing delay bound and prioritized packet dropping 有权
公开(公告)号：US20060262720A1
公开(公告)日：2006-11-23
申请号：US11134898
申请日：2005-05-23
申请人： Anna Charny , Christopher Kappler , Sandeep Bajaj , Earl Cohen
发明人： Anna Charny , Christopher Kappler , Sandeep Bajaj , Earl Cohen
IPC分类号： H04L12/26 , H04L12/56
CPC分类号： H04L47/10 , H04L47/2408 , H04L47/2416 , H04L47/2441 , H04L47/283 , H04L47/32 , H04L49/90 , H04L49/9015 , H04L49/9084 , H04L49/9094
摘要： A method and system for providing delay bound and prioritized packet dropping are disclosed. The system limits the size of a queue configured to deliver packets in FIFO order by a threshold based on a specified delay bound. Received packets are queued if the threshold is not exceeded. If the threshold is exceeded, a packet having a precedence level less than that of the precedence level of the received packet is dropped. If all packets in the queue have a precedence level greater than that of the packet received, then the received packet is dropped if the threshold is exceeded.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式