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

1. 发明授权

US09712453B1 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.

2. 发明授权

US08438247B1 Techniques for capturing data sets 有权
公开(公告)号：US08438247B1
公开(公告)日：2013-05-07
申请号：US12975269
申请日：2010-12-21
申请人： Tate Andrew Certain , Sachin Jain , James R. Hamilton , Fiorenzo Cattaneo , Danny Wei , David N. Sunderland
发明人： Tate Andrew Certain , Sachin Jain , James R. Hamilton , Fiorenzo Cattaneo , Danny Wei , David N. Sunderland
IPC分类号： G06F15/16
CPC分类号： G06F15/167 , G06F9/52 , G06F17/30171 , H04L67/1097
摘要： Techniques, including systems and methods, for capturing data sets include performing a client-side two-phase commit to ensure one or more data consistency conditions. A logical volume may represent a data set that is distributed among a plurality of physical storage devices. One or more client devices are instructed to block at least acknowledgment of write operations. When the one or more client devices have blocked at least acknowledgment of write operations, one or more servers in communication with the physical storage devices are instructed to capture corresponding portions of the data set. When the servers have been instructed to capture corresponding portions of the data set, the client devices are instructed to resume at least acknowledgment of write operations.

3. 发明授权

US08239589B1 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队列中备份超过某个阈值。

4. 发明申请

US20110238546A1 MANAGING COMMITTED PROCESSING RATES FOR SHARED RESOURCES 有权
标题翻译：管理共享资源的承诺加工费率
公开(公告)号：US20110238546A1
公开(公告)日：2011-09-29
申请号：US12749451
申请日：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分类号： G06Q50/00 , G06Q10/00 , G06Q30/00
CPC分类号： H04L47/70 , G06Q10/00 , G06Q30/0284 , G06Q30/04 , H04L67/02 , H04L67/10
摘要： 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.
摘要翻译：可以在共享资源环境中为客户动态调整针对各种资源的承诺。客户可以提供具有每秒输入/输出操作（IOPS）的承诺速率的数据卷，并且仅支付该承诺（加上任何超额），以及所请求的存储量。客户随后可以通过提交适当的请求来调整IOPS的承诺率，或者可以根据多种标准自动调整利率。可以迁移，拆分或组合客户的数据卷，以提供调整后的费率。除了处理请求的速率之外，客户与数据量的交互不需要改变，而是独立于速率或数据量变化的调整。

5. 发明授权

US09342801B2 Managing committed processing rates for shared resources 有权
标题翻译：管理共享资源的承诺处理率
公开(公告)号：US09342801B2
公开(公告)日：2016-05-17
申请号：US12749451
申请日：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 , G06Q10/00 , G06Q30/02 , G06Q30/04
CPC分类号： H04L47/70 , G06Q10/00 , G06Q30/0284 , G06Q30/04 , H04L67/02 , H04L67/10
摘要： 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.
摘要翻译：可以在共享资源环境中为客户动态调整针对各种资源的承诺。客户可以提供具有每秒输入/输出操作（IOPS）的承诺速率的数据卷，并且仅支付该承诺（加上任何超额），以及所请求的存储量。客户随后可以通过提交适当的请求来调整IOPS的承诺率，或者可以根据多种标准自动调整利率。可以迁移，拆分或组合客户的数据卷，以提供调整后的费率。除了处理请求的速率之外，客户与数据量的交互不需要改变，而是独立于速率或数据量变化的调整。

6. 发明申请

US20110238857A1 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的承诺率。如果客户以超过承诺率的速度生成提交资料，则当系统不受压力时，资源仍可以以较高的速率进行处理。即使在压力下，系统至少将提供承诺率。多个客户可以在同一资源上进行配置，多个客户可以在该资源上具有承诺费率。没有承诺或保证费率的客户可以使用未提交的部分或未被使用的承诺部分。

7. 发明授权

US08473646B1 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队列中备份超过某个阈值。

8. 发明授权

US09363102B1 Methods and apparatus for implementing anycast flow stickiness in stateful sessions 有权
标题翻译：在有状态会话中实现任意流量粘性的方法和装置
公开(公告)号：US09363102B1
公开(公告)日：2016-06-07
申请号：US12975292
申请日：2010-12-21
申请人： Eric J. Brandwine , Swaminathan Sivasubramanian , Bradley E. Marshall , Tate Andrew Certain
发明人： Eric J. Brandwine , Swaminathan Sivasubramanian , Bradley E. Marshall , Tate Andrew Certain
IPC分类号： H04L12/54 , H04L12/761 , H04L29/12 , H04L12/46 , H04L12/911 , H04L29/06 , H04L12/723 , H04L12/743
CPC分类号： H04L12/54 , H04L12/4633 , H04L45/16 , H04L45/50 , H04L45/586 , H04L45/7453 , H04L47/825 , H04L61/00 , H04L61/2592 , H04L63/0236 , H04L63/0272
摘要： Methods and apparatus for implementing anycast flow stickiness in stateful sessions are described. For the first packet from a source device to an anycast group, a destination anycast endpoint is selected from the anycast group by a routing process via an algorithm that is specified for the anycast group. A record of the mapping of the source device to the destination anycast endpoint may be stored. Additional packets in the flow are routed to the same anycast endpoint as the first packet according to the stored information. Alternatively, a hashing technique may be used to route packets to an anycast endpoint. The packets may be encapsulated in an encapsulation format that includes network substrate routing information to the destination anycast endpoint; anycast forwarding decisions are made at the overlay network level and not at the network substrate level, and thus flow stickiness can be maintained.
摘要翻译：描述在状态会话中实现任意流粘性的方法和装置。对于从源设备到任播组的第一个数据包，通过路由进程通过为任播组指定的算法从任播组中选择目标任播端点。可以存储源设备到目的地任播端点的映射的记录。根据存储的信息，流中的附加分组被路由到与第一分组相同的任播端点。或者，散列技术可以用于将分组路由到任播端点。分组可以以包括到目的地任播终端的网络基板路由信息的封装格式被封装; 任播转发决定是在覆盖网络级而不是在网络底层级进行的，从而可以保持流粘性。

9. 发明授权

US09152505B1 Verified hardware-based erasure of data on distributed systems 有权
标题翻译：经过验证的基于硬件的擦除分布式系统上的数据
公开(公告)号：US09152505B1
公开(公告)日：2015-10-06
申请号：US13434580
申请日：2012-03-29
申请人： Marc J. Brooker , David R. Richardson , Madhuvanesh Parthasarathy , Tate Andrew Certain
发明人： Marc J. Brooker , David R. Richardson , Madhuvanesh Parthasarathy , Tate Andrew Certain
IPC分类号： H04L9/32 , G06F11/14
CPC分类号： G06F11/1456 , G06F17/30477 , G06F17/30557 , G06F17/30979 , G06F21/6218 , G06F2221/2143
摘要： Systems, methods and related processes for securely erasing and/or rendering permanently inaccessible data stored on storage systems securely erased is described. Such storage systems may, in some aspects, integrate hardware capable of secure erasure. In some aspects, a cryptographically-based system is utilized.
摘要翻译：描述了用于安全地擦除和/或渲染存储在存储系统上的永久不可访问的数据的系统，方法和相关过程被安全地擦除。在某些方面，这样的存储系统可以集成能够进行安全擦除的硬件。在一些方面，利用基于密码学的系统。

10. 发明授权

US08856483B1 Virtual data storage service with sparse provisioning 有权
标题翻译：具有稀疏配置的虚拟数据存储服务
公开(公告)号：US08856483B1
公开(公告)日：2014-10-07
申请号：US12886738
申请日：2010-09-21
申请人： Roland Paterson-Jones , Sachin Jain , Tate Andrew Certain
发明人： Roland Paterson-Jones , Sachin Jain , Tate Andrew Certain
IPC分类号： G06F12/14
CPC分类号： G06F3/0608 , G06F3/0631 , G06F3/0664 , G06F3/067 , G06F12/0223 , G06F12/023 , G06F2212/702
摘要： 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.
摘要翻译：虚拟数据存储可以以控制资源短缺的风险的方式由虚拟数据存储服务稀疏地提供。可以在每个数据存储，每个客户，每个数据存储服务器和/或每个虚拟数据中跟踪所请求的数据存储空间大小，数据存储服务器容量，分配的数据存储空间大小和/或分配的数据存储空间利用率之间的关系存储服务基础。对于每个这样的基础，可以指定一组约束来控制关系。可以在实施资源分配期间强制执行该约束集合，并且通过将数据存储空间部分迁移到不同的实现资源，作为稀疏配置负载平衡的一部分。稀疏配置细节可以对虚拟数据存储服务客户进行不同程度的显示，包括显式的，每个客户的聚合，以及基于每个虚拟数据存储服务的聚合。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式