公开(公告)号：US06366931B1

公开(公告)日：2002-04-02

申请号：US09197114

申请日：1998-11-20

Applicant: Elizabeth Borowsky ,  Pat Jacobson ,  Arif Merchant

Inventor： Elizabeth Borowsky ,  Pat Jacobson ,  Arif Merchant

IPC: G06F1730

CPC classification number: G06F9/5016 ,  Y10S707/99956

Abstract: An apparatus for and a method of non-linear 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 non-linear constraint integer optimization to generate an assignment plan for the workload units to the storage devices.

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

公开(公告)号：US09063898B1

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

申请号：US10997020

申请日：2004-11-23

Applicant: Arif Merchant ,  Kimberly Keeton ,  Alistair Veitch

Inventor： Arif Merchant ,  Kimberly Keeton ,  Alistair Veitch

IPC: G06F7/00 ,  G06F11/14

CPC classification number: G06F11/1469 ,  G06F11/14 ,  G06F11/1456 ,  G06F2201/835

Abstract: An embodiment of a method of restoring backup data comprises first and second steps that preferably are executed at least partially in parallel. The first step restores an incremental backup. The second step selectively restores a full backup. The selective restoration of the full backup disregards units of data that were restored from the incremental backup and restores a remainder of the full backup. In an alternative embodiment, the first step precedes the second step. In another alternative embodiment, the selective restoration of the full backup accesses a table that indicates the units of data contained in the incremental backup to determine which units of data to disregard in the full backup.

Abstract translation: 恢复备份数据的方法的实施例包括优选地至少部分地并行执行的第一和第二步骤。 第一步恢复增量备份。 第二步有选择地恢复完整的备份。 完全备份的选择性恢复忽略从增量备份还原的数据单元，并恢复剩余的完整备份。 在替代实施例中，第一步在第二步之前。 在另一替代实施例中，完全备份的选择性恢复访问指示增量备份中包含的数据单元的表，以确定在完全备份中忽略哪些数据单元。

公开(公告)号：US08949489B1

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

申请号：US13426112

申请日：2012-03-21

Applicant: Arif Merchant

Inventor： Arif Merchant

IPC: G06F3/00 ,  G06F3/06 ,  G06F13/16

CPC classification number: G06F13/1642 ,  G06F3/0611 ,  G06F3/0659 ,  G06F3/0683 ,  G06F13/1626

Abstract: Systems, mediums, and methods are provided for scheduling input/output requests to a storage system. The input output requests may be received, categorized based on their priority, and scheduled for retrieval from the storage system. Lower priority requests may be divided into smaller sub-requests, and the sub-requests may be scheduled for retrieval only when there are no pending higher priority requests, and/or when higher priority requests are not predicted to arrive for a certain period of time. By servicing the small sub-requests rather than the entire lower priority request, the retrieval of the lower priority request may be paused in the event that a high priority request arrives while the lower priority request is being serviced.

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

公开(公告)号：US07761663B2

公开(公告)日：2010-07-20

申请号：US11357776

申请日：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/0815 ,  G06F11/1064 ,  G06F11/1666 ,  G06F11/183 ,  G06F12/0808 ,  G06F12/0866

Abstract: A unit of data is read from memory of a 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: 从复制高速缓存的内存中读取数据单元。 复制的高速缓存包括多个独立的计算设备。 每个独立的计算设备包括处理器和存储器的一部分。 从至少大多数独立计算设备接收到确认，数据单元的刷新操作不迟于时间戳指示的时间以及数据单元的更新版本尚未刷新。 数据单位提供给存储。

公开(公告)号：US07761421B2

公开(公告)日：2010-07-20

申请号：US10440548

申请日：2003-05-16

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

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

IPC: G06F17/30

CPC classification number: G06F11/182 ,  G06F11/1662 ,  G06F2201/835

Abstract: Read, write and recovery operations for replicated data are provided. In one aspect, a system for redundant storage of data included a plurality of storage devices and a communication medium for interconnecting the storage devices. At least two of the storage devices are designated devices for storing a block of data. Each designated device has a version of the data and a first timestamp that is indicative of when the version of data was last updated and a second timestamp that is indicative of any pending update to the block of data. The read, write and recovery operations are performed to the data using the first and second timestamps to coordinate the operations among the designated devices.

Abstract translation: 提供了复制数据的读取，写入和恢复操作。 一方面，用于数据冗余存储的系统包括多个存储设备和用于互连存储设备的通信介质。 至少两个存储设备是用于存储数据块的指定设备。 每个指定的设备具有数据的版本和指示何时上次更新数据的版本的时间戳和指示对数据块的任何待定更新的第二时间戳。 使用第一和第二时间戳对数据执行读取，写入和恢复操作，以协调指定的设备之间的操作。

公开(公告)号：US07647454B2

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

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

公开(公告)号：US07644249B2

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

申请号：US10943732

申请日：2004-09-17

Applicant: Kimberly Keeton ,  John Wilkes ,  Cipriano A. Santos ,  Dirk Beyer ,  Jeffrey Scott Chase ,  Arif Merchant

Inventor： Kimberly Keeton ,  John Wilkes ,  Cipriano A. Santos ,  Dirk Beyer ,  Jeffrey Scott Chase ,  Arif Merchant

IPC: G06F12/00

CPC classification number: G06F11/008

Abstract: An embodiment of a method of designing a storage system begins with a step of assigning decision variables to a range of candidate storage systems. Each of the decision variables identifies a single candidate storage system. The method concludes with a step of employing the decision variables in a mathematical program to determine which of the candidate storage systems meets availability and reliability criteria and incurs a near minimal projected cost.

Abstract translation: 设计存储系统的方法的一个实施例从向候选存储系统的范围分配决策变量的步骤开始。 每个决策变量标识单个候选存储系统。 该方法的结论是采用数学程序中的决策变量来确定哪些候选存储系统满足可用性和可靠性标准，并产生接近最小的预计成本。

公开(公告)号：US07609703B2

公开(公告)日：2009-10-27

申请号：US11522151

申请日：2006-09-15

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

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

IPC: H04L12/28

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

公开(公告)号：US07536585B1

公开(公告)日：2009-05-19

申请号：US11166670

申请日：2005-06-23

Applicant: Kimberly Keeton ,  Arif Merchant

Inventor： Kimberly Keeton ,  Arif Merchant

IPC: G06F11/00

CPC classification number: G06F11/008 ,  G06F11/1458 ,  G06F11/1469 ,  G06F11/2071

Abstract: An embodiment of a method of estimating storage system availability 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. For a particular failure scenario, the method continues with a second step of finding a secondary storage location of a most recent retrieval point relative to a target recovery time that is available for recovery. A third step determines a recovery time for propagation of the most recent retrieval point from the secondary storage location to primary storage.

Abstract translation: 估计存储系统可用性的方法的实施例从在工作负载下操作的存储系统设计建模的第一步骤开始，以确定检索点的位置。 检索点为多个故障场景的主存储恢复提供源。 对于特定的故障场景，该方法继续第二步，找到相对于可用于恢复的目标恢复时间的最新检索点的辅助存储位置。 第三步确定将最新检索点从辅助存储位置传播到主存储的恢复时间。