公开(公告)号：US20080069098A1

公开(公告)日：2008-03-20

申请号：US11522151

申请日：2006-09-15

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

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

IPC: H04L12/56

CPC classification number: G06F9/546 ,  G06F9/544 ,  G06Q10/107 ,  H04L67/10

Abstract: Provided is a system and method for directing group communication in a system environment that has a plurality of discrete application nodes networked with at least one discrete memory node, establishing a shared memory providing a passive message queue. A code library permits an application node member of a group to assemble a message selected from the group of send, join, leave, or read. The send, join and leave messages permit a first application node to add a message to the queue for all members of a group including the first application node at the time the message was added. The instruction set permitting the addition of the message is executed atomically.

Abstract translation: 提供了一种用于在具有与至少一个离散存储器节点联网的多个离散应用节点的系统环境中引导组通信的系统和方法，建立提供被动消息队列的共享存储器。 代码库允许组的应用程序节点成员组合从发送，连接，离开或读取组中选择的消息。 发送，加入和离开消息允许第一应用节点在添加消息时，向包括第一应用节点的组的所有成员向队列添加消息。 允许添加消息的指令集以原子方式执行。

公开(公告)号：US07225118B2

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

申请号：US10284098

申请日：2002-10-31

Applicant: Qian Wang ,  Arif Merchant ,  Nina Mishra ,  Mahesh Kallahalla ,  Ram Swaminathan

Inventor： Qian Wang ,  Arif Merchant ,  Nina Mishra ,  Mahesh Kallahalla ,  Ram Swaminathan

IPC: G06F9/45

CPC classification number: G06Q10/10 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/1095 ,  H04L69/329

Abstract: A method of global data placement. The method includes assigning one or more workloads to one or more compute servers such that each workload flows to one compute server, assigning the data chunks that the workloads accesses to one or more storage servers, and determining how the workloads access the data.

Abstract translation: 全球数据放置方法。 该方法包括将一个或多个工作负载分配给一个或多个计算服务器，使得每个工作负载流向一个计算服务器，将工作负载访问的数据块分配给一个或多个存储服务器，以及确定工作负载如何访问数据。

公开(公告)号：US06606585B1

公开(公告)日：2003-08-12

申请号：US09379204

申请日：1999-08-21

Applicant: Elizabeth Lynn Borowsky ,  Richard Golding ,  Arif Merchant ,  Mirjana Spasojevic ,  John Wilkes

Inventor： Elizabeth Lynn Borowsky ,  Richard Golding ,  Arif Merchant ,  Mirjana Spasojevic ,  John Wilkes

IPC: G06F760

CPC classification number: G06F11/3452 ,  G06F11/3414

Abstract: Data storage devices of an enterprise system are tested to determine whether the enterprise system is optimally configured. Each data storage device is tested to determine whether it can satisfy a performance requirement for an assigned group of n workloads. A group of n inequalities are generated, and only up to n of the inequalities may be evaluated to determine whether the device satisfies the performance requirement for the assigned group of workloads. The inequalities are based on a phased, correlated model of I/O activity.

Abstract translation: 对企业系统的数据存储设备进行测试，以确定企业系统是否被最佳配置。 对每个数据存储设备进行测试，以确定它是否能够满足分配的n个工作负载组的性能要求。 生成一组n个不等式，并且只能对n个不等式进行评估，以确定该设备是否满足所分配的工作负载组的性能要求。 不等式基于I / O活动的分阶段相关模型。

公开(公告)号：US06321317B1

公开(公告)日：2001-11-20

申请号：US09212711

申请日：1998-12-16

Applicant: Elizabeth Borowsky ,  Richard Golding ,  Arif Merchant ,  Elizabeth Shriver ,  Mirjana Spasojevic ,  Tim Sullivan ,  John Wilkes

Inventor： Elizabeth Borowsky ,  Richard Golding ,  Arif Merchant ,  Elizabeth Shriver ,  Mirjana Spasojevic ,  Tim Sullivan ,  John Wilkes

IPC: G06F1300

CPC classification number: G06F9/5016

Abstract: An apparatus for and a method of multi-dimensional constraint optimization in a storage system configuration. In accordance with the primary aspect of the present invention, the objective function for a storage system is determined the workload units are selected and their standards are determined, and the storage devices are selected and their characteristics are determined. These selections and determinations are then used by a constraint based solver through constraint integer optimization to generate an assignment plan for the workload units to the storage devices.

Abstract translation: 存储系统配置中的多维约束优化的装置和方法。 根据本发明的主要方面，确定存储系统的目标函数，选择工作负载单元并确定其标准，并选择存储设备并确定其特性。 然后，基于约束的求解器通过约束整数优化来使用这些选择和确定，以便为存储设备的工作负载单元生成分配计划。

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