利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

110 条记录 (耗时 0.036 秒)

    COMMITTED PROCESSING RATES FOR SHARED RESOURCES
    1.
    发明申请
    COMMITTED PROCESSING RATES FOR SHARED RESOURCES 审中-公开
    共同资源的承诺加工费率

    公开(公告)号：US20110238857A1

    公开(公告)日：2011-09-29

    申请号：US12749449

    申请日：2010-03-29

    申请人： Tate Andrew Certain ,  Roland Paterson-Jones ,  James R. Hamilton ,  Sachin Jain ,  Matthew S. Garman ,  David N. Sunderland ,  Danny Wei ,  Fiorenzo Cattaneo

    发明人： Tate Andrew Certain ,  Roland Paterson-Jones ,  James R. Hamilton ,  Sachin Jain ,  Matthew S. Garman ,  David N. Sunderland ,  Danny Wei ,  Fiorenzo Cattaneo

    IPC分类号： G06F15/16 ,  G06F17/30

    CPC分类号： G06F9/5044 ,  G06F2209/501

    摘要： Customers of a shared-resource environment can provision resources in a fine-grained manner that meets specific performance requirements. A customer can provision a data volume with a committed rate of Input/Output Operations Per Second (IOPS) and pay only for that commitment (plus any overage), and the amount of storage requested. The customer will then at any time be able to complete at least the committed rate of IOPS. If the customer generates submissions at a rate that exceeds the committed rate, the resource can still process at the higher rate when the system is not under pressure. Even under pressure, the system will deliver at least the committed rate. Multiple customers can be provisioned on the same resource, and more than one customer can have a committed rate on that resource. Customers without committed or guaranteed rates can utilize the uncommitted portion, or committed portions that are not being used.

    摘要翻译： 共享资源环境的客户可以以满足特定性能要求的细粒度方式提供资源。 客户可以提供具有每秒输入/输出操作（IOPS）的承诺速率的数据量，并且仅支付该承诺（加上任何超量）以及所请求的存储量。 客户随时可以至少完成IOPS的承诺率。 如果客户以超过承诺率的速度生成提交资料，则当系统不受压力时，资源仍可以以较高的速率进行处理。 即使在压力下，系统至少将提供承诺率。 多个客户可以在同一资源上进行配置，多个客户可以在该资源上具有承诺费率。 没有承诺或保证费率的客户可以使用未提交的部分或未被使用的承诺部分。

    Balancing latency and throughput for shared resources
    5.
    发明授权
    Balancing latency and throughput for shared resources 有权
    平衡共享资源的延迟和吞吐量

    公开(公告)号：US08473646B1

    公开(公告)日：2013-06-25

    申请号：US13530050

    申请日：2012-06-21

    申请人： Tate Andrew Certain ,  Roland Paterson-Jones ,  James R. Hamilton

    发明人： Tate Andrew Certain ,  Roland Paterson-Jones ,  James R. Hamilton

    IPC分类号： G06F3/00 ,  G06F5/00 ,  G06F13/00 ,  G06F13/28

    CPC分类号： G06F13/1626 ,  G06F3/0611 ,  G06F3/0659 ,  G06F3/0673

    摘要： Input and output (I/O) operations performed by a data storage device are managed dynamically to balance aspects such as throughput and latency. Sequential read and write requests are sent to a data storage device whereby the corresponding operations are performed without time delay due to extra disk revolutions. In order to minimize latency, particularly for read operations, random read and write requests are held in a queue upstream of an I/O controller of the data storage device until the buffer of the data storage device is empty. The queued requests can be reordered when a higher priority request is received, improving the overall latency for specific requests. An I/O scheduler of a data server is still able to use any appropriate algorithm to order I/O requests, such as by prioritizing reads over writes as long as the writes do not back up in the I/O queue beyond a certain threshold.

    摘要翻译： 由数据存储设备执行的输入和输出（I / O）操作被动态地管理以平衡诸如吞吐量和延迟的方面。 顺序读写请求被发送到数据存储设备，由此由于额外的磁盘转数，相应的操作没有时间延迟。 为了最小化延迟，特别是对于读取操作，随机读取和写入请求被保存在数据存储设备的I / O控制器上游的队列中，直到数据存储设备的缓冲器为空。 当接收到更高优先级的请求时，排队的请求可以重新排序，从而提高特定请求的总体延迟。 数据服务器的I / O调度器仍然能够使用任何适当的算法来排序I / O请求，例如通过对写入进行优先级排序，只要写入不在I / O队列中备份超过某个阈值 。

    Adaptive throttling for shared resources
    6.
    发明授权
    Adaptive throttling for shared resources 有权

    公开(公告)号：US09712453B1

    公开(公告)日：2017-07-18

    申请号：US13429735

    申请日：2012-03-26

    申请人： Tate Andrew Certain ,  James R. Hamilton

    发明人： Tate Andrew Certain ,  James R. Hamilton

    IPC分类号： G06F15/173 ,  H04L12/911

    CPC分类号： H04L47/70 ,  G06F9/00 ,  H04L41/5009 ,  H04L41/5025 ,  H04L41/5035 ,  H04L43/00 ,  H04L43/0817 ,  H04L43/0852 ,  H04L47/10

    摘要： Customers of shared resources in a multi-tenant environment can have token buckets allocated that have an associated depth and fill rate, with each token enabling the customer to obtain an amount of work from a shared resource. A resource management system can monitor one or more system or output metrics, and can adjust a global fill rate based at least in part upon values of the monitored metrics. Such an approach can provide a fair distribution of work among the customers, while ensuring that the metrics stay within acceptable ranges and there are no drastic changes in performance levels of the system. The fill rate can update dynamically with changes in the monitored parameters, such that the system can float near an equilibrium point. Commitments for specific minimum service levels also can be met.

    Balancing latency and throughput for shared resources
    7.
    发明授权
    Balancing latency and throughput for shared resources 有权
    平衡共享资源的延迟和吞吐量

    公开(公告)号：US08239589B1

    公开(公告)日：2012-08-07

    申请号：US12751957

    申请日：2010-03-31

    申请人： Tate Andrew Certain ,  Roland Paterson-Jones ,  James R. Hamilton

    发明人： Tate Andrew Certain ,  Roland Paterson-Jones ,  James R. Hamilton

    IPC分类号： G06F3/00 ,  G06F13/00 ,  G06F13/28

    CPC分类号： G06F13/1626 ,  G06F3/0611 ,  G06F3/0659 ,  G06F3/0673

    摘要： Input and output (I/O) operations performed by a data storage device are managed dynamically to balance aspects such as throughput and latency. Sequential read and write requests are sent to a data storage device whereby the corresponding operations are performed without time delay due to extra disk revolutions. In order to minimize latency, particularly for read operations, random read and write requests are held in a queue upstream of an I/O controller of the data storage device until the buffer of the data storage device is empty. The queued requests can be reordered when a higher priority request is received, improving the overall latency for specific requests. An I/O scheduler of a data server is still able to use any appropriate algorithm to order I/O requests, such as by prioritizing reads over writes as long as the writes do not back up in the I/O queue beyond a certain threshold.

    摘要翻译： 由数据存储设备执行的输入和输出（I / O）操作被动态地管理以平衡诸如吞吐量和延迟的方面。 顺序读写请求被发送到数据存储设备，由此由于额外的磁盘转数，相应的操作没有时间延迟。 为了最小化延迟，特别是对于读取操作，随机读取和写入请求被保存在数据存储设备的I / O控制器上游的队列中，直到数据存储设备的缓冲器为空。 当接收到更高优先级的请求时，排队的请求可以重新排序，从而提高特定请求的总体延迟。 数据服务器的I / O调度器仍然能够使用任何适当的算法来排序I / O请求，例如通过对写入进行优先级排序，只要写入不在I / O队列中备份超过某个阈值 。

    System and method for secure deletion of data
    8.
    发明授权
    System and method for secure deletion of data 有权

    公开(公告)号：US09749132B1

    公开(公告)日：2017-08-29

    申请号：US13305340

    申请日：2011-11-28

    申请人： James R. Hamilton

    发明人： James R. Hamilton

    IPC分类号： H04L29/06 ,  H04L9/08 ,  G06F21/10

    CPC分类号： H04L9/0869 ,  G06F21/10 ,  G06F21/602 ,  H04L9/0894 ,  H04L9/14

    摘要： Systems and methods for secure deletion of data items in a storage system may support the deletion of stored data item. In response to a storage request, a storage manager may generate a key corresponding to the data item to be stored and encrypt the data item before storing the data item in a data store. The key may be stored in an index comprising metadata corresponding to the data item. In response to a delete request, the storage system may determine the corresponding metadata entry in the index and remove the key corresponding to the data item without accessing the data item.

    System and method with timing self-configuration
    9.
    发明授权
    System and method with timing self-configuration 有权
    具有定时自配置的系统和方法

    公开(公告)号：US09570253B1

    公开(公告)日：2017-02-14

    申请号：US13305286

    申请日：2011-11-28

    申请人： James R. Hamilton

    发明人： James R. Hamilton

    IPC分类号： H01H3/00 ,  H01H11/00 ,  H05B39/08 ,  H01H3/26 ,  H03K17/96

    CPC分类号： H01H47/22 ,  H01H3/26 ,  H01H9/56 ,  H01H11/0062 ,  H01H71/125 ,  H01H71/44 ,  H01H2300/018 ,  H03K17/96 ,  H05B39/08

    摘要： A method of operating an automatic transfer switch to switch an electrical load from one power source to another power source includes measuring one or more characteristics of a switching circuit in the automatic transfer switch. A value of one or more timing variables is determined based on the measured characteristics of the switching circuit. The switching circuit is operated to close relays in the automatic transfer switch. The timing of closing of the relays is based on the value of the timing variables.

    摘要翻译： 操作自动转换开关以将电负载从一个电源切换到另一个电源的方法包括测量自动转换开关中的开关电路的一个或多个特性。 基于测量的开关电路的特性来确定一个或多个定时变量的值。 开关电路被操作以关闭自动转换开关中的继电器。 继电器闭合的时间是基于时序变量的值。

    Distributed routing architecture
    10.
    发明授权
    Distributed routing architecture 有权
    分布式路由架构

    公开(公告)号：US08902897B2

    公开(公告)日：2014-12-02

    申请号：US13620281

    申请日：2012-09-14

    申请人： James R. Hamilton ,  Alan M. Judge ,  David J. McGaugh ,  Justin O. Pietsch ,  David J. O'Meara

    发明人： James R. Hamilton ,  Alan M. Judge ,  David J. McGaugh ,  Justin O. Pietsch ,  David J. O'Meara

    IPC分类号： H04L12/28 ,  H04L12/56 ,  H04L12/715 ,  H04L12/775

    CPC分类号： H04L45/04 ,  H04L45/58 ,  H04L47/125

    摘要： A hierarchical distributed routing architecture including at least two levels, or layers, for receiving, processing and forwarding data packets between network components is provided. The core level router components receive an incoming packet from a network component and identify a distribution level router component based on processing a subset of the destination address associated with the received packet. The distribution level router components receive a forwarded packet and forward the packet to a respective network. The mapping, or other assignment, of portions of the FIB associated with the distributed routing environment is managed by a router management component.

    摘要翻译： 提供了包括用于在网络组件之间接收，处理和转发数据分组的至少两个级别或层级的分层分布式路由架构。 核心级路由器组件从网络组件接收传入分组，并且基于处理与接收到的分组相关联的目的地地址的子集来识别分布级路由器组件。 分发级路由器组件接收转发的分组，并将分组转发到相应的网络。 与分布式路由环境相关联的FIB的部分的映射或其他分配由路由器管理组件管理。