会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • Redundant data assigment in a data storage system
    • 数据存储系统中的冗余数据分配
    • US20080046779A1
    • 2008-02-21
    • US11827973
    • 2007-07-13
    • Arif MerchantSvend FrolundYasusuhi SaitoSusan SpenceAlistair Veitch
    • Arif MerchantSvend FrolundYasusuhi SaitoSusan SpenceAlistair Veitch
    • H04L1/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 stores a number M of replicas of the data. Nodes that have sufficient resources available to accommodate a requirement of data to be assigned to the system are identified. When the number of nodes is greater than M, the data is assigned to M randomly selected nodes from among those identified. The data to be assigned may include a group of data segments and when the number of nodes is less than M, the group is divided to form a group of data segments having a reduced requirement. Nodes 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 to a data storage system having a plurality of existing storage device nodes and for removing data from a storage device node in such a data storage system.
    • 本发明提供了用于在数据存储系统中分配和布置冗余数据的技术。 在一个方面,数据存储系统存储数字M的数据副本。 确定具有足够资源以适应要分配给系统的数据的节点。 当节点数大于M时,数据被分配给所识别的M个随机选择的节点。 要分配的数据可以包括一组数据段,并且当节点数小于M时,该组被划分以形成具有减少的需求的一组数据段。 然后识别具有足够资源以适应减少的需求的节点。 在其他方面,技术提供了向具有多个现有存储设备节点的数据存储系统添加新的存储设备节点并且用于从这样的数据存储系统中的存储设备节点移除数据。
    • 7. 发明授权
    • System for redundant storage of data
    • 数据冗余存储系统
    • US07152077B2
    • 2006-12-19
    • US10440531
    • 2003-05-16
    • Alistair VeitchSvend FrolundArif MerchantSusan SpenceYasusuhi Saito
    • Alistair VeitchSvend FrolundArif MerchantSusan SpenceYasusuhi Saito
    • G06F17/30
    • G06F11/2094G06F11/1076G06F11/1662Y10S707/99953Y10S707/99954
    • Data structure and timestamp management techniques for redundant storage. A plurality of storage devices are interconnected by a communication medium. At least two of the storage devices are designated devices for storing a block of data. Each designated device stores a version of the data and a first timestamp that is indicative of when the version of data was last updated. A second timestamp is indicative of a pending update to the block of data. When the update to the block of data is completed at one of the designated devices, the device discards the second timestamp. A storage device acting as coordinator instructs the device to discard the second timestamp. The designated storage devices store a plurality of blocks of data and corresponding timestamps according to a data structure. At least some of the entries in the data structure correspond to a range of data blocks that share a common timestamp. Entries in the data structure are arranged such that the ranges do not overlap.
    • 冗余存储的数据结构和时间戳管理技术。 多个存储设备通过通信介质互连。 至少两个存储设备是用于存储数据块的指定设备。 每个指定的设备存储数据的版本和指示何时上次更新数据的版本的第一时间戳。 第二时间戳指示对数据块的待定更新。 当数据块的更新在指定的设备之一完成时,设备丢弃第二个时间戳。 充当协调器的存储设备指示设备丢弃第二个时间戳。 指定的存储装置根据数据结构存储多个数据块和对应的时间戳。 数据结构中的至少一些条目对应于共享公共时间戳的数据块的范围。 数据结构中的条目被布置成使得范围不重叠。
    • 10. 发明申请
    • Methods of reading and writing data
    • 数据读写方法
    • US20050091450A1
    • 2005-04-28
    • US10693573
    • 2003-10-23
    • Svend FrolundArif MerchantYasusuhi SaitoSusan SpenceAlistar Veitch
    • Svend FrolundArif MerchantYasusuhi SaitoSusan SpenceAlistar Veitch
    • G06F11/10G06F12/00
    • G06F11/1076G06F11/1088G06F2211/1028G06F2211/104
    • A method of reading data comprises sending read messages to storage devices holding the stripe and receiving at least a quorum of reply messages. The reply message from the storage device 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 holding the stripe, receiving a query reply message from each of at least a first quorum of the storage devices, sending modify messages to the storage devices, and receiving a write reply message from each of at least a second quorum of the storage devices. The first and second quorums each meet the quorum condition.
    • 读取数据的方法包括将读取的消息发送到保存条带的存储设备,并且接收至少一定数量的回复消息。 保存数据块的存储装置的应答消息包括数据块。 法定人数满足数量的法定条件,使得条形块数量的任意两个选择在解码条纹所需的最小数量的条块中相交。 一种写入数据的方法包括向存储条带的存储设备发送查询消息,从存储设备的至少第一法定数量的每一个接收查询应答消息,向存储设备发送修改消息,以及从每个存储设备接收写回复消息 的至少第二法定的存储设备。 第一和第二法定人数均符合法定人数。