公开(公告)号：US06606585B1

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

申请号：US09379204

申请日：1999-08-21

申请人： Elizabeth Lynn Borowsky ,  Richard Golding ,  Arif Merchant ,  Mirjana Spasojevic ,  John Wilkes

发明人： Elizabeth Lynn Borowsky ,  Richard Golding ,  Arif Merchant ,  Mirjana Spasojevic ,  John Wilkes

IPC分类号： G06F760

CPC分类号： G06F11/3452 ,  G06F11/3414

摘要： 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.

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

公开(公告)号：US06553389B1

公开(公告)日：2003-04-22

申请号：US09394238

申请日：1999-09-13

申请人： Richard Andrew Golding ,  Elizabeth Lynn Borowsky

发明人： Richard Andrew Golding ,  Elizabeth Lynn Borowsky

IPC分类号： G06F1730

CPC分类号： G06F11/2056 ,  G06F11/1425 ,  H04L67/1095 ,  H04L67/1097 ,  H04L69/40 ,  Y10S707/99953

摘要： A distributed data storage system is provided with a mechanism for determining data storage resource availability during data system failures. When a partition occurs, a coordinator requests all reachable replicas to begin a new epoch and each replica responds with its most recent epoch number and the list of replicas that it believes were active in that epoch. From the responses, the coordinator finds the maximum epoch number and the list of replicas in that epoch is taken as the list from which a quorum must be drawn. The coordinator establishes a quorum when, for each byte in the virtual store, the coordinator receives responses from more than half of the replicas for that byte. The coordinator then determines resource availability and sends out a message to all the reachable replicas with a new epoch number greater than the previous epoch number and the list of replicas active in this new epoch. The replicas receive this message, record the epoch number and the list of replicas, and proceed.

摘要翻译： 分布式数据存储系统具有用于在数据系统故障期间确定数据存储资源可用性的机制。 当发生分区时，协调器请求所有可到达的副本开始一个新的时期，每个副本用其最新的时代号和它认为在该时期中活动的副本的列表进行响应。 从响应中，协调者查找最大纪元数，并将该纪元中的副本列表作为必须绘制法定人数的列表。 当虚拟存储器中的每个字节，协调器从该字节的一半以上的副本接收响应时，协调器建立仲裁。 协调器然后确定资源可用性，并向具有大于先前纪元号的新纪元编号和在该新纪元中活跃的副本列表的所有可达副本发送消息。 副本收到此消息，记录纪元号和副本列表，并继续。

公开(公告)号：US06381619B1

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

申请号：US09394221

申请日：1999-09-13

申请人： Elizabeth Lynn Borowsky ,  Richard Andrew Golding ,  Dushyanth Narayanan

发明人： Elizabeth Lynn Borowsky ,  Richard Andrew Golding ,  Dushyanth Narayanan

IPC分类号： G06F1730

CPC分类号： G06F17/30289 ,  Y10S707/959 ,  Y10S707/99952 ,  Y10S707/99953 ,  Y10S707/99955

摘要： A data storage system is provided in which a migration plan generates migration plans for reaching a goal configuration from an initial configuration in a predetermined period of time. The migration plan initially makes terminal moves until no further terminal moves can be made. A shunt move is then made based on reducing the contention (the total size of the data stores that need to be moved onto a particular data stores device divided by the amount of excess capacity on the data storage device). The shunt is selected to lead to the lowest contention for the data storage system. Subsequently, the migration plan returns to making terminal moves to develop a migration plan. Further migration plans are provided.

摘要翻译： 提供了一种数据存储系统，其中迁移计划在预定时间段内从初始配置生成用于达到目标配置的迁移计划。 迁移计划最初使终端移动，直到不再进一步终端移动。 然后，基于减少争用（需要移动到特定数据存储设备上的数据存储器的总大小除以数据存储设备上的超量容量）来进行分流移动。 分流器被选择为导致数据存储系统的最低竞争力。 随后，迁移计划返回到终端移动制定迁移计划。 提供进一步的移民计划。

公开(公告)号：US06571258B1

公开(公告)日：2003-05-27

申请号：US09394646

申请日：1999-09-13

申请人： Elizabeth Lynn Borowsky ,  Richard Andrew Golding ,  Dushyanth Narayanan

发明人： Elizabeth Lynn Borowsky ,  Richard Andrew Golding ,  Dushyanth Narayanan

IPC分类号： G06F1200

CPC分类号： G06F3/0601 ,  G06F2003/0697 ,  Y10S707/99952 ,  Y10S707/99953 ,  Y10S707/99955

摘要： A data storage system is provided in which a migration plan generates migration plans for reaching a goal configuration from an initial configuration in a predetermined period of time. The migration plan initially makes terminal moves until no further terminal moves can be made. A shunt move is then made based on reducing the contention (the total size of the data stores that need to be moved onto a particular data stores device divided by the amount of excess capacity on the data storage device). The shunt is selected to lead to the lowest contention for the data storage system. Subsequently, the migration plan returns to making terminal moves to develop a migration plan. By determining existence and utilization dependencies of the various moves, independent moves are determined to be implemented in parallel with moves having dependencies. This produces parallelized migration plans which run much faster than sequential migration plans.

摘要翻译： 提供了一种数据存储系统，其中迁移计划在预定时间段内从初始配置生成用于达到目标配置的迁移计划。 迁移计划最初使终端移动，直到不再进一步终端移动。 然后，基于减少争用（需要移动到特定数据存储设备上的数据存储器的总大小除以数据存储设备上的超量容量）来进行分流移动。 分流器被选择为导致数据存储系统的最低竞争力。 随后，迁移计划返回到终端移动制定迁移计划。 通过确定各种移动的存在和利用依赖性，确定独立移动与具有依赖性的移动并行地实现。 这产生并行迁移计划，其运行速度比顺序迁移计划快得多。