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

公开(公告)号：US20050086559A1

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

申请号：US10980649

申请日：2004-11-02

Applicant: Mustafa Uysal ,  Arif Merchant ,  Guillermo Alvarez

Inventor： Mustafa Uysal ,  Arif Merchant ,  Guillermo Alvarez

IPC: G06F3/06 ,  G06F11/20 ,  G06F12/00 ,  G06F12/16 ,  G11C29/00

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.

公开(公告)号：US06681309B2

公开(公告)日：2004-01-20

申请号：US10058185

申请日：2002-01-25

Applicant: Ralph Becker Szendy ,  Arif Merchant

Inventor： Ralph Becker Szendy ,  Arif Merchant

IPC: G06F1202

CPC classification number: G06F11/3466

Abstract: A method and apparatus is provided for measuring and optimizing the orientation of data access of an electronic storage device according to data access characteristics. Monitoring storage access activity in an area of storage space is performed to gather data pertaining to one or more storage access characteristics. Measuring is performed of the characteristics of the storage access activity of at least two individual portions of the storage space. The portions are then combined in a manner to more judiciously utilize storage space. Depending on their homogeneity of access characteristics, the individual portions may then be left alone, merged with other similar portions, or further subdivided into sub-portions, which may be further merged, divided or left alone. At each merger or division determinations can then be made of whether the characteristics of storage access activity of one individual portion or sub-portion are similar to that of another portion according to predetermined criteria.

Abstract translation: 提供了一种用于根据数据访问特性来测量和优化电子存储设备的数据访问方向的方法和装置。 执行监视存储空间区域中的存储访问活动以收集与一个或多个存储访问特性有关的数据。 执行存储空间的至少两个单独部分的存储访问活动的特性的测量。 然后这些部分以更明智地利用存储空间的方式组合。 根据其访问特性的均匀性，各个部分然后可以被单独留下，与其它类似的部分合并，或进一步细分为子部分，子部分可以被进一步合并，分开或者单独留下。 然后，在每个合并或分割确定时，可以根据预定标准确定一个单独部分或子部分的存储访问活动的特征是否与另一部分或子部分的存储访问活动的特性相似。

公开(公告)号：US09047306B1

公开(公告)日：2015-06-02

申请号：US11252335

申请日：2005-10-17

Applicant: Svend Frolund ,  Arif Merchant ,  Alistair Veitch

Inventor： Svend Frolund ,  Arif Merchant ,  Alistair Veitch

IPC: G06F17/30

CPC classification number: G06F17/30174 ,  G06F11/2064 ,  G06F11/2076 ,  G06F2201/835

Abstract: An embodiment of a method of writing data begins with a first step of generating a timestamp. A second step issues a query that includes the timestamp to each of a plurality of primary storage devices. The method continues with a third step of receiving a query reply from at least a quorum of the primary storage devices. The query replies indicate that the timestamp is later than an existing timestamp for the data. In a fourth step, the data is mirrored to secondary storage after receiving the query reply from at least the quorum of the primary storage devices. Upon receiving a mirror completion message from the secondary storage, a fifth step issues a write message that includes at least a portion of the data and the timestamp to each of the primary storage devices.

Abstract translation: 写入数据的方法的一个实施例开始于产生时间戳的第一步骤。 第二步骤向多个主存储设备中的每一个发出包含时间戳的查询。 该方法继续第三步骤，从主存储设备的至少法定人数接收查询答复。 查询回复表示时间戳晚于数据的现有时间戳。 在第四步中，从至少主存储设备的法定人数收到查询答复后，数据将被镜像到辅助存储。 在从辅助存储器接收到镜像完成消息时，第五步向每个主存储设备发出包含数据和时间戳的至少一部分的写入消息。

公开(公告)号：US07827144B1

公开(公告)日：2010-11-02

申请号：US11283471

申请日：2005-11-17

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

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

IPC: G06F7/00

CPC classification number: G06F17/30353 ,  G06F11/00 ,  G06F17/30168

Abstract: An embodiment of a method of writing data includes issuing write messages to a replica set of storage devices. Write confirmations are received from at least a majority of the storage devices. An embodiment of a method reading data includes issuing read messages to a replica set of storage devices. Read confirmations are received from at least a first majority of the storage devices. Read commit messages are issued to the storage devices. Commit confirmations are received from at least a second majority of the storage devices.

Abstract translation: 写入数据的方法的实施例包括向存储设备的副本集发出写入消息。 从至少大多数存储设备接收到写入确认。 读取数据的方法的实施例包括向存储设备的副本集发出读取消息。 从至少第一大多数存储设备接收到读取确认。 读取提交消息被发送到存储设备。 从至少第二个大多数存储设备接收到提交确认。

公开(公告)号：US07725655B2

公开(公告)日：2010-05-25

申请号：US11357815

申请日：2006-02-16

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

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

IPC: G06F12/00

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

Abstract: Data blocks are read from a distributed cache. The distributed cache comprises m replicated caches, each replicated cache including a plurality of independent computing devices. Each independent computing device of the replicated caches holds a replica of a particular one of the m data blocks in memory. 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个奇偶校验块中选择的单个块。

公开(公告)号：US07716425B1

公开(公告)日：2010-05-11

申请号：US11527868

申请日：2006-09-27

Applicant: Mustafa Uysal ,  Arif Merchant

Inventor： Mustafa Uysal ,  Arif Merchant

IPC: G06F13/00

CPC classification number: G06F12/0862 ,  G06F3/0653 ,  G06F12/0866 ,  G06F2212/6026

Abstract: Embodiments include methods, apparatus, and systems for prefetching data in distributed storage systems. One method of software execution includes using input/output (I/O) requests from multiple separate networked storage nodes in a distributed storage system to prefetch data for one of the multiple separate networked storage nodes.

Abstract translation: 实施例包括用于在分布式存储系统中预取数据的方法，装置和系统。 软件执行的一种方法包括使用来自分布式存储系统中的多个分离的网络存储节点的输入/输出（I / O）请求来预取多个分离的网络存储节点之一的数据。