会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • REDUNDANT DATA STORAGE RECONFIGURATION
    • 冗余数据存储重新配置
    • WO2006042107A3
    • 2006-12-28
    • PCT/US2005036134
    • 2005-10-05
    • HEWLETT PACKARD DEVELOPMENT COSAITO YASUSHIFROLUND SVEND
    • SAITO YASUSHIFROLUND SVEND
    • G06F3/06
    • G06F11/1076G06F2211/1004
    • In one embodiment, a method of reconfiguring a redundant data storage system (100) is provided. A plurality of data segments are redundantly stored by a first group of storage devices (102), at least a quorum of storage devices (102) of the first group each storing at least a portion of each data segment or redundant data. A second group of storage devices (102) is formed, the second group having different membership from the first group. A data segment is identified among the plurality for which a consistent version is not stored by at least a quorum of the second group. At least a portion of the indentified data segment or redundant data is written to at least one of the storage devices of the second group thereby at least a quorum of the second group stories a consistent version of the indentified data segment.
    • 在一个实施例中,提供了一种重新配置冗余数据存储系统(100)的方法。 多个数据段由第一组存储设备(102)冗余存储,第一组的至少一个存储设备(102)的法定数量存储每个数据段或冗余数据的至少一部分。 形成第二组存储设备(102),第二组具有与第一组不同的成员资格。 数据段在多个数据中被识别,其中一致版本不被至少法定数量的第二组存储。 识别出的数据段或冗余数据的至少一部分被写入第二组的至少一个存储设备,从而至少第二组的至少一个法定数量故事识别出的数据段的一致版本。
    • 2. 发明申请
    • METHOD OF RECOVERING DATA
    • 恢复数据的方法
    • WO2005043530A2
    • 2005-05-12
    • PCT/US2004035027
    • 2004-10-22
    • HEWLETT PACKARD DEVELOPMENT COFROLUND SVENDMERCHANT ARIFSAITO YASUSHISPENCE SUSANVEITCH ALISTAIR
    • FROLUND SVENDMERCHANT ARIFSAITO YASUSHISPENCE SUSANVEITCH ALISTAIR
    • G06F11/00G06F11/10G11B20/00
    • G06F11/1076G06F2211/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. 发明申请
    • REDUNDANT DATA ASSIGMENT IN A DATA STORAGE SYSTEM
    • 数据存储系统中的冗余数据组合
    • WO2004104839A3
    • 2008-07-03
    • PCT/US2004015352
    • 2004-05-13
    • HEWLETT PACKARD DEVELOPMENT COMERCHANT ARIFFROLUND SVENDSAITO YASUSHISPENCE SUSANVEITCH ALISTAIR
    • MERCHANT ARIFFROLUND SVENDSAITO YASUSHISPENCE SUSANVEITCH ALISTAIR
    • G06F17/30G06F3/06G06F12/00H04L1/22
    • G06F3/0605G06F3/0607G06F3/0631G06F3/0635G06F3/0647G06F3/067G06F11/2087G06F2206/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)中去除数据 数据存储系统。