公开(公告)号：US08055845B2

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

申请号：US11051435

申请日：2005-02-03

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

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

IPC: G06F12/00 ,  G06F13/00 ,  G06F13/28 ,  G06F15/173 ,  G06F9/46

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

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

公开(公告)号：US07823156B2

公开(公告)日：2010-10-26

申请号：US11051436

申请日：2005-02-03

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

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

IPC: G06F9/46 ,  G06F15/16 ,  G06F15/173 ,  G06F12/00

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

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

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

公开(公告)号：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: 可调节存储系统在传送过程期间修改具有多个数据块的存储设备的布局。 存储系统可以包括连接到存储设备的阵列控制器，以及连接到阵列控制器的索引表，用于存储来自磁存储设备的数据块的地址。 存储的数据块的地址表示传送过程中涉及的数据块。