公开(公告)号：US07643983B2

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

申请号：US10400232

申请日：2003-03-27

Applicant: Christopher Lumb ,  Arif Merchant ,  Guillermo Alvarez

Inventor： Christopher Lumb ,  Arif Merchant ,  Guillermo Alvarez

IPC: G06F9/455 ,  G06F13/10 ,  G06F12/00 ,  G06F17/30

CPC classification number: G06F13/105

Abstract: A technique for emulation of a data storage system. The invention allows the level of services to be provided by a data storage system to be specified in terms of the level of services provided by another storage system. In one aspect, a performance characterization of a data storage device to be emulated is obtained (e.g., by experimental techniques). A specification of a workload is also obtained that includes a specification of a plurality of data stores for the workload. The data stores are assigned to an emulation data storage device according to the performance characterization and according to the specification of the workload such that sufficient resources of the emulation data storage device are allocated to the workload to meet the performance characterization of the data storage device to be emulated. The emulation data storage device is then operated under the workload. Quality-of-service (QoS) control may be performed so as to provide a degree of performance isolation among the workloads.

Abstract translation: 用于仿真数据存储系统的技术。 本发明允许由数据存储系统提供的服务级别根据由另一个存储系统提供的服务级别来指定。 在一个方面，获得待仿真的数据存储设备的性能表征（例如，通过实验技术）。 还获得了包括用于工作负载的多个数据存储的规范的工作负载的规范。 根据性能表征和根据工作负载的规格将数据存储设备分配给仿真数据存储设备，使得将仿真数据存储设备的足够资源分配给工作负载以满足数据存储设备的性能表征 被仿效。 仿真数据存储设备然后在工作负载下运行。 可以执行服务质量（QoS）控制，以便在工作负载之间提供一定程度的性能隔离。

公开(公告)号：US07426616B2

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

申请号：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: G06F12/00

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.

Abstract translation: 提供了一种用于确定恢复计划的方法。 该方法包括接受恢复图。 恢复图显示了数据恢复的一个或多个策略。 此外，提供和接受至少一个目标。 恢复图被形式化为所提供目标的优化问题。 当形式化为优化问题时，至少应用一种解决方法来确定至少一个恢复计划。

公开(公告)号：US20070288587A1

公开(公告)日：2007-12-13

申请号：US11450987

申请日：2006-06-12

Applicant: Marcos K. Aguilera ,  Christos Karamanolis ,  Arif Merchant ,  Mehul A. Shah ,  Alistair Veitch

Inventor： Marcos K. Aguilera ,  Christos Karamanolis ,  Arif Merchant ,  Mehul A. Shah ,  Alistair Veitch

IPC: G06F15/167

CPC classification number: G06F9/466 ,  G06F9/526 ,  G06F2209/521

Abstract: A transactional shared memory system has a plurality of discrete application nodes; a plurality of discrete memory nodes; a network interconnecting the application nodes and the memory nodes, and a controller for directing transactions in a distributed system utilizing the shared memory. The memory nodes collectively provide an address space of shared memory that is provided to the application nodes via the network. The controller has instructions to transfer a batched transaction instruction set from an application node to at least one memory node. This instruction set includes one or more write, compare and read instruction subsets, and/or combinations thereof. At least one subset has a valid non null memory node identifier and memory address range. The memory node identifier may be indicated by the memory address range. The controller controls the memory node responsive to receipt of the batched transaction instruction set, to safeguard the associated memory address range during execution of the transaction instruction set. The batched transaction instruction set is collectively executed atomically. A notification instruction set may also be used to establish a notification, triggered upon a subsequent write event upon at least a portion of a specified address range.

Abstract translation: 交易共享存储器系统具有多个离散应用节点; 多个离散存储器节点; 互连应用节点和存储器节点的网络，以及用于在利用共享存储器的分布式系统中指导事务的控制器。 存储器节点共同地提供通过网络提供给应用节点的共享存储器的地址空间。 控制器具有将批处理交易指令集从应用节点传送到至少一个存储器节点的指令。 该指令集包括一个或多个写入，比较和读取指令子集，和/或其组合。 至少一个子集具有有效的非空存储器节点标识符和存储器地址范围。 存储器节点标识符可以由存储器地址范围指示。 所述控制器响应于接收到所述批处理指令集来控制所述存储器节点，以在所述事务指令集的执行期间保护所述相关联的存储器地址范围。 批量事务指令集合是以原子方式共同执行的。 也可以使用通知指令集来建立在指定地址范围的至少一部分上的后续写入事件时触发的通知。

公开(公告)号：US07284088B2

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

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

公开(公告)号：US07266716B2

公开(公告)日：2007-09-04

申请号：US10693743

申请日：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/00

CPC classification number: G06F11/1076 ,  G06F2211/104

Abstract: A method of recovering a stripe of erasure coded data begins with sending query messages to storage devices. The method continues with receiving query reply messages from at least a first quorum of the storage devices. 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, which include a timestamp and the stripe block destined for the storage device. The method concludes with receiving a write reply message from at least a second quorum of the storage devices 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.

Abstract translation: 恢复擦除编码数据的条带的方法从向存储设备发送查询消息开始。 该方法继续接收来自存储设备的至少第一法定的询问回复消息。 查询回复消息包括对条带进行解码所需的最小条带数。 之后，编码擦除编码数据的条带。 接下来，将写消息发送到每个存储设备，其中包括时间戳和目的地为存储设备的条带块。 该方法结束于从存储设备的至少第二法定数字接收到写入回复消息，指示条块被成功存储。 第一和第二仲裁每个满足数量的法定条件，使得条纹块的数量的任何两个选择在最小数量的条带块中相交。

公开(公告)号：US07152077B2

公开(公告)日：2006-12-19

申请号：US10440531

申请日：2003-05-16

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

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

IPC: G06F17/30

CPC classification number: G06F11/2094 ,  G06F11/1076 ,  G06F11/1662 ,  Y10S707/99953 ,  Y10S707/99954

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

Abstract translation: 冗余存储的数据结构和时间戳管理技术。 多个存储设备通过通信介质互连。 至少两个存储设备是用于存储数据块的指定设备。 每个指定的设备存储数据的版本和指示何时上次更新数据的版本的第一时间戳。 第二时间戳指示对数据块的待定更新。 当数据块的更新在指定的设备之一完成时，设备丢弃第二个时间戳。 充当协调器的存储设备指示设备丢弃第二个时间戳。 指定的存储装置根据数据结构存储多个数据块和对应的时间戳。 数据结构中的至少一些条目对应于共享公共时间戳的数据块的范围。 数据结构中的条目被布置成使得范围不重叠。

公开(公告)号：US20060173935A1

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

申请号：US11051200

申请日：2005-02-03

Applicant: Arif Merchant ,  Kimberly Keeton

Inventor： Arif Merchant ,  Kimberly Keeton

IPC: G06F17/30

CPC classification number: G06F11/1451 ,  G06F11/1469

Abstract: An embodiment of a method of restoring data begins with a step of restoring point-in-time data from a local copy. The method concludes with a step of restoring at least a portion of an incremental difference between the point-in-time data and a desired state of the data from a remote mirror.

Abstract translation: 恢复数据的方法的一个实施例以从本地拷贝恢复时间点数据的步骤开始。 该方法的结论是恢复时间点数据与来自远程镜像的数据的期望状态之间的增量差异的至少一部分的步骤。

公开(公告)号：US07073029B2

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

申请号：US10351357

申请日：2003-01-27

Applicant: Mustafa Uysal ,  Arif Merchant ,  Guillermo A. Alvarez

Inventor： Mustafa Uysal ,  Arif Merchant ,  Guillermo A. Alvarez

IPC: G06F12/08

CPC classification number: G06F11/1076 ,  G06F2211/1038

Abstract: A computer storage system includes a controller and a storage device array. The storage device array includes a first sub-array and a fast storage device sub-array. The first sub-array includes one or more log-structured 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: 计算机存储系统包括控制器和存储设备阵列。 存储设备阵列包括第一子阵列和快速存储设备子阵列。 第一子阵列包括存储数据的一个或多个日志结构存储设备。 快速存储设备子阵列包括存储存储在第一子阵列中的数据的副本的一个或多个快速存储设备。

公开(公告)号：US07050956B2

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

申请号：US09843930

申请日：2001-04-30

Applicant: Mustafa Uysal ,  Ralph Becker-Szendy ,  Arif Merchant ,  Guillermo Alvarez

Inventor： Mustafa Uysal ,  Ralph Becker-Szendy ,  Arif Merchant ,  Guillermo Alvarez

IPC: G06G7/48

CPC classification number: G06F11/3447 ,  G06F11/3414 ,  G06F2201/885

Abstract: A method predicts performance of a system that includes a plurality of interconnected components defining at least one data flow path. The method references a workload specification for the system. The method models the system using one or more component models. Each component model represents selected one or more of the components. Each component model is arranged in like relationship to the data flow path as the selected one or more of the components represented by the component model. Each component model is (a) a constraint upon the workload specification input to that component model or (b) a transformer of the workload specification input to that component model so as to result in one or more output workload specifications that are input workload specifications to subsequent component models along the data flow path or (c) both a constraint and a transformer. At least one of the component models is a constraint. At least some of the component models along the data flow path operate on the workload specification. In one preferred form, operating on the workload specification involves arranging the component models in a hierarchy corresponding to the data flow path; using the specified workload specification as input to the topmost component model in the hierarchy; and applying one or more of the component models to its input workload specification, starting with the topmost component model and then component models at progressively lower levels in the hierarchy. Output workload specification at one level is input workload specification at the next lower level. If the component model comprises a constraint, the method evaluates whether the input workload specification satisfies or violates the constraint. If the component model comprises a workload specification transform, the method modifies the input workload specification so as to produce one or more output workload specifications.

公开(公告)号：US20050091556A1

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

申请号：US10693743

申请日：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/00 ,  G06F11/10 ,  G11B20/00

CPC classification number: G06F11/1076 ,  G06F2211/104

Abstract: A method of recovering a stripe of erasure coded data begins with sending query messages to storage devices. The method continues with receiving query reply messages from at least a first quorum of the storage devices. 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, which include a timestamp and the stripe block destined for the storage device. The method concludes with receiving a write reply message from at least a second quorum of the storage devices 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.

Abstract translation: 恢复擦除编码数据的条带的方法从向存储设备发送查询消息开始。 该方法继续接收来自存储设备的至少第一法定的询问回复消息。 查询回复消息包括对条带进行解码所需的最小条带数。 之后，编码擦除编码数据的条带。 接下来，将写消息发送到每个存储设备，其中包括时间戳和目的地为存储设备的条带块。 该方法结束于从存储设备的至少第二法定数字接收到写入回复消息，指示条块被成功存储。 第一和第二仲裁每个满足数量的法定条件，使得条纹块的数量的任何两个选择在最小数量的条带块中相交。