会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Virtual data storage service with sparse provisioning
    • 具有稀疏配置的虚拟数据存储服务
    • US08856483B1
    • 2014-10-07
    • US12886738
    • 2010-09-21
    • Roland Paterson-JonesSachin JainTate Andrew Certain
    • Roland Paterson-JonesSachin JainTate Andrew Certain
    • G06F12/14
    • G06F3/0608G06F3/0631G06F3/0664G06F3/067G06F12/0223G06F12/023G06F2212/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.
    • 虚拟数据存储可以以控制资源短缺的风险的方式由虚拟数据存储服务稀疏地提供。 可以在每个数据存储,每个客户,每个数据存储服务器和/或每个虚拟数据中跟踪所请求的数据存储空间大小,数据存储服务器容量,分配的数据存储空间大小和/或分配的数据存储空间利用率之间的关系 存储服务基础。 对于每个这样的基础,可以指定一组约束来控制关系。 可以在实施资源分配期间强制执行该约束集合,并且通过将数据存储空间部分迁移到不同的实现资源,作为稀疏配置负载平衡的一部分。 稀疏配置细节可以对虚拟数据存储服务客户进行不同程度的显示,包括显式的,每个客户的聚合,以及基于每个虚拟数据存储服务的聚合。
    • 6. 发明授权
    • Providing executing programs with reliable access to non-local block data storage
    • 提供可靠访问非本地块数据存储的执行程序
    • US08769186B2
    • 2014-07-01
    • US13218239
    • 2011-08-25
    • Matthew S. GarmanTate Andrew CertainRoland Paterson-JonesPeter N. DeSantisAtle Normann Jorgensen
    • Matthew S. GarmanTate Andrew CertainRoland Paterson-JonesPeter N. DeSantisAtle Normann Jorgensen
    • G06F13/00
    • G06F11/1448G06F9/5016
    • Techniques are described for managing access of executing programs to non-local block data storage. In some situations, a block data storage service uses multiple server storage systems to reliably store block data that may be accessed over one or more networks by programs executing on other physical computing systems. Users may create block data storage volumes that are each stored by at least two of the server block data storage systems, and may initiate use of such volumes by one or more executing programs, such as in a reliable manner by enabling an automatic switch to a second volume copy if a first volume copy becomes unavailable. A group of multiple server block data storage systems that store block data volumes may in some situations be co-located at a data center, and programs that use volumes stored there may execute on other physical computing systems at that data center.
    • 描述了用于管理执行程序对非本地块数据存储的访问的技术。 在某些情况下,块数据存储服务使用多个服务器存储系统来可靠地存储可以通过在其他物理计算系统上执行的程序在一个或多个网络上访问的块数据。 用户可以创建每个由至少两个服务器块数据存储系统存储的块数据存储卷,并且可以通过一个或多个执行程序来启动这样的卷的使用,诸如以可靠的方式通过使能自动切换到 第一个卷副本变得不可用的第二卷复制。 存储块数据卷的一组多个服务器块数据存储系统可能在某些情况下可以位于数据中心,并且使用存储在其中的卷的程序可以在该数据中心的其他物理计算系统上执行。
    • 8. 发明授权
    • Providing executing programs with reliable access to non-local block data storage
    • 提供可靠访问非本地块数据存储的执行程序
    • US08015343B2
    • 2011-09-06
    • US12188943
    • 2008-08-08
    • Matthew S. GarmanTate Andrew CertainRoland Paterson-JonesPeter N. DeSantisAtle Normann Jorgensen
    • Matthew S. GarmanTate Andrew CertainRoland Paterson-JonesPeter N. DeSantisAtle Normann Jorgensen
    • G06F13/00
    • G06F11/1448G06F9/5016
    • Techniques are described for managing access of executing programs to non-local block data storage. In some situations, a block data storage service uses multiple server storage systems to reliably store block data that may be accessed over one or more networks by programs executing on other physical computing systems. Users may create block data storage volumes that are each stored by at least two of the server block data storage systems, and may initiate use of such volumes by one or more executing programs, such as in a reliable manner by enabling an automatic switch to a second volume copy if a first volume copy becomes unavailable. A group of multiple server block data storage systems that store block data volumes may in some situations be co-located at a data center, and programs that use volumes stored there may execute on other physical computing systems at that data center.
    • 描述了用于管理执行程序对非本地块数据存储的访问的技术。 在某些情况下,块数据存储服务使用多个服务器存储系统来可靠地存储可以通过在其他物理计算系统上执行的程序在一个或多个网络上访问的块数据。 用户可以创建每个由至少两个服务器块数据存储系统存储的块数据存储卷,并且可以通过一个或多个执行程序来启动这样的卷的使用,诸如以可靠的方式通过使能自动切换到 第一个卷副本变得不可用的第二卷复制。 存储块数据卷的一组多个服务器块数据存储系统可能在某些情况下可以位于数据中心,并且使用存储在其中的卷的程序可以在该数据中心的其他物理计算系统上执行。
    • 9. 发明授权
    • Balancing latency and throughput for shared resources
    • 平衡共享资源的延迟和吞吐量
    • US08473646B1
    • 2013-06-25
    • US13530050
    • 2012-06-21
    • Tate Andrew CertainRoland Paterson-JonesJames R. Hamilton
    • Tate Andrew CertainRoland Paterson-JonesJames R. Hamilton
    • G06F3/00G06F5/00G06F13/00G06F13/28
    • G06F13/1626G06F3/0611G06F3/0659G06F3/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队列中备份超过某个阈值 。