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

公开(公告)号：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.

公开(公告)号：US08775763B2

公开(公告)日：2014-07-08

申请号：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: G06F12/00 ,  G06F13/00 ,  G06F13/28 ,  G06F7/00 ,  G06F17/00 ,  G06F17/30 ,  G06F3/06

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时，该组被划分以形成具有减少的需求的一组数据段。 然后识别具有足够资源以适应减少的需求的节点。 在其他方面，技术提供了向具有多个现有存储设备节点的数据存储系统添加新的存储设备节点并且用于从这样的数据存储系统中的存储设备节点移除数据。

公开(公告)号：US08694699B2

公开(公告)日：2014-04-08

申请号：US12794594

申请日：2010-06-04

Applicant: Kishore Kumar Muppirala ,  Satish Kumar Mopur ,  Sumanesh Samanta ,  Dinkar Sitaram ,  Ayman Abouelwafa ,  Mustafa Uysal ,  Arif Merchant

Inventor： Kishore Kumar Muppirala ,  Satish Kumar Mopur ,  Sumanesh Samanta ,  Dinkar Sitaram ,  Ayman Abouelwafa ,  Mustafa Uysal ,  Arif Merchant

IPC: G06F3/00 ,  G06F13/00

CPC classification number: H04L12/6418

Abstract: Systems and methods for path selection for application commands are described. To this end, information associated with at least one application command that were processed at least one port of a target device is received. For a subsequent application command, a set of ports of the target device is determined. In one implementation, the set of ports is determined based on information associated with the subsequent application command. Once the set of ports is determined, the subsequent application command is directed to a port selected from the set of ports.

Abstract translation: 描述了应用程序命令的路径选择的系统和方法。 为此，接收与处理了目标设备的至少一个端口的至少一个应用命令相关联的信息。 对于后续应用命令，确定目标设备的一组端口。 在一个实现中，基于与后续应用命令相关联的信息来确定端口组。 一旦确定了一组端口，则后续应用命令被定向到从该组端口中选择的端口。

公开(公告)号：US07917903B2

公开(公告)日：2011-03-29

申请号：US10400556

申请日：2003-03-27

Applicant: Christopher Lumb ,  Arif Merchant ,  Guillermo Alvarez

Inventor： Christopher Lumb ,  Arif Merchant ,  Guillermo Alvarez

IPC: G06F9/46

CPC classification number: G06F9/4887

Abstract: A quality-of-service controller and related method for a data storage system. Requests for each of a plurality of storage system workloads are prioritized. The requests are selectively forwarded to a storage device queue according to their priorities so as to maintain the device queue at a target queue depth. The target queue depth is adjusted response to a latency value for the requests wherein the latency value is computed based on a difference between an arrival time and a completion time of the requests for each workload. Prioritizing the requests may be accomplished by computing a target deadline for a request based on a monitored arrival time of the request and a target latency for its workload. To reduce latencies, the target queue depth may be reduced when the target latency for a workload is less than its computed latency value. To increase throughput, the target queue depth may be increased when the target latency for each workload is greater than each computed latency value.

Abstract translation: 一种数据存储系统的服务质量控制器和相关方法。 优先考虑多个存储系统工作负载中的每一个的请求。 这些请求根据其优先级选择性地转发到存储设备队列，以便将设备队列保持在目标队列深度。 根据对每个工作负载的请求的到达时间和完成时间之间的差值来计算等待时间值，从而对目标队列深度进行调整响应。 可以通过基于所请求的监视到达时间和其工作负载的目标延迟来计算请求的目标截止时间来实现优先级请求。 为了减少延迟，当工作负载的目标延迟小于其计算的延迟值时，可能会减少目标队列深度。 为了增加吞吐量，当每个工作负载的目标延迟大于每个计算的等待时间值时，可能会增加目标队列深度。

公开(公告)号：US20070192544A1

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

申请号：US11357776

申请日：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: G06F13/28

CPC classification number: G06F12/0815 ,  G06F11/1064 ,  G06F11/1666 ,  G06F11/183 ,  G06F12/0808 ,  G06F12/0866

Abstract: An embodiment of a method of operating a replicated cache includes generating a timestamp. A unit of data is read from memory of the replicated cache. The replicated cache comprises a plurality of independent computing devices. Each independent computing device comprises a processor and a portion of the memory. Confirmations are received from at least a majority of the independent computing devices that a flush operation for the unit of data was initiated no later than a time indicated by the timestamp and that a more recent version of the unit of data has not been flushed. The unit of data is provided to storage.

Abstract translation: 操作复制高速缓存的方法的实施例包括生成时间戳。 从复制的高速缓存的内存读取数据单元。 复制的高速缓存包括多个独立的计算设备。 每个独立的计算设备包括处理器和存储器的一部分。 从至少大多数独立计算设备接收到确认，数据单元的刷新操作不迟于时间戳指示的时间以及数据单元的更新版本尚未刷新。 数据单位提供给存储。

公开(公告)号：US20060236073A1

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

申请号：US11051436

申请日：2005-02-03

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

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

IPC: G06F12/10 ,  G06F9/46

CPC classification number: G06F3/0631 ,  G06F3/0613 ,  G06F3/067 ,  G06F2206/1012

Abstract: An embodiment of a method of hashing an address space to a plurality of storage servers begins with a first step of dividing the address space by a number of the storage servers to form data segments. Each data segment comprises a base address. A second step assigns the data segments to the storage servers according to a sequence. The method continues with a third step of measuring a load on each of the storage servers. According to an embodiment, the method concludes with a fourth step of adjusting data shares assigned to the storage servers according to the sequence to approximately balances the loads on the storage servers while maintaining the base address for each data segment on an originally assigned storage server. According to another embodiment, the method periodically performs the third and fourth steps to maintain an approximately balanced load on the storage servers.

Abstract translation: 将地址空间散列到多个存储服务器的方法的实施例开始于将地址空间除以多个存储服务器以形成数据段的第一步骤。 每个数据段包括基地址。 第二步根据序列将数据段分配给存储服务器。 该方法继续测量每个存储服务器上的负载的第三步。 根据实施例，该方法结束于第四步骤，根据顺序调整分配给存储服务器的数据共享，以大致平衡存储服务器上的负载，同时维护原始分配的存储服务器上的每个数据段的基址。 根据另一实施例，该方法周期性地执行第三和第四步骤以维持存储服务器上的大致平衡的负载。

公开(公告)号：US07032086B2

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

申请号：US10375177

申请日：2003-02-28

Applicant: Arif Merchant

Inventor： Arif Merchant

IPC: G06F13/00

CPC classification number: G06F11/1096 ,  G06F11/1092

Abstract: An adjustable storage system modifies a layout of a storage device having a plurality data blocks during a transfer process. The storage system may include an array controller connected to the storage device, and an index table connected to the array controller for storing addresses of data blocks from the magnetic storage device. The addresses of stored data blocks represent the data blocks involved in the transfer process.

Abstract translation: 可调节存储系统在传送过程期间修改具有多个数据块的存储设备的布局。 存储系统可以包括连接到存储设备的阵列控制器，以及连接到阵列控制器的索引表，用于存储来自磁存储设备的数据块的地址。 存储的数据块的地址表示传送过程中涉及的数据块。

公开(公告)号：US08335770B2

公开(公告)日：2012-12-18

申请号：US11051200

申请日：2005-02-03

Applicant: Arif Merchant ,  Kimberly Keeton

Inventor： Arif Merchant ,  Kimberly Keeton

IPC: G06F17/00

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

公开(公告)号：US20110302337A1

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

申请号：US12794594

申请日：2010-06-04

Applicant: Kishore Kumar Muppirala ,  Satish Kumar Mopur ,  Sumanesh Samanta ,  Dinkar Sitaram ,  Ayman Abouelwafa ,  Mustafa Uysal ,  Arif Merchant

Inventor： Kishore Kumar Muppirala ,  Satish Kumar Mopur ,  Sumanesh Samanta ,  Dinkar Sitaram ,  Ayman Abouelwafa ,  Mustafa Uysal ,  Arif Merchant

IPC: G06F3/00

CPC classification number: H04L12/6418

Abstract: Systems and methods for path selection for application commands are described. To this end, information associated with at least one application command that were processed at least one port of a target device is received. For a subsequent application command, a set of ports of the target device is determined. In one implementation, the set of ports is determined based on information associated with the subsequent application command. Once the set of ports is determined, the subsequent application command is directed to a port selected from the set of ports.

Abstract translation: 描述了应用程序命令的路径选择的系统和方法。 为此，接收与处理了目标设备的至少一个端口的至少一个应用命令相关联的信息。 对于后续应用命令，确定目标设备的一组端口。 在一个实现中，基于与后续应用命令相关联的信息来确定端口组。 一旦确定了一组端口，则后续应用命令被定向到从该组端口中选择的端口。