利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

59 条记录 (耗时 0.04 秒)

    Minimizing storage power consumption
    32.
    发明授权
    Minimizing storage power consumption 有权
    最大限度地减少存储功耗

    公开(公告)号：US08683250B2

    公开(公告)日：2014-03-25

    申请号：US12491495

    申请日：2009-06-25

    申请人： Tapan K. Nayak ,  Akshat Verma

    发明人： Tapan K. Nayak ,  Akshat Verma

    IPC分类号： G06F1/00

    CPC分类号： G06F3/0634 ,  G06F3/0625 ,  G06F3/0631 ,  G06F3/0689 ,  Y02D10/154

    摘要： Techniques for minimizing storage power consumption are provided. The techniques include generating one or more physical storage volumes and one virtual storage volume for each physical storage volume, creating a mapping from virtual storage volumes to physical storage volumes, determining input/output (I/O) access behavior of one or more applications using statistical analysis, and re-mapping the virtual to physical volume mapping based on the determined I/O access behavior of the one or more applications to minimize storage power consumption while meeting a required performance.

    摘要翻译： 提供了最小化存储功耗的技术。 这些技术包括为每个物理存储卷生成一个或多个物理存储卷和一个虚拟存储卷，创建从虚拟存储卷到物理存储卷的映射，确定一个或多个应用程序的输入/输出（I / O）访问行为 统计分析，并且基于所确定的一个或多个应用的​​I / O访问行为重新映射虚拟到物理卷映射，以在满足所需性能的同时最小化存储功耗。

    Method and system for automated integrated server-network-storage disaster recovery planning
    34.
    发明授权
    Method and system for automated integrated server-network-storage disaster recovery planning 有权
    自动化综合服务器网络存储灾难恢复规划方法与系统

    公开(公告)号：US08121966B2

    公开(公告)日：2012-02-21

    申请号：US12134152

    申请日：2008-06-05

    申请人： Ramani Ranjan Routray ,  Upendra Sharma ,  Sandeep Madhav Uttamchandani ,  Akshat Verma

    发明人： Ramani Ranjan Routray ,  Upendra Sharma ,  Sandeep Madhav Uttamchandani ,  Akshat Verma

    IPC分类号： G06F17/00 ,  G06N5/02

    CPC分类号： G06N5/04

    摘要： An automated disaster recovery (DR) planning system for a computing environment is provided. A discovery module discovers servers, networks, and storage devices in a computing environment. An expert knowledge base module captures best practices in planning, and capabilities, interoperability, limitation and boundary values for different DR technologies. A match-making module determines multiple DR plans as combinations of one or more replication technologies that can be used to satisfy DR requirements. And, an optimizer configured for assessing a feasible DR plan from said multiple DR plans, to deploy for DR planning of a primary computing environment.

    摘要翻译： 提供了一种用于计算环境的自动化灾难恢复（DR）规划系统。 发现模块在计算环境中发现服务器，网络和存储设备。 专家知识库模块捕获不同DR技术的规划和功能，互操作性，限制和边界值的最佳实践。 匹配模块将多个DR计划确定为可用于满足DR要求的一个或多个复制技术的组合。 并且，优化器被配置用于从所述多个DR计划评估可行的DR计划，以部署用于主计算环境的DR规划。

    METHOD AND SYSTEM FOR PLACEMENT OF LOGICAL DATA STORES TO MINIMIZE REQUEST RESPONSE TIME
    36.
    发明申请
    METHOD AND SYSTEM FOR PLACEMENT OF LOGICAL DATA STORES TO MINIMIZE REQUEST RESPONSE TIME 审中-公开
    用于放置逻辑数据存储的方法和系统，以最小化请求响应时间

    公开(公告)号：US20090019222A1

    公开(公告)日：2009-01-15

    申请号：US12056591

    申请日：2008-03-27

    申请人： Akshat Verma ,  Ashok Anand

    发明人： Akshat Verma ,  Ashok Anand

    IPC分类号： G06F12/08

    CPC分类号： G06F3/0611 ,  G06F3/0631 ,  G06F3/0689 ,  G06F2206/1012

    摘要： Logical data stores are placed on storages to minimize store request time. The stores are sorted. A store counter and a storage counter are each set to one. (A), (B), and (C) are repeated until the storage counter exceeds the number of storages within the array. (A) is setting a load for the storage specified by the storage counter to zero. (B) is performing (i), (ii), and (iii) while the load for the storage specified by the storage counter is less an average determined load over all the storages. (i) is allocating the store specified by the store counter to the storage specified by the storage counter; and, (ii) is incrementing the load for this storage by this storage's request arrival rate multiplied by an expected service time for the requests of this store. (iii) is incrementing the store counter by one. (C) is incrementing the storage counter by one.

    摘要翻译： 逻辑数据存储放置在存储器上以最小化存储请求时间。 商店被排序。 存储计数器和存储计数器各自设置为1。 （A），（B）和（C），直到存储计数器超过阵列内的存储数量。 （A）将存储计数器指定的存储负载设置为零。 （B）正在执行（i），（ii）和（iii），而由存储计数器指定的存储负载小于所有存储器的平均确定负载。 （i）将由商店计数器指定的商店分配给由存储柜台指定的存储器; 并且，（ii）通过该存储器的请求到达率乘以本商店的请求的预期服务时间来增加该存储的负载。 （iii）将商店柜台递增1。 （C）将存储计数器递增1。

    Methods, apparatus and computer programs for scheduling storage requests
    37.
    发明授权
    Methods, apparatus and computer programs for scheduling storage requests 失效
    用于调度存储请求的方法，装置和计算机程序

    公开(公告)号：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的收入最大化。 存储控制器包括执行基于收益的调度功能以确定收益最大化处理序列的调度器，然后将存储访问请求分配给与所确定的序列相对应的队列中的位置。 在在线模式中，调度器可以适应附加的接收到的请求，评估附加请求的收入功能并且如果需要则修改调度。 该方法可以包括分析请求流以预测在不久的将来可能被接收的请求，并且在确定处理调度时考虑预测的请求。

    Method and system for placement of logical data stores to minimize request response time
    38.
    发明授权
    Method and system for placement of logical data stores to minimize request response time 有权
    用于放置逻辑数据存储的方法和系统以最小化请求响应时间

    公开(公告)号：US09223504B2

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

    申请号：US12056591

    申请日：2008-03-27

    申请人： Akshat Verma ,  Ashok Anand

    发明人： Akshat Verma ,  Ashok Anand

    IPC分类号： G06F12/02 ,  G06F3/06

    CPC分类号： G06F3/0611 ,  G06F3/0631 ,  G06F3/0689 ,  G06F2206/1012

    摘要： Logical data stores are placed on storages to minimize store request time. The stores are sorted. A store counter and a storage counter are each set to one. (A), (B), and (C) are repeated until the storage counter exceeds the number of storages within the array. (A) is setting a load for the storage specified by the storage counter to zero. (B) is performing (i), (ii), and (iii) while the load for the storage specified by the storage counter is less an average determined load over all the storages. (i) is allocating the store specified by the store counter to the storage specified by the storage counter; and, (ii) is incrementing the load for this storage by this storage's request arrival rate multiplied by an expected service time for the requests of this store. (iii) is incrementing the store counter by one. (C) is incrementing the storage counter by one.

    摘要翻译： 逻辑数据存储放置在存储器上以最小化存储请求时间。 商店被排序。 存储计数器和存储计数器各自设置为1。 （A），（B）和（C），直到存储计数器超过阵列内的存储数量。 （A）将存储计数器指定的存储负载设置为零。 （B）正在执行（i），（ii）和（iii），而由存储计数器指定的存储负载小于所有存储器的平均确定负载。 （i）将由商店计数器指定的商店分配给由存储柜台指定的存储器; 并且，（ii）通过该存储器的请求到达率乘以本商店的请求的预期服务时间来增加该存储的负载。 （iii）将商店柜台递增1。 （C）将存储计数器递增1。

    Recovery point identification in CDP environments
    39.
    发明授权
    Recovery point identification in CDP environments 失效
    CDP环境中的恢复点识别

    公开(公告)号：US07877360B2

    公开(公告)日：2011-01-25

    申请号：US12014120

    申请日：2008-01-15

    申请人： Jain Rohit ,  Ramani R. Routray ,  Akshat Verma ,  Kaladhar Voruganti

    发明人： Jain Rohit ,  Ramani R. Routray ,  Akshat Verma ,  Kaladhar Voruganti

    IPC分类号： G06F7/00

    CPC分类号： G06F11/1471 ,  G06F11/1469

    摘要： The embodiments of the invention provide a method of identifying a recovery point in a continuous data protection (CDP) log. More specifically, the method begins by detecting corrupted data in the CDP log and identifying the nature of corruption. Next, the nature of corruption is mapped to applications to identify components that may have caused the corrupted data. The method then finds a time instance of uncorrupted data in the components. Specifically, this can include searching CDP log entries in an order independent of log event age. Alternatively, the process of finding the time instance can include creating a data image of a first copy of uncorrupted data and sequentially apply entries of the CDP log until the corrupted data is reached.

    摘要翻译： 本发明的实施例提供了一种识别连续数据保护（CDP）日志中的恢复点的方法。 更具体地说，该方法开始于检测CDP日志中的损坏的数据并识别腐败的性质。 接下来，将腐败的性质映射到应用程序，以识别可能导致损坏的数据的组件。 该方法然后在组件中找到未被破坏的数据的时间实例。 具体来说，这可以包括以独立于日志事件年龄的顺序搜索CDP日志条目。 或者，查找时间实例的过程可以包括创建未损坏数据的第一副本的数据映像，并且顺序地应用CDP日志的条目，直到到达损坏的数据。

    MINIMIZING STORAGE POWER CONSUMPTION
    40.
    发明申请
    MINIMIZING STORAGE POWER CONSUMPTION 有权
    最小化存储功耗

    公开(公告)号：US20100332882A1

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

    申请号：US12491495

    申请日：2009-06-25

    申请人： Tapan K. Nayak ,  Akshat Verma

    发明人： Tapan K. Nayak ,  Akshat Verma

    IPC分类号： G06F1/32 ,  G06F12/00

    CPC分类号： G06F3/0634 ,  G06F3/0625 ,  G06F3/0631 ,  G06F3/0689 ,  Y02D10/154

    摘要： Techniques for minimizing storage power consumption are provided. The techniques include generating one or more physical storage volumes and one virtual storage volume for each physical storage volume, creating a mapping from virtual storage volumes to physical storage volumes, determining input/output (I/O) access behavior of one or more applications using statistical analysis, and re-mapping the virtual to physical volume mapping based on the determined I/O access behavior of the one or more applications to minimize storage power consumption while meeting a required performance.

    摘要翻译： 提供了最小化存储功耗的技术。 这些技术包括为每个物理存储卷生成一个或多个物理存储卷和一个虚拟存储卷，创建从虚拟存储卷到物理存储卷的映射，确定一个或多个应用程序的输入/输出（I / O）访问行为 统计分析，并且基于所确定的一个或多个应用的​​I / O访问行为重新映射虚拟到物理卷映射，以在满足所需性能的同时最小化存储功耗。