知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

21 records (took 0.018 seconds)

    Virtual data storage service with sparse provisioning
    13.
    发明授权
    Virtual data storage service with sparse provisioning 有权

    公开(公告)号：US09304687B1

    公开(公告)日：2016-04-05

    申请号：US14705474

    申请日：2015-05-06

    Applicant: Amazon Technologies, Inc.

    Inventor： Roland Paterson-Jones ,  Sachin Jain ,  Tate Andrew Certain

    IPC: G06F12/10 ,  G06F3/06

    CPC classification number: G06F3/0608 ,  G06F3/0631 ,  G06F3/0664 ,  G06F3/067 ,  G06F12/0223 ,  G06F12/023 ,  G06F2212/702

    Abstract: Virtual data stores may be sparsely provisioned by virtual data storage services in a manner that controls risk of implementation resource shortages. Relationships between requested data storage space size, data storage server capacity, allocated data storage space size and/or allocated data storage space utilization may be tracked on a per data store, per customer, per data storage server, and/or a per virtual data storage service basis. For each such basis, a set of constraints may be specified to control the relationships. The set of constraints may be enforced during implementation resource allocation, and by migration of data storage space portions to different implementation resources as part of a sparse provisioning load balancing. Sparse provisioning details may be made explicit to virtual data storage service customers to varying degrees including explicit, aggregate on a per customer basis, and aggregate on a per virtual data storage service basis.

    MANAGING OPERATIONAL THROUGHPUT FOR SHARED RESOURCES
    14.
    发明申请
    MANAGING OPERATIONAL THROUGHPUT FOR SHARED RESOURCES 审中-公开
    管理共享资源的运营

    公开(公告)号：US20140180862A1

    公开(公告)日：2014-06-26

    申请号：US14191194

    申请日：2014-02-26

    Applicant: Amazon Technologies, Inc.

    Inventor： Tate Andrew Certain ,  Sachin Jain ,  Bradley Eugene Marshall ,  Nicholas J. Maniscalco ,  Swarninathan Sivasubramanian ,  Matthew S. Garman

    IPC: G06Q30/08

    CPC classification number: H04L15/16 ,  G06Q30/00 ,  G06Q30/08 ,  G06Q40/06 ,  G06T15/20

    Abstract: Usage of shared resources can be managed by enabling users to obtain different types of guarantees at different times for various types and/or levels of resource capacity. A user can select to have an amount or rate of capacity dedicated to that user. A user can also select reserved capacity for at least a portion of the requests, tasks, or program execution for that user, where the user has priority to that capacity but other users can utilize the excess capacity during other periods. Users can alternatively specify to use the excess capacity or other variable, non-guaranteed capacity. The capacity can be for any appropriate functional aspect of a resource, such as computational capacity, throughput, latency, bandwidth, and storage. Users can submit bids for various types and combinations of excess capacity, and winning bids can receive dedicated use of the excess capacity for at least a period of time.

    Abstract translation: 可以通过使用户在不同类型和/或资源级别的不同时间获得不同类型的保证来管理共享资源的使用。 用户可以选择具有专用于该用户的容量或速率。 用户还可以为该用户的至少一部分请求，任务或程序执行选择保留的容量，其中用户具有该容量的优先权，但是其他用户可以在其他时段期间利用过剩的容量。 用户还可以指定使用超额容量或其他变量，无保证的容量。 容量可以用于资源的任何适当的功能方面，例如计算能力，吞吐量，延迟，带宽和存储。 用户可以针对各种类型和超额产能组合提交出价，中标可以至少在一段时间内接受专用的超额容量。

    Committed processing rates for shared resources
    15.
    发明授权
    Committed processing rates for shared resources 有权

    公开(公告)号：US12014218B2

    公开(公告)日：2024-06-18

    申请号：US16530898

    申请日：2019-08-02

    Applicant: Amazon Technologies, Inc.

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

    IPC: G06F9/50

    CPC classification number: G06F9/5044 ,  G06F2209/501

    Abstract: 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.

    COMMITTED PROCESSING RATES FOR SHARED RESOURCES
    16.
    发明申请
    COMMITTED PROCESSING RATES FOR SHARED RESOURCES 审中-公开

    公开(公告)号：US20200034204A1

    公开(公告)日：2020-01-30

    申请号：US16530898

    申请日：2019-08-02

    Applicant: Amazon Technologies, Inc.

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

    IPC: G06F9/50

    Abstract: 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.

    MANAGING COMMITTED PROCESSING RATES FOR SHARED RESOURCES
    17.
    发明申请
    MANAGING COMMITTED PROCESSING RATES FOR SHARED RESOURCES 审中-公开
    管理共享资源的承诺加工费率

    公开(公告)号：US20160261521A1

    公开(公告)日：2016-09-08

    申请号：US15156058

    申请日：2016-05-16

    Applicant: Amazon Technologies, Inc.

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

    IPC: H04L12/911 ,  H04L29/08

    CPC classification number: H04L47/70 ,  G06Q10/00 ,  G06Q30/0284 ,  G06Q30/04 ,  H04L67/02 ,  H04L67/10

    Abstract: Commitments against various resources can be dynamically adjusted for customers in a shared-resource environment. 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), for example, as well as the amount of storage requested. The customer can subsequently adjust the committed rate of IOPS by submitting an appropriate request, or the rate can be adjusted automatically based on any of a number of criteria. Data volumes for the customer can be migrated, split, or combined in order to provide the adjusted rate. The interaction of the customer with the data volume does not need to change, independent of adjustments in rate or changes in the data volume, other than the rate at which requests are processed.

    Abstract translation: 可以在共享资源环境中为客户动态调整针对各种资源的承诺。 客户可以提供具有每秒输入/输出操作（IOPS）的承诺速率的数据卷，并且仅支付该承诺（加上任何超额），以及所请求的存储量。 客户随后可以通过提交适当的请求来调整IOPS的承诺率，或者可以根据多种标准自动调整利率。 可以迁移，拆分或组合客户的数据卷，以提供调整后的费率。 除了处理请求的速率之外，客户与数据量的交互不需要改变，而是独立于速率或数据量变化的调整。

    Virtual data storage service with sparse provisioning
    19.
    发明授权
    Virtual data storage service with sparse provisioning 有权
    具有稀疏配置的虚拟数据存储服务

    公开(公告)号：US09053004B2

    公开(公告)日：2015-06-09

    申请号：US14507752

    申请日：2014-10-06

    Applicant: Amazon Technologies, Inc.

    Inventor： Roland Paterson-Jones ,  Sachin Jain ,  Tate Andrew Certain

    IPC: G06F12/12 ,  G06F12/02

    CPC classification number: G06F3/0608 ,  G06F3/0631 ,  G06F3/0664 ,  G06F3/067 ,  G06F12/0223 ,  G06F12/023 ,  G06F2212/702

    Abstract: Virtual data stores may be sparsely provisioned by virtual data storage services in a manner that controls risk of implementation resource shortages. Relationships between requested data storage space size, data storage server capacity, allocated data storage space size and/or allocated data storage space utilization may be tracked on a per data store, per customer, per data storage server, and/or a per virtual data storage service basis. For each such basis, a set of constraints may be specified to control the relationships. The set of constraints may be enforced during implementation resource allocation, and by migration of data storage space portions to different implementation resources as part of a sparse provisioning load balancing. Sparse provisioning details may be made explicit to virtual data storage service customers to varying degrees including explicit, aggregate on a per customer basis, and aggregate on a per virtual data storage service basis.

    Abstract translation: 虚拟数据存储可以以控制资源短缺的风险的方式由虚拟数据存储服务稀疏地提供。 可以在每个数据存储，每个客户，每个数据存储服务器和/或每个虚拟数据中跟踪所请求的数据存储空间大小，数据存储服务器容量，分配的数据存储空间大小和/或分配的数据存储空间利用率之间的关系 存储服务基础。 对于每个这样的基础，可以指定一组约束来控制关系。 可以在实施资源分配期间强制执行该约束集合，并且通过将数据存储空间部分迁移到不同的实现资源，作为稀疏配置负载平衡的一部分。 稀疏配置细节可以对虚拟数据存储服务客户进行不同程度的显式显示，包括显式的，基于每个客户的聚合，以及基于每个虚拟数据存储服务的聚合。

    DATA SET CAPTURE MANAGEMENT WITH FORECASTING
    20.
    发明申请
    DATA SET CAPTURE MANAGEMENT WITH FORECASTING 审中-公开
    数据集捕获管理与预测

    公开(公告)号：US20150106331A1

    公开(公告)日：2015-04-16

    申请号：US14574264

    申请日：2014-12-17

    Applicant: Amazon Technologies, Inc.

    Inventor： TATE ANDREW CERTAIN ,  Matthew S. Garman ,  Sachin Jain ,  Fiorenzo Cattaneo

    IPC: G06F17/30

    CPC classification number: G06F17/30575 ,  G06F3/0611 ,  G06F11/1451 ,  G06F11/1461 ,  G06F11/1662 ,  G06F11/2094 ,  G06F11/3433 ,  G06F17/30088 ,  G06F17/30221 ,  G06F17/30368

    Abstract: A set of virtualized computing services may include multiple types of virtualized data store differentiated by characteristics such as latency, throughput, durability and cost. A sequence of captures of a data set from one data store to another may be scheduled to achieve a variety of virtualized computing service user and provider goals such as lowering a probability of data loss, lowering costs, and computing resource load leveling. Data set captures may be scheduled according to policies specifying fixed and flexible schedules and conditions including flexible scheduling windows, target capture frequencies, probability of loss targets and/or cost targets. Capture lifetimes may also be managed with capture retention policies, which may specify fixed and flexible lifetimes and conditions including cost targets. Such data set capture policies may be specified with a Web-based administrative interface to a control plane of the virtualized computing services.

    Abstract translation: 一组虚拟化计算服务可以包括通过诸如延迟，吞吐量，耐久性和成本等特征来区分的多种类型的虚拟化数据存储。 可以调度从一个数据存储器到另一个数据存储器的数据集的捕获序列，以实现各种虚拟化计算服务用户和提供者目标，例如降低数据丢失的概率，降低成本和计算资源负载均衡。 可以根据指定固定和灵活的时间表和条件的策略来调度数据集捕获，包括灵活的调度窗口，目标捕获频率，损失目标概率和/或成本目标。 捕获寿命也可以通过捕获保留策略进行管理，这可以指定固定和灵活的生命周期和条件，包括成本目标。 这样的数据集捕获策略可以使用基于Web的管理接口来指定到虚拟化计算服务的控制平面。

Patent Agency Ranking