会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明申请
    • METHODS, SYSTEMS, AND COMPUTER PROGRAM PRODUCTS FOR DISASTER RECOVERY PLANNING
    • 用于灾难恢复规划的方法,系统和计算机程序产品
    • US20090150712A1
    • 2009-06-11
    • US12126487
    • 2008-05-23
    • Srinivasan BalasubramanianTushar MohanRoberto C. PineiroRohit JainRamani R. RoutrayGauri ShahAkshat VermaKaladhar Voruganti
    • Srinivasan BalasubramanianTushar MohanRoberto C. PineiroRohit JainRamani R. RoutrayGauri ShahAkshat VermaKaladhar Voruganti
    • G06F11/00
    • 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计划。
    • 12. 发明申请
    • METHODS, APPARATUS AND COMPUTER PROGRAMS FOR SCHEDULING STROAGE REQUESTS
    • 方法,设备和计算机程序用于调度搜索请求
    • US20080016310A1
    • 2008-01-17
    • US11776578
    • 2007-07-12
    • Sugata GhosalRohit JainAkshat Verma
    • Sugata GhosalRohit JainAkshat Verma
    • G06F12/00
    • G06F3/0632G06F3/0611G06F3/067G06Q10/06G06Q30/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 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的收入最大化。 存储控制器包括执行基于收益的调度功能以确定收益最大化处理序列的调度器,然后将存储访问请求分配给与所确定的序列相对应的队列中的位置。 在在线模式中,调度器可以适应附加的接收到的请求,评估附加请求的收入功能并且如果需要则修改调度。 该方法可以包括分析请求流以预测在不久的将来可能被接收的请求,并且在确定处理调度时考虑预测的请求。
    • 13. 发明授权
    • Methods, systems, and computer program products for disaster recovery planning
    • 用于灾难恢复规划的方法,系统和计算机程序产品
    • US07945537B2
    • 2011-05-17
    • US12126487
    • 2008-05-23
    • Srinivasan BalasubramanianTushar MohanRoberto C. PineiroRohit JainRamani R. RoutrayGauri ShahAkshat VermaKaladhar Voruganti
    • Srinivasan BalasubramanianTushar MohanRoberto C. PineiroRohit JainRamani R. RoutrayGauri ShahAkshat VermaKaladhar Voruganti
    • G06F17/30
    • 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计划。
    • 14. 发明申请
    • Methods, apparatus and computer programs for scheduling storage requests
    • 用于调度存储请求的方法,装置和计算机程序
    • US20050289312A1
    • 2005-12-29
    • US10874857
    • 2004-06-23
    • Sugata GhosalRohit JainAkshat Verma
    • Sugata GhosalRohit JainAkshat Verma
    • G06F3/06G06F12/00G06Q10/00G06Q30/00
    • G06F3/0632G06F3/0611G06F3/067G06Q10/06G06Q30/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的收入最大化。 存储控制器包括执行基于收益的调度功能以确定收益最大化处理序列的调度器,然后将存储访问请求分配给与所确定的序列相对应的队列中的位置。 在在线模式中,调度器可以适应附加的接收到的请求,评估附加请求的收入功能并且如果需要则修改调度。 该方法可以包括分析请求流以预测在不久的将来可能被接收的请求,并且在确定处理调度时考虑预测的请求。
    • 19. 发明申请
    • TECHNIQUES FOR PLACING APPLICATIONS IN HETEROGENEOUS VIRTUALIZED SYSTEMS WHILE MINIMIZING POWER AND MIGRATION COST
    • 在最小化功率和移动成本的异构虚拟化系统中配置应用的技术
    • US20100180275A1
    • 2010-07-15
    • US12354072
    • 2009-01-15
    • Anindya NeogiAkshat Verma
    • Anindya NeogiAkshat Verma
    • G06F9/455G06F1/32
    • G06F1/3203G06F9/45558G06F2009/4557
    • N applications are placed on M virtualized servers having power management capability. A time horizon is divided into a plurality of time windows, and, for each given one of the windows, a placement of the N applications is computed, taking into account power cost, migration cost, and performance benefit. The migration cost refers to cost to migrate from a first virtualized server to a second virtualized server for the given one of the windows. The N applications are placed onto the M virtualized servers, for each of the plurality of time windows, in accordance with the placement computed in the computing step for each of the windows. In an alternative aspect, power cost and performance benefit, but not migration cost, are taken into account; there are a plurality of virtual machines; and the computing step includes, for each of the windows, determining a target utilization for each of the servers based on a power model for each given one of the servers; picking a given one of the servers with a least power increase per unit increase in capacity, until capacity has been allocated to fit all the virtual machines; and employing a first fit decreasing bin packing technique to compute placement of the applications on the virtualized servers.
    • N个应用程序放置在具有电源管理功能的M个虚拟化服务器上​​。 时间范围被分为多个时间窗口,并且对于每个给定的一个窗口,计算N个应用的放置,同时考虑功率成本,迁移成本和性能优点。 迁移成本是指从给定的一个窗口从第一个虚拟化服务器迁移到第二个虚拟化服务器的成本。 根据在每个窗口的计算步骤中计算的位置,将N个应用程序放置在M个虚拟化服务器中,用于多个时间窗口中的每一个。 在另一方面,考虑到电力成本和性能优势,但不是迁移成本; 有多个虚拟机; 并且所述计算步骤包括针对每个所述窗口,基于每个所述服务器中的每个服务器的功率模型确定每个所述服务器的目标利用率; 选择给定的一台服务器,每单位容量增加功率增加最少,直到容量分配到适合所有虚拟机为止; 并采用第一适合减少的bin打包技术来计算虚拟化服务器上​​的应用程序的布局。
    • 20. 发明申请
    • Method, system and computer program product for server selection, application placement and consolidation
    • 方法,系统和计算机程序产品,用于服务器选择,应用程序放置和整合
    • US20100005173A1
    • 2010-01-07
    • US12217439
    • 2008-07-03
    • Ramesh BaskaranSameep MehtaAnindya NeogiVinayaka D. PanditGyana Ranjan ParijaAkshat Verma
    • Ramesh BaskaranSameep MehtaAnindya NeogiVinayaka D. PanditGyana Ranjan ParijaAkshat Verma
    • G06F15/16
    • G06F9/5066
    • A plurality of application profiles are obtained, for a plurality of applications. Each of the profiles specifies a list of resources, and requirements for each of the resources, associated with a corresponding one of the applications. Specification of a plurality of constraints associated with the applications is facilitated, as is obtaining a plurality of cost models associated with at least two different kinds of servers on which the applications are to run. A recommended server configuration is generated for running the applications, by formulating and solving a bin packing problem. Each of the at least two different kinds of servers is treated as a bin of a different size, based on its capacity, and has an acquisition cost associated therewith. The size is substantially equal to a corresponding one of the resource requirement as given by a corresponding one of the application profiles. Each of the applications is treated as an item, with an associated size, to be packed into the bins. The bin packing problem develops the recommended server configuration based on reducing a total acquisition cost while satisfying the constraints and the sizes of the applications.
    • 获得多个应用简档,用于多个应用。 每个配置文件指定与相应应用程序相关联的资源列表和每个资源的要求。 促进与应用相关联的多个约束的规范,以及获得与要在其上运行应用的至少两种不同类型的服务器相关联的多个成本模型。 生成用于运行应用程序的推荐的服务器配置,通过制定和解决垃圾箱打包问题。 至少两种不同类型的服务器中的每一种基于其容量被视为不同尺寸的箱,并且具有与其相关联的购置成本。 该大小基本上等于由相应的一个应用简档给出的资源需求中相应的一个。 每个应用程序都被视为具有相关尺寸的项目,以将其打包到箱中。 垃圾箱打包问题在满足约束和应用程序的大小的基础上,降低了总采购成本,从而开发了推荐的服务器配置。