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

1. 发明申请

WO2004088547A3 QUALITY OF SERVICE CONTROLLER AND METHOD FOR A DATA STORAGE SYSTEM 审中-公开
标题翻译：服务质量控制器和数据存储系统的方法
公开(公告)号：WO2004088547A3
公开(公告)日：2005-01-13
申请号：PCT/US2004009119
申请日：2004-03-25
申请人： HEWLETT PACKARD DEVELOPMENT CO , MERCHANT ARIF , LUMB CHRISTOPHER , GUILLERMO ALVAREZ
发明人： MERCHANT ARIF , LUMB CHRISTOPHER , GUILLERMO ALVAREZ
IPC分类号： G06F9/46 , G06F9/48 , G06F17/30
CPC分类号： G06F9/4887
摘要： A quality-of-service controller (104) and related method for a data storage system. Requests for each of a plurality of storage system workloads are prioritized. The requests are selectively forwarded to a storage device queue (118) according to their priorities so as to maintain the device queue (118) at a target queue depth. The target queue depth is adjusted response to a latency value for the requests wherein the latency value is computed based on a difference between an arrival time and a completion time of the requests for each workload. Prioritizing the requests may be accomplished by computing a target deadline for a request based on a monitored arrival time of the request and a target latency for its workload. To reduce latencies, the target queue depth may be reduced when the target latency for a workload is less than its computed latency value. To increase throughput, the target queue depth may be increased when the target latency for each workload is greater than each computed latency value
摘要翻译：一种用于数据存储系统的服务质量控制器（104）和相关方法。优先考虑多个存储系统工作负载中的每一个的请求。所述请求根据其优先级选择性地转发到存储设备队列（118），以便将设备队列（118）维持在目标队列深度。根据对每个工作负载的请求的到达时间和完成时间之间的差值来计算等待时间值，从而对目标队列深度进行调整响应。可以通过基于所请求的监视到达时间和其工作负载的目标延迟来计算请求的目标截止时间来实现优先级请求。为了减少延迟，当工作负载的目标延迟小于其计算的延迟值时，可能会减少目标队列深度。为了增加吞吐量，当每个工作负载的目标延迟大于每个计算的等待时间值时，可能会增加目标队列深度

2. 发明申请

WO2005043530A2 METHOD OF RECOVERING DATA 审中-公开
标题翻译：恢复数据的方法
公开(公告)号：WO2005043530A2
公开(公告)日：2005-05-12
申请号：PCT/US2004035027
申请日：2004-10-22
申请人： HEWLETT PACKARD DEVELOPMENT CO , FROLUND SVEND , MERCHANT ARIF , SAITO YASUSHI , SPENCE SUSAN , VEITCH ALISTAIR
发明人： FROLUND SVEND , MERCHANT ARIF , SAITO YASUSHI , SPENCE SUSAN , VEITCH ALISTAIR
IPC分类号： G06F11/00 , G06F11/10 , G11B20/00
CPC分类号： G06F11/1076 , G06F2211/104
摘要： A method of recovering a stripe of erasure coded data begins with sending query messages to storage devices (102). The method continues with receiving query reply messages from at least a first quorum of the storage devices (102). The query reply messages include a minimum number of the stripe blocks needed to decode the stripe. Following this, the stripe of erasure coded data is encoded. Next, a write message is sent to each of the storage devices (102), which include a timestamp and the stripe block destined for the storage device (102). The method concludes with receiving a write reply message from at least a second quorum of the storage devices (102) indicating that the stripe block was successfully stored. The first and second quorums each meet a quorum condition of a number such that any two selections of the number of the stripe blocks intersect in the minimum number of the stripe blocks.
摘要翻译：一种恢复擦除编码数据的条带的方法是从向存储设备（102）发送查询消息开始的。该方法继续从存储设备（102）的至少第一法定数量接收查询答复消息。查询回复消息包括对条带进行解码所需的最小条带数。之后，编码擦除编码数据的条带。接下来，将写消息发送到每个存储设备（102），其中包括时间戳和去往存储设备（102）的条带块。该方法结束于从存储设备（102）的至少第二法定数字接收到指示条带块被成功存储的写回复消息。第一和第二仲裁每个满足数量的法定条件，使得条纹块的数量的任何两个选择在最小数量的条带块中相交。

3. 发明申请

WO2004104817A3 SHARING METHOD AND APPARATUS USING DIRECTED GRAPHS 审中-公开
标题翻译：共享方法和使用方向图的设备
公开(公告)号：WO2004104817A3
公开(公告)日：2005-06-30
申请号：PCT/US2004014694
申请日：2004-05-11
申请人： HEWLETT PACKARD DEVELOPMENT CO , MERCHANT ARIF , KALLAHALLA MAHESH , SWAMINATHAN RAM
发明人： MERCHANT ARIF , KALLAHALLA MAHESH , SWAMINATHAN RAM
IPC分类号： G06F3/06
CPC分类号： G06F3/0608 , G06F3/061 , G06F3/0629 , G06F3/0665 , G06F3/0683 , Y10S707/99953 , Y10S707/99956
摘要： A method and apparatus is used to divide a storage volume into shards (202-210). The division is made using a directed graph having a vertex for each block in the storage volume and directed-edges between pairs of vertices representing a shard of blocks (304), associating a weight with each directed edge that represents the dissimilarity for the shard of blocks between the corresponding pair of vertices (306), selecting a maximum number of shards (K) for dividing the storage volume (402), identifying a minimum aggregate weight associated with a current vertex for a combination of no more than K shards (512-514), performing the identification of the minimum aggregate weight for vertices in the directed graph (406), and picking the smallest aggregated weight associated with the last vertex to determine a sharding that spans the storage volume and provides a minimal dissimilarity among no more than K shards of blocks (408).
摘要翻译：使用方法和装置将存储卷分成碎片（202-210）。使用针对存储卷中的每个块具有顶点的有向图和代表块的块（304）的顶点对之间的定向边来进行划分，该权重将权重与代表该碎片的相似性的每个有向边相关联在对应的一对顶点（306）之间的块，选择用于划分存储卷（402）的最大碎片数（K），识别与不超过K个碎片的组合的当前顶点相关联的最小聚集权重（512 -514），执行有向图（406）中顶点的最小聚合权重的识别，以及选择与最后一个顶点相关联的最小聚合权重，以确定跨越存储卷的分片，并且在不再有更多的信息之间提供最小的不相似性比块的块（408）。

4. 发明申请

WO2004104839A3 REDUNDANT DATA ASSIGMENT IN A DATA STORAGE SYSTEM 审中-公开
标题翻译：数据存储系统中的冗余数据组合
公开(公告)号：WO2004104839A3
公开(公告)日：2008-07-03
申请号：PCT/US2004015352
申请日：2004-05-13
申请人： HEWLETT PACKARD DEVELOPMENT CO , MERCHANT ARIF , FROLUND SVEND , SAITO YASUSHI , SPENCE SUSAN , VEITCH ALISTAIR
发明人： MERCHANT ARIF , FROLUND SVEND , SAITO YASUSHI , SPENCE SUSAN , VEITCH ALISTAIR
IPC分类号： G06F17/30 , G06F3/06 , G06F12/00 , H04L1/22
CPC分类号： G06F3/0605 , G06F3/0607 , G06F3/0631 , G06F3/0635 , G06F3/0647 , G06F3/067 , G06F11/2087 , G06F2206/1012
摘要： The present invention provides techniques for assignment and layout of redundant data in data storage system. In one aspect, the data storage system (100) stores a number M of replicas of the data. Nodes (102) that have sufficient resources available to accommodate a requirement of data to be assigned to the system (100) are identified. When the number of nodes (102) is greater than M, the data is assigned to M randomly selected nodes (102) from among those identified. The data to be assigned may include a group of data segments and when the number of nodes (102) is less than M, the group is divided to form a group of data segments having a reduced requirement. Nodes (102) are then identified that have sufficient resources available to accommodate the reduced requirement. In other aspects, techniques are providing for adding a new storage device node (102) to a data storage system (100) having a plurality of existing storage device nodes (102) and for removing data from a storage device node (102) in such a data storage system.
摘要翻译：本发明提供了用于在数据存储系统中分配和布置冗余数据的技术。在一个方面，数据存储系统（100）存储数据M的副本。识别具有足够资源以适应要分配给系统（100）的数据的节点（102）。当节点（102）的数量大于M时，将数据从被识别的数据分配给M个随机选择的节点（102）。要分配的数据可以包括一组数据段，并且当节点（102）的数量小于M时，该组被划分以形成具有减少的需求的一组数据段。然后识别节点（102），其具有足够的可用资源以适应减少的需求。在其他方面，技术提供了将新的存储设备节点（102）添加到具有多个现有存储设备节点（102）的数据存储系统（100），并且用于从存储设备节点（102）中去除数据数据存储系统。

5. 发明申请

WO2005041045A3 METHODS OF READING AND WRITING DATA 审中-公开
标题翻译：阅读和写作数据的方法
公开(公告)号：WO2005041045A3
公开(公告)日：2006-12-21
申请号：PCT/US2004035257
申请日：2004-10-22
申请人： HEWLETT PACKARD DEVELOPMENT CO , FROLUND SVEND , MERCHANT ARIF , SAITO YASUSHI , SPENCE SUSAN , VEITCH ALISTAIR C
发明人： FROLUND SVEND , MERCHANT ARIF , SAITO YASUSHI , SPENCE SUSAN , VEITCH ALISTAIR C
IPC分类号： G06F3/06 , G06F11/10 , G06F12/00
CPC分类号： G06F11/1076 , G06F11/1088 , G06F2211/1028 , G06F2211/104
摘要： A method of reading data comprises sending read messages to storage devices (102) holding the stripe and receiving at least a quorum of reply messages. The reply message from the storage device (102) holding the data block includes the data block. The quorum meets a quorum condition of a number such that any two selections of the number of stripe blocks intersect in the minimum number of the stripe blocks needed to decode the stripe. A method of writing data comprises sending query messages to storage devices (102) holding the stripe, receiving a query reply message from each of at least a first quorum of the storage devices (102), sending modify messages to the storage devices (102), and receiving a write reply message from each of at least a second quorum of the storage devices (102). The first and second quorums each meet the quorum condition.
摘要翻译：读取数据的方法包括将读取的消息发送到保存条带的存储设备（102）并且接收至少一定数量的回复消息。保存数据块的存储装置（102）的回复消息包括数据块。法定人数满足数量的法定条件，使得条形块数量的任意两个选择在解码条纹所需的最小数量的条块中相交。一种写入数据的方法包括向保存条带的存储设备（102）发送查询消息，从存储设备（102）的至少第一法定数量的每一个接收询问应答消息，向存储设备（102）发送修改消息，，并且从所述存储设备（102）的至少第二法定数量中的每一个接收写入回复消息。第一和第二法定人数均符合法定人数。

6. 发明申请

WO2005043531A3 METHODS OF READING AND WRITING DATA 审中-公开
标题翻译：阅读和写作数据的方法
公开(公告)号：WO2005043531A3
公开(公告)日：2006-11-30
申请号：PCT/US2004035038
申请日：2004-10-22
申请人： HEWLETT PACKARD DEVELOPMENT CO , FROLUND SVEND , MERCHANT ARIF , SAITO YASUSHI , SPENCE SUSAN , VEITCH ALISTAIR C
发明人： FROLUND SVEND , MERCHANT ARIF , SAITO YASUSHI , SPENCE SUSAN , VEITCH ALISTAIR C
IPC分类号： G06F3/06 , G06F12/16 , G11B20/00
CPC分类号： G06F11/1008 , G06F11/1662 , G06F11/2056 , G06F11/2094 , H04L67/1097 , H04L69/40
摘要： A method of reading data comprises receiving a request for a stripe of erasure coded data, sending read messages to at least a quorum of storage devices (102), and receiving at least the quorum of reply messages from the devices (102). The quorum of the reply messages includes at least a minimum number of stripe blocks needed to decode the data. The quorum meets a quorum condition of a number such that. any two selections of the number of the stripe blocks intersect in the minimum number of the stripe blocks. A method of writing data comprises generating a timestamp, encoding the data, sending query messages including the timestamp to the storage devices (102), receiving query reply messages from each of at least the quorum of the devices (102), sending write messages to the devices (102), and receiving a write reply message from each of at least the quorum of the devices (102).
摘要翻译：一种读取数据的方法包括接收对擦除编码数据的条带的请求，向至少一个存储设备（102）发送读消息，以及至少从设备（102）接收答复消息的数量。答复消息的法定人数包括解码数据所需的至少数量的条带数据块。法定人数符合数量的法定人数。条纹块的数量的任何两个选择在最小数量的条带块中相交。一种写入数据的方法包括生成时间戳，对数据进行编码，向存储设备（102）发送包括时间戳的查询消息，从设备（102）的至少法定人数中的每一个接收查询回复消息，发送写入消息到设备（102），并且从设备（102）的至少法定人数中的每一个接收写入回复消息。

7. 发明申请

WO2004104866A3 READ, WRITE, AND RECOVERY OPERATIONS FOR REPLICATED DATA 审中-公开
标题翻译：读取，写入和恢复操作用于替换数据
公开(公告)号：WO2004104866A3
公开(公告)日：2005-10-06
申请号：PCT/US2004015191
申请日：2004-05-13
申请人： HEWLETT PACKARD COMPANY L L P , FROLUND SVEND , MERCHANT ARIF , SAITO YASUSHI , SPENCE SUSAN , VEITCH ALISTAIR
发明人： FROLUND SVEND , MERCHANT ARIF , SAITO YASUSHI , SPENCE SUSAN , VEITCH ALISTAIR
IPC分类号： G06F11/00 , G06F11/18 , G06F17/30
CPC分类号： G06F11/182 , G06F11/1662 , G06F2201/835
摘要： Read, write and recovery operations for replicated data are provided. In one aspect, a system for redundant storage of data included a plurality of storage devices (102) and a communication medium (104) for interconnecting the storage devices (102). At least two of the storage devices (102) are designated devices (102) for storing a block of data. Each designated device (102) has a version of the data and a first timestamp that is indicative of when the version of data was last updated and a second timestamp that is indicative of any pending update to the block of data. The read, write and recovery operations are performed to the data using the first and second timestamps to coordinate the operations among the designated devices (102).
摘要翻译：提供了复制数据的读取，写入和恢复操作。在一个方面，用于数据冗余存储的系统包括用于互连存储设备（102）的多个存储设备（102）和通信介质（104）。至少两个存储设备（102）是用于存储数据块的指定设备（102）。每个指定设备（102）具有数据的版本和指示何时上次更新数据的版本的时间戳和指示对数据块的任何未完成更新的第二时间戳。使用第一和第二时间戳对数据执行读取，写入和恢复操作，以协调指定设备（102）之间的操作。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式