公开(公告)号：US20060112389A1

公开(公告)日：2006-05-25

申请号：US10995598

申请日：2004-11-22

申请人： Mandis Beigi ,  Murthy Devarakonda ,  Marc Kaplan ,  Rohit Jain ,  James Rubas ,  Upendra Sharma ,  Akshat Verma

发明人： Mandis Beigi ,  Murthy Devarakonda ,  Marc Kaplan ,  Rohit Jain ,  James Rubas ,  Upendra Sharma ,  Akshat Verma

IPC分类号： G06F9/46

CPC分类号： G06F9/52

摘要： A policy for a computer system is transformed into a plurality of sub-policies, at least one synchronization step, and a final action. The sub-policies are distributed to corresponding sub-components in the computer system. The sub-policies are evaluated, wherein each sub-component evaluates its corresponding one or more sub-policies as other sub-components evaluate their corresponding one or more sub-policies. The sub-policies are synchronized by using the at least one synchronization step. The final action is performed in response to synchronizing the sub-policies. The computer system can be singular or distributed.

摘要翻译： 用于计算机系统的策略被转换成多个子策略，至少一个同步步骤和最终动作。 子策略分配给计算机系统中的相应子组件。 评估子策略，其中每个子组件评估其对应的一个或多个子策略，因为其他子组件评估其对应的一个或多个子策略。 通过使用至少一个同步步骤来同步子策略。 响应于子策略的同步来执行最后的动作。 计算机系统可以是单数或分布式的。

公开(公告)号：US07783728B2

公开(公告)日：2010-08-24

申请号：US10995598

申请日：2004-11-22

申请人： Mandis Sadr Mohammad Beigi ,  Murthy V Devarakonda ,  Marc Adam Kaplan ,  Rohit Jain ,  James Rubas ,  Upendra Sharma ,  Akshat Verma

发明人： Mandis Sadr Mohammad Beigi ,  Murthy V Devarakonda ,  Marc Adam Kaplan ,  Rohit Jain ,  James Rubas ,  Upendra Sharma ,  Akshat Verma

IPC分类号： G06F15/177 ,  G06F15/16 ,  H04L12/28

CPC分类号： G06F9/52

摘要： A policy for a computer system is transformed into a plurality of sub-policies, at least one synchronization step, and a final action. The sub-policies are distributed to corresponding sub-components in the computer system. The sub-policies are evaluated, wherein each sub-component evaluates its corresponding one or more sub-policies as other sub-components evaluate their corresponding one or more sub-policies. The sub-policies are synchronized by using the at least one synchronization step. The final action is performed in response to synchronizing the sub-policies. The computer system can be singular or distributed.

摘要翻译： 用于计算机系统的策略被转换成多个子策略，至少一个同步步骤和最终动作。 子策略分配给计算机系统中的相应子组件。 评估子策略，其中每个子组件评估其对应的一个或多个子策略，因为其他子组件评估其对应的一个或多个子策略。 通过使用至少一个同步步骤来同步子策略。 响应于子策略的同步来执行最后的动作。 计算机系统可以是单数或分布式的。

公开(公告)号：US20060129771A1

公开(公告)日：2006-06-15

申请号：US11011861

申请日：2004-12-14

申请人： Koustuv Dasgupta ,  Rohit Jain ,  Upendra Sharma ,  Akshat Verma

发明人： Koustuv Dasgupta ,  Rohit Jain ,  Upendra Sharma ,  Akshat Verma

IPC分类号： G06F12/00

CPC分类号： G06F3/0659 ,  G06F3/0605 ,  G06F3/0613 ,  G06F3/0647 ,  G06F3/067 ,  G06F16/214

摘要： A method for performing a data migration task on an on-line data storage system comprises computing a migration utility, which is a function of the expected time taken to complete the data migration task and generating migration requests for performing the data migration task, where the data migration task is divided into sub-tasks and a migration request is generated for each sub-task. Next determining a migration deadline for performing the data migration; assigning reward values to customer storage requests; assigning reward values to the migration requests. Then scheduling the migration requests and the customer storage requests to maximize total rewards earned and executing the schedule in order to perform the data migration task

摘要翻译： 用于在在线数据存储系统上执行数据迁移任务的方法包括计算迁移实用程序，迁移实用程序是完成数据迁移任务所需的预期时间以及生成用于执行数据迁移任务的迁移请求的函数，其中 数据迁移任务分为子任务，并为每个子任务生成迁移请求。 接下来确定执行数据迁移的迁移期限; 将奖励值分配给客户存储请求; 将奖励值分配给迁移请求。 然后调度迁移请求和客户存储请求以最大化所获得的总奖励并执行调度，以执行数据迁移任务

公开(公告)号：US20090150456A1

公开(公告)日：2009-06-11

申请号：US11953115

申请日：2007-12-10

申请人： Srinivasan Balasubramanian ,  Tushar Mohan ,  Roberto C. Pineiro ,  Rohit Jain ,  Ramani R. Routray ,  Gauri Shah ,  Akshat Verma ,  Kaladhar Voruganti

发明人： Srinivasan Balasubramanian ,  Tushar Mohan ,  Roberto C. Pineiro ,  Rohit Jain ,  Ramani R. Routray ,  Gauri Shah ,  Akshat Verma ,  Kaladhar Voruganti

IPC分类号： G06F17/30

CPC分类号： G06F11/20

摘要： Formulating an integrated disaster recovery (DR) plan based upon a plurality of DR requirements for an application by receiving a first set of inputs identifying one or more entity types for which the plan is to be formulated, such as an enterprise, one or more sites of the enterprise, the application, or a particular data type for the application. At least one data container representing a subset of data for an application is identified. A second set of inputs is received identifying at least one disaster type for which the plan is to be formulated. A third set of inputs is received identifying a DR requirement for the application as a category of DR Quality of Service (QoS) class to be applied to the disaster type. A composition model is generated specifying one or more respective DR QoS parameters as a function of a corresponding set of one or more QoS parameters representative of a replication technology solution. The replication technology solution encompasses a plurality of storage stack levels. A solution template library is generated for mapping the application to each of a plurality of candidate replication technology solutions. The template library is used to select a DR plan in the form of a replication technology solution for the application.

公开(公告)号：US07277984B2

公开(公告)日：2007-10-02

申请号：US10874857

申请日：2004-06-23

申请人： Sugata Ghosal ,  Rohit Jain ,  Akshat Verma

发明人： Sugata Ghosal ,  Rohit Jain ,  Akshat Verma

IPC分类号： G06F12/00

CPC分类号： G06F3/0632 ,  G06F3/0611 ,  G06F3/067 ,  G06Q10/06 ,  G06Q30/02

摘要： Provided are methods, apparatus and computer programs for scheduling storage input and/or output (I/O) requests. A method for scheduling storage access requests determines a request processing sequence calculated to maximize SLA-based revenues achievable from processing a number of requests. A storage controller includes a scheduler which implements a revenue-based scheduling function to determine a revenue-maximizing processing sequence, and then assigns storage access requests to locations in a queue corresponding to the determined sequence. In an on-line mode, the scheduler can adapt to additional received requests, evaluating the revenue function for the additional requests and modifying the schedule if required. The method may include analysing a request stream to predict requests that are likely to be received in the near future, and taking account of the predicted requests when determining a processing schedule.

摘要翻译： 提供了用于调度存储输入和/或输出（I / O）请求的方法，装置和计算机程序。 一种用于调度存储访问请求的方法确定了一个请求处理序列，该请求处理序列被计算为使处理多个请求可实现的基于SLA的收入最大化。 存储控制器包括执行基于收益的调度功能以确定收益最大化处理序列的调度器，然后将存储访问请求分配给与所确定的序列相对应的队列中的位置。 在在线模式中，调度器可以适应附加的接收到的请求，评估附加请求的收入功能并且如果需要则修改调度。 该方法可以包括分析请求流以预测在不久的将来可能被接收的请求，并且在确定处理调度时考虑预测的请求。

公开(公告)号：US07945537B2

公开(公告)日：2011-05-17

申请号：US12126487

申请日：2008-05-23

申请人： Srinivasan Balasubramanian ,  Tushar Mohan ,  Roberto C. Pineiro ,  Rohit Jain ,  Ramani R. Routray ,  Gauri Shah ,  Akshat Verma ,  Kaladhar Voruganti

发明人： Srinivasan Balasubramanian ,  Tushar Mohan ,  Roberto C. Pineiro ,  Rohit Jain ,  Ramani R. Routray ,  Gauri Shah ,  Akshat Verma ,  Kaladhar Voruganti

IPC分类号： G06F17/30

CPC分类号： G06F11/20

摘要： Formulating an integrated disaster recovery (DR) plan based upon a plurality of DR requirements for an application by receiving a first set of inputs identifying one or more entity types for which the plan is to be formulated, such as an enterprise, one or more sites of the enterprise, the application, or a particular data type for the application. At least one data container representing a subset of data for an application is identified. A second set of inputs is received identifying at least one disaster type for which the plan is to be formulated. A third set of inputs is received identifying a DR requirement for the application as a category of DR Quality of Service (QoS) class to be applied to the disaster type. A composition model is generated specifying one or more respective DR QoS parameters as a function of a corresponding set of one or more QoS parameters representative of a replication technology solution. The replication technology solution encompasses a plurality of storage stack levels. A solution template library is generated for mapping the application to each of a plurality of candidate replication technology solutions. The template library is used to select a DR plan in the form of a replication technology solution for the application.

摘要翻译： 基于针对应用的多个DR需求来制定综合灾难恢复（DR）计划，所述DR要求通过接收标识要为其制定所述计划的一个或多个实体类型的第一组输入，诸如企业，一个或多个站点 的应用程序，或应用程序的特定数据类型。 识别表示应用程序的数据子集的至少一个数据容器。 接收第二组输入，确定要制定该计划的至少一种灾害类型。 接收到第三组输入，将应用程序的DR要求标识为要应用于灾难类型的DR服务质量（QoS）类别。 生成指定作为代表复制技术解决方案的一个或多个QoS参数的相应组的函数的一个或多个相应DR QoS参数的组合模型。 复制技术解决方案包含多个存储堆栈级别。 生成解决方案模板库，用于将应用程序映射到多个候选复制技术解决方案中的每一个。 模板库用于以应用程序的复制技术解决方案的形式选择DR计划。

公开(公告)号：US20050289312A1

公开(公告)日：2005-12-29

申请号：US10874857

申请日：2004-06-23

申请人： Sugata Ghosal ,  Rohit Jain ,  Akshat Verma

发明人： Sugata Ghosal ,  Rohit Jain ,  Akshat Verma

IPC分类号： G06F3/06 ,  G06F12/00 ,  G06Q10/00 ,  G06Q30/00

CPC分类号： G06F3/0632 ,  G06F3/0611 ,  G06F3/067 ,  G06Q10/06 ,  G06Q30/02

摘要： Provided are methods, apparatus and computer programs for scheduling storage input and/or output (I/O) requests. A method for scheduling storage access requests determines a request processing sequence calculated to maximize SLA-based revenues achievable from processing a number of requests. A storage controller includes a scheduler which implements a revenue-based scheduling function to determine a revenue-maximizing processing sequence, and then assigns storage access requests to locations in a queue corresponding to the determined sequence. In an on-line mode, the scheduler can adapt to additional received requests, evaluating the revenue function for the additional requests and modifying the schedule if required. The method may include analysing a request stream to predict requests that are likely to be received in the near future, and taking account of the predicted requests when determining a processing schedule.

摘要翻译： 提供了用于调度存储输入和/或输出（I / O）请求的方法，装置和计算机程序。 一种用于调度存储访问请求的方法确定了一个请求处理序列，该请求处理序列被计算为使处理多个请求可实现的基于SLA的收入最大化。 存储控制器包括执行基于收益的调度功能以确定收益最大化处理序列的调度器，然后将存储访问请求分配给与所确定的序列相对应的队列中的位置。 在在线模式中，调度器可以适应附加的接收到的请求，评估附加请求的收入功能并且如果需要则修改调度。 该方法可以包括分析请求流以预测在不久的将来可能被接收的请求，并且在确定处理调度时考虑预测的请求。

公开(公告)号：US07725441B2

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

申请号：US11953115

申请日：2007-12-10

申请人： Srinivasan Balasubramanian ,  Tushar Mohan ,  Roberto C. Pineiro ,  Rohit Jain ,  Ramani R. Routray ,  Gauri Shah ,  Akshat Verma ,  Kaladhar Voruganti

发明人： Srinivasan Balasubramanian ,  Tushar Mohan ,  Roberto C. Pineiro ,  Rohit Jain ,  Ramani R. Routray ,  Gauri Shah ,  Akshat Verma ,  Kaladhar Voruganti

IPC分类号： G06F17/30

CPC分类号： G06F11/20

摘要： Formulating an integrated disaster recovery (DR) plan based upon a plurality of DR requirements for an application by receiving a first set of inputs identifying one or more entity types for which the plan is to be formulated, such as an enterprise, one or more sites of the enterprise, the application, or a particular data type for the application. At least one data container representing a subset of data for an application is identified. A second set of inputs is received identifying at least one disaster type for which the plan is to be formulated. A third set of inputs is received identifying a DR requirement for the application as a category of DR Quality of Service (QoS) class to be applied to the disaster type. A composition model is generated specifying one or more respective DR QoS parameters as a function of a corresponding set of one or more QoS parameters representative of a replication technology solution. The replication technology solution encompasses a plurality of storage stack levels. A solution template library is generated for mapping the application to each of a plurality of candidate replication technology solutions. The template library is used to select a DR plan in the form of a replication technology solution for the application.

摘要翻译： 基于针对应用的多个DR需求来制定综合灾难恢复（DR）计划，所述DR要求通过接收标识要为其制定所述计划的一个或多个实体类型的第一组输入，诸如企业，一个或多个站点 的应用程序，或应用程序的特定数据类型。 识别表示应用程序的数据子集的至少一个数据容器。 接收第二组输入，确定要制定该计划的至少一种灾害类型。 接收到第三组输入，将应用程序的DR要求标识为要应用于灾难类型的DR服务质量（QoS）类别。 生成指定作为代表复制技术解决方案的一个或多个QoS参数的相应组的函数的一个或多个相应DR QoS参数的组合模型。 复制技术解决方案包含多个存储堆栈级别。 生成解决方案模板库，用于将应用程序映射到多个候选复制技术解决方案中的每一个。 模板库用于以应用程序的复制技术解决方案的形式选择DR计划。

公开(公告)号：US07565484B2

公开(公告)日：2009-07-21

申请号：US11776578

申请日：2007-07-12

申请人： Sugata Ghosal ,  Rohit Jain ,  Akshat Verma

发明人： Sugata Ghosal ,  Rohit Jain ,  Akshat Verma

IPC分类号： G06F12/00

CPC分类号： G06F3/0632 ,  G06F3/0611 ,  G06F3/067 ,  G06Q10/06 ,  G06Q30/02

摘要： Provided are methods, apparatus arid computer programs for scheduling storage input and/or output (I/O) requests. A method for scheduling storage access requests determines a request processing sequence calculated to maximize SLA-based revenues achievable from processing a number of requests. A storage controller includes a scheduler which implements a revenue-based scheduling function to determine a revenue-maximizing processing sequence, and then assigns storage access requests to locations in a queue corresponding to the determined sequence. In an on-line mode, the scheduler can adapt to additional received requests, evaluating the revenue function for the additional requests and modifying the schedule if required. The method may include analyzing a request stream to predict requests that are likely to be received in the near future, and taking account of the predicted requests when determining a processing schedule.

摘要翻译： 提供了用于调度存储输入和/或输出（I / O）请求的方法，装置和计算机程序。 一种用于调度存储访问请求的方法确定了一个请求处理序列，该请求处理序列被计算为使处理多个请求可实现的基于SLA的收入最大化。 存储控制器包括执行基于收益的调度功能以确定收益最大化处理序列的调度器，然后将存储访问请求分配给与所确定的序列相对应的队列中的位置。 在在线模式中，调度器可以适应附加的接收到的请求，评估附加请求的收入功能并且如果需要则修改调度。 该方法可以包括分析请求流以预测在不久的将来可能被接收的请求，并且在确定处理调度时考虑预测的请求。

公开(公告)号：US20090150712A1

公开(公告)日：2009-06-11

申请号：US12126487

申请日：2008-05-23

申请人： Srinivasan Balasubramanian ,  Tushar Mohan ,  Roberto C. Pineiro ,  Rohit Jain ,  Ramani R. Routray ,  Gauri Shah ,  Akshat Verma ,  Kaladhar Voruganti

发明人： Srinivasan Balasubramanian ,  Tushar Mohan ,  Roberto C. Pineiro ,  Rohit Jain ,  Ramani R. Routray ,  Gauri Shah ,  Akshat Verma ,  Kaladhar Voruganti

IPC分类号： G06F11/00

CPC分类号： G06F11/20

摘要： Formulating an integrated disaster recovery (DR) plan based upon a plurality of DR requirements for an application by receiving a first set of inputs identifying one or more entity types for which the plan is to be formulated, such as an enterprise, one or more sites of the enterprise, the application, or a particular data type for the application. At least one data container representing a subset of data for an application is identified. A second set of inputs is received identifying at least one disaster type for which the plan is to be formulated. A third set of inputs is received identifying a DR requirement for the application as a category of DR Quality of Service (QoS) class to be applied to the disaster type. A composition model is generated specifying one or more respective DR QoS parameters as a function of a corresponding set of one or more QoS parameters representative of a replication technology solution. The replication technology solution encompasses a plurality of storage stack levels. A solution template library is generated for mapping the application to each of a plurality of candidate replication technology solutions. The template library is used to select a DR plan in the form of a replication technology solution for the application.

摘要翻译： 基于针对应用的多个DR需求来制定综合灾难恢复（DR）计划，所述DR要求通过接收标识要为其制定所述计划的一个或多个实体类型的第一组输入，诸如企业，一个或多个站点 的应用程序，或应用程序的特定数据类型。 识别表示应用程序的数据子集的至少一个数据容器。 接收第二组输入，确定要制定该计划的至少一种灾害类型。 接收到第三组输入，将应用程序的DR要求标识为要应用于灾难类型的DR服务质量（QoS）类别。 生成指定作为代表复制技术解决方案的一个或多个QoS参数的相应组的函数的一个或多个相应DR QoS参数的组合模型。 复制技术解决方案包含多个存储堆栈级别。 生成解决方案模板库，用于将应用程序映射到多个候选复制技术解决方案中的每一个。 模板库用于以应用程序的复制技术解决方案的形式选择DR计划。