Pipeline scheduler including a hierarchy of schedulers and multiple scheduling lanes
    1.
    发明授权
    Pipeline scheduler including a hierarchy of schedulers and multiple scheduling lanes 有权
    流水线调度器包括调度器和多个调度通道的层次结构

    公开(公告)号:US07876763B2

    公开(公告)日:2011-01-25

    申请号:US10913055

    申请日:2004-08-05

    IPC分类号: H04L12/28

    摘要: 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.

    摘要翻译: 公开了具有用于调度项目的多个调度通道的单独调度器的层级,诸如但不限于分组或其指示,使得不同类别的优先级项目可以相应地通过调度器的分层传播。 流水线调度器通常包括根调度器和一个或多个调度器层,其中每个层包括至少一个调度器。 每个调度器被配置为维护从流水线调度器内的每个特定调度器的直接子调度器接收的不同调度类别的项目,如果有的话,并且从每个立即外部源耦合到特定调度器(如果有的话),并且调度发送 当前维护到其父计划或外部调度程序客户端的不同调度类别。 这些项目可以对应于分组,分组的指示或任何其他实体。

    In-band device enrollment without access point support
    2.
    发明授权
    In-band device enrollment without access point support 有权
    无接入点支持的带内设备注册

    公开(公告)号:US08014529B2

    公开(公告)日:2011-09-06

    申请号:US11465678

    申请日:2006-08-18

    IPC分类号: H04K1/00 H04M1/66

    摘要: In one embodiment, the invention provides a method for configuring a wireless device, so as to enable the wireless device to join a secured wireless network, by broadcasting a series of broadcast packets encoding a network configuration parameter (e.g., a shared secret key) from a computer coupled to a wireless access point to the wireless device. The information representing the network configuration parameter is encoded, not within the payload portion of the packet, but within the length of each broadcast packet in the series of broadcast packets. Accordingly, a wireless device that has not yet been configured to receive packets from the wireless access point can observe the information encoded in the length of each broadcast packet, and thereby decode the network configuration parameter and join the network.

    摘要翻译: 在一个实施例中,本发明提供了一种用于配置无线设备的方法,以便使无线设备能够通过将编码网络配置参数(例如,共享密钥)的一系列广播分组广播到 耦合到无线接入点的无线设备的计算机。 表示网络配置参数的信息被编码,而不是在分组的有效载荷部分内,但是在一系列广播分组中的每个广播分组的长度内。 因此,尚未被配置为从无线接入点接收分组的无线设备可以观察以每个广播分组的长度编码的信息,从而解码网络配置参数并加入网络。

    IN-BAND DEVICE ENROLLMENT WITHOUT ACCESS POINT SUPPORT
    3.
    发明申请
    IN-BAND DEVICE ENROLLMENT WITHOUT ACCESS POINT SUPPORT 有权
    带接收点支持的带内设备插入

    公开(公告)号:US20080046545A1

    公开(公告)日:2008-02-21

    申请号:US11465678

    申请日:2006-08-18

    IPC分类号: G06F15/177

    摘要: In one embodiment, the invention provides a method for configuring a wireless device, so as to enable the wireless device to join a secured wireless network, by broadcasting a series of broadcast packets encoding a network configuration parameter (e.g., a shared secret key) from a computer coupled to a wireless access point to the wireless device. The information representing the network configuration parameter is encoded, not within the payload portion of the packet, but within the length of each broadcast packet in the series of broadcast packets. Accordingly, a wireless device that has not yet been configured to receive packets from the wireless access point can observe the information encoded in the length of each broadcast packet, and thereby decode the network configuration parameter and join the network.

    摘要翻译: 在一个实施例中,本发明提供了一种用于配置无线设备的方法,以便使无线设备能够通过将编码网络配置参数(例如,共享密钥)的一系列广播分组广播到 耦合到无线接入点的无线设备的计算机。 表示网络配置参数的信息被编码,而不是在分组的有效载荷部分内,但是在一系列广播分组中的每个广播分组的长度内。 因此,尚未被配置为从无线接入点接收分组的无线设备可以观察以每个广播分组的长度编码的信息,从而解码网络配置参数并加入网络。

    Scheduling eligible entries using an approximated finish delay identified for an entry based on an associated speed group
    4.
    发明授权
    Scheduling eligible entries using an approximated finish delay identified for an entry based on an associated speed group 有权
    使用基于相关联的速度组为入口标识的近似完成延迟来计划合格条目

    公开(公告)号:US07599381B2

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

    申请号:US11022220

    申请日:2004-12-23

    IPC分类号: H04L12/56 H04L12/28

    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.

    摘要翻译: 使用基于相关联的速度组为入口识别的近似完成延迟来安排合格条目。 一个实现维护计划条目,每个进度条目分别与开始时间和速度组相关联。 每个速度组与近似的完成延迟相关联。 确定具有最早近似完成时间的合格调度条目中的近似最早的整理条目,其中基于条目的开始时间和相关联的速度组的近似完成延迟来确定条目的近似完成时间。 然后通常执行与近似最早的完成条目相对应的调度动作。 执行的动作可以例如对应于一个或多个分组的转发,与进程或线程相关联的处理量或与项目相关联的任何活动。

    Propagation of minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule
    5.
    发明授权
    Propagation of minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule 有权
    在分级调度中调度层之间的最小保证调度速率的传播

    公开(公告)号:US08325736B2

    公开(公告)日:2012-12-04

    申请号:US12426245

    申请日:2009-04-18

    IPC分类号: H04L12/56

    摘要: A hierarchy of schedules propagate 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.

    摘要翻译: 调度层级在分层调度中传播调度层中的最小保证调度速率。 父计划条目的最小保证调度速率通常基于其直接子进程表项的最小保证调度速率的总和。 对一类流量的最小速率调度保证的这种传播可以是动态的(例如,基于该类流量的活动流量,用于该类流量的活动服务)或静态配置。 一个实施例还包括用于调度项目的多个调度通道,诸如但不限于分组或其指示,使得不同类别的业务(例如,传播的最小保证调度速率,非传播最小保证调度速率,高优先级,超量 调度项目的速率等)可以相应地通过调度层次传播,而不会被阻塞在较低优先级或不同类型的业务量之上。

    Using burst tolerance values in time-based schedules
    6.
    发明授权
    Using burst tolerance values in time-based schedules 有权
    在基于时间的计划中使用突发公差值

    公开(公告)号:US08077618B2

    公开(公告)日:2011-12-13

    申请号:US11070932

    申请日:2005-03-03

    IPC分类号: H04L12/26 H04L12/28 H04L12/56

    摘要: 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.

    摘要翻译: 时间表可以使用突发容忍值来调整基于时间的时间表中的调度,例如但不限于调整累积但未使用的带宽,和/或调整调度条目的资格。 识别与计划的合格日程表项相关联的最佳计划项目。 通常基于相关联的时间戳与当前调度时间(例如其时间戳小于或等于当前时间)的关系来确定特定调度条目是否合格。 如果即使其时间戳超过当前时间但小于或等于突发容忍时间限制,则突发公差时间限制也可用于允许某些优先级和/或类型的项目被认为是合格的。 当已经休眠的调度项目变为活动时,其一个或多个时间戳通常被初始化,其可以包括将当前时间后面的这些时间戳中的至少一个设置为唤醒突发容忍值,以保证其立即符合一个或多个连续调度 迭代。

    PROPAGATION OF MINIMUM GUARANTEED SCHEDULING RATES AMONG SCHEDULING LAYERS IN A HIERARCHICAL SCHEDULE
    7.
    发明申请
    PROPAGATION OF MINIMUM GUARANTEED SCHEDULING RATES AMONG SCHEDULING LAYERS IN A HIERARCHICAL SCHEDULE 有权
    在层次分析表中调度层的最小保证调度率的传播

    公开(公告)号:US20090207846A1

    公开(公告)日:2009-08-20

    申请号:US12426245

    申请日:2009-04-18

    IPC分类号: H04L12/56

    摘要: A hierarchy of schedules propagate 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.

    摘要翻译: 调度层级在分层调度中传播调度层中的最小保证调度速率。 父计划条目的最小保证调度速率通常基于其直接子进程表项的最小保证调度速率的总和。 对一类流量的最小速率调度保证的这种传播可以是动态的(例如,基于该类流量的活动流量,用于该类流量的活动服务)或静态配置。 一个实施例还包括用于调度项目的多个调度通道,诸如但不限于分组或其指示,使得不同类别的业务(例如,传播的最小保证调度速率,非传播最小保证调度速率,高优先级,超量 调度项目的速率等)可以相应地通过调度层次传播,而不会被阻塞在较低优先级或不同类型的业务量之上。

    Propagation of minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule
    8.
    发明授权
    Propagation of minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule 有权
    在分级调度中调度层之间的最小保证调度速率的传播

    公开(公告)号:US07522609B2

    公开(公告)日:2009-04-21

    申请号:US11022246

    申请日:2004-12-23

    IPC分类号: H04L12/56

    摘要: Methods, apparatus, data structures, computer-readable media, and mechanisms 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.

    摘要翻译: 方法,装置,数据结构,计算机可读介质和机制可以包括或者与分级调度中的调度层中具有最小保证调度速率的传播的调度层次结合使用。 父计划条目的最小保证调度速率通常基于其直接子进程表项的最小保证调度速率的总和。 对一类流量的最小速率调度保证的这种传播可以是动态的(例如,基于该类流量的活动流量,用于该类流量的活动服务)或静态配置。 一个实施例还包括用于调度项目的多个调度通道,诸如但不限于分组或其指示,使得不同类别的业务(例如,传播的最小保证调度速率,非传播最小保证调度速率,高优先级,超量 调度项目的速率等)可以相应地通过调度层次传播,而不会被阻塞在较低优先级或不同类型的业务量之上。

    Flash memory read scrub and channel tracking
    9.
    发明授权
    Flash memory read scrub and channel tracking 有权
    闪存读取擦除和通道跟踪

    公开(公告)号:US08914696B2

    公开(公告)日:2014-12-16

    申请号:US13597489

    申请日:2012-08-29

    CPC分类号: G06F11/106

    摘要: An apparatus having a first circuit and a second circuit is disclosed. The first circuit may be configured to (i) read data from a region of a memory circuit during a read scrub of the region and (ii) generate a plurality of statistics based on (a) the data and (b) one or more bit flips performed during an error correction of the data. The memory circuit is generally configured to store the data in a nonvolatile condition. One or more reference voltages may be used to read the data. The second circuit may be configured to (i) update a plurality of parameters of the region based on the statistics and (ii) compute updated values of the reference voltages based on the parameters.

    摘要翻译: 公开了一种具有第一电路和第二电路的装置。 第一电路可以被配置为(i)在区域的读取擦除期间从存储器电路的区域读取数据,以及(ii)基于(a)数据生成多个统计信息,以及(b)一个或多个位 在数据的错误校正期间执行翻转。 存储器电路通常被配置为将数据存储在非易失性状态中。 可以使用一个或多个参考电压来读取数据。 第二电路可以被配置为(i)基于统计信息来更新区域的多个参数,以及(ii)基于参数计算参考电压的更新值。

    Scalable database management software on a cluster of nodes using a shared-distributed flash memory
    10.
    发明授权
    Scalable database management software on a cluster of nodes using a shared-distributed flash memory 有权
    使用共享分布式闪存的节点群集上的可扩展数据库管理软件

    公开(公告)号:US08667001B2

    公开(公告)日:2014-03-04

    申请号:US13528064

    申请日:2012-06-20

    IPC分类号: G06F7/00 G06F17/30

    摘要: A distributed database system has multiple compute nodes each running an instance of a database management system (DBMS) program that accesses database records in a local buffer cache. Records are persistently stored in distributed flash memory on multiple storage nodes. A Sharing Data Fabric (SDF) is a middleware layer between the DBMS programs and the storage nodes and has API functions called by the DBMS programs when a requested record is not present in the local buffer cache. The SDF fetches the requested record from flash memory and loads a copy into the local buffer cache. The SDF has threads on a home storage node that locate database records using a node map. A global cache directory locks and pins records to local buffer caches for updating by a node's DBMS program. DBMS operations are grouped into transactions that are committed or aborted together as a unit.

    摘要翻译: 分布式数据库系统具有多个计算节点,每个运行节点都运行数据库管理系统(DBMS)程序的实例,该程序访问本地缓冲区高速缓存中的数据库记录。 记录永久存储在多个存储节点上的分布式闪存中。 共享数据结构(SDF)是DBMS程序和存储节点之间的中间件层,当本地缓冲区高速缓存中不存在所请求的记录时,具有由DBMS程序调用的API函数。 SDF从闪存中提取所请求的记录,并将副本加载到本地缓冲区高速缓存中。 SDF在家用存储节点上具有使用节点映射定位数据库记录的线程。 全局缓存目录锁定和引导记录到本地缓冲区高速缓存,以便由节点的DBMS程序进行更新。 DBMS操作被分组为作为一个单元一起提交或中止的事务。