公开(公告)号：US07467329B1

公开(公告)日：2008-12-16

申请号：US11166851

申请日：2005-06-23

Applicant: Kimberly K. Keeton ,  Arif Merchant

Inventor： Kimberly K. Keeton ,  Arif Merchant

IPC: G06F11/00

CPC classification number: G06F11/008 ,  G06F11/1446

Abstract: An embodiment of a method of estimating storage system reliability begins with a first step of modeling a storage system design in operation under a workload to determine location of retrieval points. The retrieval points provide sources for primary storage recovery for a plurality of failure scenarios. The method continues with a second step of finding a most recent retrieval point relative to a target recovery time that is available for recovery for a particular failure scenario. In a third step, a difference between the target recovery time and a retrieval point creation time for the most recent retrieval point is determined. The difference indicates a data loss time period.

Abstract translation: 估计存储系统可靠性的方法的实施例从在工作负载下操作的存储系统设计建模的第一步骤开始，以确定检索点的位置。 检索点为多个故障场景的主存储恢复提供源。 该方法继续第二步，找到相对于可用于特定故障场景的恢复的目标恢复时间的最新检索点。 在第三步骤中，确定目标恢复时间与最近检索点的检索点创建时间之间的差异。 差值表示数据丢失时间段。

公开(公告)号：US20080126279A1

公开(公告)日：2008-05-29

申请号：US11508102

申请日：2006-08-22

Applicant: Kimberly Keeton ,  Dirk Beyer ,  Ernesto Brau ,  Arif Merchant ,  Cipriano Santos ,  Alex Zhang

Inventor： Kimberly Keeton ,  Dirk Beyer ,  Ernesto Brau ,  Arif Merchant ,  Cipriano Santos ,  Alex Zhang

IPC: G06G7/04

CPC classification number: G06F11/2069 ,  G06F11/1469 ,  G06F11/2082

Abstract: Provided is a method for determining a recovery schedule. The method includes accepting as input a recovery graph. The recovery graph presents one or more strategies for data recovery. In addition, at least one objective is provided and accepted. The recovery graph is formalized as an optimization problem for the provided objective. When formalized as an optimization problem, at least one solution technique is applied to determine at least one recovery schedule.

公开(公告)号：US20080046779A1

公开(公告)日：2008-02-21

申请号：US11827973

申请日：2007-07-13

Applicant: Arif Merchant ,  Svend Frolund ,  Yasusuhi Saito ,  Susan Spence ,  Alistair Veitch

Inventor： Arif Merchant ,  Svend Frolund ,  Yasusuhi Saito ,  Susan Spence ,  Alistair Veitch

IPC: H04L1/22

CPC classification number: G06F3/0605 ,  G06F3/0607 ,  G06F3/0631 ,  G06F3/0635 ,  G06F3/0647 ,  G06F3/067 ,  G06F11/2087 ,  G06F2206/1012

Abstract: 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.

Abstract translation: 本发明提供了用于在数据存储系统中分配和布置冗余数据的技术。 在一个方面，数据存储系统存储数字M的数据副本。 确定具有足够资源以适应要分配给系统的数据的节点。 当节点数大于M时，数据被分配给所识别的M个随机选择的节点。 要分配的数据可以包括一组数据段，并且当节点数小于M时，该组被划分以形成具有减少的需求的一组数据段。 然后识别具有足够资源以适应减少的需求的节点。 在其他方面，技术提供了向具有多个现有存储设备节点的数据存储系统添加新的存储设备节点并且用于从这样的数据存储系统中的存储设备节点移除数据。

公开(公告)号：US20070192542A1

公开(公告)日：2007-08-16

申请号：US11357815

申请日：2006-02-16

Applicant: Svend Frolund ,  Arif Merchant ,  Alistair Veitch ,  James Reuter ,  James Jackson

Inventor： Svend Frolund ,  Arif Merchant ,  Alistair Veitch ,  James Reuter ,  James Jackson

IPC: G06F12/00 ,  G06F13/28

CPC classification number: G06F12/0866 ,  G06F11/1064 ,  G06F11/1666 ,  G06F11/182 ,  G06F12/0804 ,  G06F12/0813

Abstract: An embodiment of a method of operating a distributed storage system includes reading m data blocks from a distributed cache. The distributed cache comprises memory of a plurality of independent computing devices that include redundancy for the m data blocks. The m data blocks and p parity blocks are stored across m plus p independent computing devices. Each of the m plus p independent computing devices stores a single block selected from the m data blocks and the p parity blocks.

Abstract translation: 操作分布式存储系统的方法的实施例包括从分布式高速缓存读取m个数据块。 分布式高速缓存包括包含m个数据块的冗余的多个独立计算设备的存储器。 m个数据块和p个奇偶校验块存储在m + p个独立计算设备上。 m + p个独立计算装置中的每一个存储从m个数据块和p个奇偶校验块中选择的单个块。

公开(公告)号：US07228381B2

公开(公告)日：2007-06-05

申请号：US10980649

申请日：2004-11-02

Applicant: Mustafa Uysal ,  Arif Merchant ,  Guillermo Alvarez

Inventor： Mustafa Uysal ,  Arif Merchant ,  Guillermo Alvarez

IPC: G06F12/02

CPC classification number: G06F11/2056 ,  G06F3/0601 ,  G06F2003/0692 ,  Y10S707/99953 ,  Y10S707/99955

Abstract: A computer storage system includes a controller and a storage device array. The storage device array may include a first sub-array and a fast storage device sub-array. The first sub-array includes one or more first storage devices storing data. The fast storage device sub-array includes one or more fast storage devices storing a copy of the data stored in the first sub-array.

Abstract translation: 计算机存储系统包括控制器和存储设备阵列。 存储设备阵列可以包括第一子阵列和快速存储设备子阵列。 第一子阵列包括存储数据的一个或多个第一存储设备。 快速存储设备子阵列包括存储存储在第一子阵列中的数据的副本的一个或多个快速存储设备。

公开(公告)号：US20060174067A1

公开(公告)日：2006-08-03

申请号：US11051433

申请日：2005-02-03

Applicant: Craig Soules ,  Arif Merchant

Inventor： Craig Soules ,  Arif Merchant

IPC: G06F13/28

CPC classification number: G06F12/0804

Abstract: An embodiment of a method of caching data writes data units into a write cache for eventual flushing to storage. The method sets a copy-to-read-cache flag for each particular data unit that is read from the write cache. Upon flushing each data unit to the storage, the method copies the data unit to a read cache if the flag for the data unit is set. Another embodiment of a method of caching data writes data units into a write cache. The method simulates a transfer policy for copying the data units from the write cache to a read cache to determine a performance indicator for the transfer policy. Upon flushing each data unit, the method copies the data unit to the read cache if the performance indicator exceeds a threshold and the transfer policy includes copying the data unit into the read cache.

Abstract translation: 缓存数据的方法的一个实施例将数据单元写入写缓存以最终冲洗到存储。 该方法为从写入高速缓存读取的每个特定数据单元设置一个复制到读取高速缓存标志。 在将每个数据单元刷新到存储器时，如果设置了数据单元的标志，该方法将数据单元复制到读高速缓存。 缓存数据的方法的另一个实施例将数据单元写入写高速缓存。 该方法模拟将数据单元从写缓存复制到读缓存的传输策略，以确定传输策略的性能指标。 在冲洗每个数据单元时，如果性能指示符超过阈值，则该方法将数据单元复制到读高速缓存，并且传输策略包括将数据单元复制到读高速缓存中。

公开(公告)号：US20060174063A1

公开(公告)日：2006-08-03

申请号：US11051435

申请日：2005-02-03

Applicant: Craig Soules ,  Arif Merchant ,  Alistair Veitch ,  Yasushi Saito ,  John Wilkes

Inventor： Craig Soules ,  Arif Merchant ,  Alistair Veitch ,  Yasushi Saito ,  John Wilkes

IPC: G06F12/00

CPC classification number: G06F12/0862 ,  G06F12/0813

Abstract: An embodiment of a method of cooperative caching for a distributed storage system begins with a step of requesting data from storage devices which hold the data. The method continues with a step of receiving any cached blocks and expected response times for providing non-cached blocks from the storage devices. The method concludes with a step of requesting a sufficient number of the non-cached blocks from one or more particular storage devices which provides an expectation of optimal performance.

Abstract translation: 用于分布式存储系统的协作缓存方法的一个实施例从对存储数据的存储设备请求数据的步骤开始。 该方法继续接收任何高速缓存的块和从存储设备提供非缓存块的预期响应时间的步骤。 该方法的结束是从一个或多个提供最佳性能期望的特定存储设备请求足够数量的非缓存块的步骤。

公开(公告)号：US07043621B2

公开(公告)日：2006-05-09

申请号：US10439977

申请日：2003-05-15

Applicant: Arif Merchant ,  Mahesh Kallahalla ,  Ram Swaminathan

Inventor： Arif Merchant ,  Mahesh Kallahalla ,  Ram Swaminathan

IPC: G06F12/00

CPC classification number: G06F3/0608 ,  G06F3/061 ,  G06F3/0629 ,  G06F3/0665 ,  G06F3/0683 ,  Y10S707/99953 ,  Y10S707/99956

Abstract: A method and apparatus is used to divide a storage volume into shards. 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, associating a weight with each directed edge that represents the dissimilarity for the shard of blocks between the corresponding pair of vertices, selecting a maximum number of shards (K) for dividing the storage volume, identifying a minimum aggregate weight associated with a current vertex for a combination of no more than K shards, performing the identification of the minimum aggregate weight for vertices in the directed graph, 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.

Abstract translation: 使用方法和装置将存储卷分成碎片。 使用具有存储卷中的每个块的顶点的有向图以及表示块的块的顶点对之间的有向边，将权重与代表块之间的块的不同性的每个有向边相关联 相应的顶点对，选择用于划分存储卷的最大碎片数（K），识别与不超过K个碎片的组合的当前顶点相关联的最小聚集权重，执行顶点的最小聚集权重的标识 在有向图中，并选择与最后一个顶点相关联的最小聚合权重，以确定跨越存储卷的分片，并在不超过K个块的块中提供最小的不相似性。

公开(公告)号：US07035971B1

公开(公告)日：2006-04-25

申请号：US10253341

申请日：2002-09-23

Applicant: Arif Merchant

Inventor： Arif Merchant

IPC: G06F12/00

CPC classification number: G06F11/3433 ,  G06F11/3419 ,  G06F11/3452 ,  G06F2201/88 ,  G06F2201/885

Abstract: Method and apparatus for distributing storage requests referencing a replicated data set to heterogeneous storage arrays. A workload includes related storage requests that have a common quality-of-service requirement. The performance levels of the storage arrays are monitored in processing the storage requests. The performance levels and quality-of-service requirements are used for distributing the storage requests between the storage arrays.

Abstract translation: 将引用复制数据集的存储请求分发到异构存储阵列的方法和装置。 工作负载包括具有通用服务质量要求的相关存储请求。 在处理存储请求时监视存储阵列的性能级别。 性能级别和服务质量要求用于在存储阵列之间分配存储请求。

公开(公告)号：US20050091450A1

公开(公告)日：2005-04-28

申请号：US10693573

申请日：2003-10-23

Applicant: Svend Frolund ,  Arif Merchant ,  Yasusuhi Saito ,  Susan Spence ,  Alistar Veitch

Inventor： Svend Frolund ,  Arif Merchant ,  Yasusuhi Saito ,  Susan Spence ,  Alistar Veitch

IPC: G06F11/10 ,  G06F12/00

CPC classification number: G06F11/1076 ,  G06F11/1088 ,  G06F2211/1028 ,  G06F2211/104

Abstract: 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.

Abstract translation: 读取数据的方法包括将读取的消息发送到保存条带的存储设备，并且接收至少一定数量的回复消息。 保存数据块的存储装置的应答消息包括数据块。 法定人数满足数量的法定条件，使得条形块数量的任意两个选择在解码条纹所需的最小数量的条块中相交。 一种写入数据的方法包括向存储条带的存储设备发送查询消息，从存储设备的至少第一法定数量的每一个接收查询应答消息，向存储设备发送修改消息，以及从每个存储设备接收写回复消息 的至少第二法定的存储设备。 第一和第二法定人数均符合法定人数。