利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

38 条记录 (耗时 0.031 秒)

    COMPRESSED CACHE IN A CONTROLLER PARTITION
    1.
    发明申请
    COMPRESSED CACHE IN A CONTROLLER PARTITION 审中-公开
    控制器分区中的压缩缓存

    公开(公告)号：US20090210622A1

    公开(公告)日：2009-08-20

    申请号：US12033271

    申请日：2008-02-19

    申请人： Stefan Birrer ,  David Dardin Chambliss ,  Binny Sher Gill ,  Matthew Joseph Kalos ,  Prashant Pandey

    发明人： Stefan Birrer ,  David Dardin Chambliss ,  Binny Sher Gill ,  Matthew Joseph Kalos ,  Prashant Pandey

    IPC分类号： G06F12/00

    CPC分类号： G06F12/0866 ,  G06F2212/401

    摘要： A method of extending functionality of a data storage facility by adding to the primary storage system new functions using extension function subsystems is disclosed. One example of extending the functionality includes compressing and caching data in a data storage facility to improve storage and access performance of the data storage facility. A primary storage system queries a data storage extension system for availability of data tracks. If the primary storage system does not receive a response or the data tracks from the data storage extension system, it continues caching by fetching data tracks from a disk storage system. The storage extension system manages compression/decompression of data tracks in response to messages from the primary storage system. Data tracks transferred from the data storage extension system to the primary storage system are marked as stale at the data storage extension system and are made available for deletion.

    摘要翻译： 公开了一种通过向主存储系统添加使用扩展功能子系统的新功能来扩展数据存储设备的功能的方法。 扩展功能的一个示例包括在数据存储设施中压缩和缓存数据，以改善数据存储设施的存储和访问性能。 主存储系统查询数据存储扩展系统以获取数据轨道的可用性。 如果主存储系统没有从数据存储扩展系统接收到响应或数据跟踪，则它通过从磁盘存储系统获取数据轨迹来继续缓存。 存储扩展系统响应于来自主存储系统的消息来管理数据轨道的压缩/解压缩。 从数据存储扩展系统传输到主存储系统的数据轨迹在数据存储扩展系统中被标记为陈旧，并且可用于删除。

    Vector throttling to control resource use in computer systems
    2.
    发明授权
    Vector throttling to control resource use in computer systems 失效
    矢量节流控制计算机系统中的资源使用

    公开(公告)号：US08473960B2

    公开(公告)日：2013-06-25

    申请号：US12889741

    申请日：2010-09-24

    申请人： David D. Chambliss ,  Prashant Pandey

    发明人： David D. Chambliss ,  Prashant Pandey

    IPC分类号： G06F9/46 ,  G06F15/173 ,  G06F17/00

    CPC分类号： G06F9/5083

    摘要： Embodiments are provided for managing the system performance of resources performing tasks in response to task requests from tenants. In one aspect, a system that comprises at least one resource configured to perform at least one admitted task with an impact under the control of a computer system. The computer system provides services to more than one tenant. The computer system comprises a strategist configured to assess the impact of the admitted task to create a cost function vector containing multiple cost function specifications and a budget policy vector containing multiple budget policies and an actuator. The actuator receives the cost function vector and the budget policy vector from the strategist, receives a task request one of the more than one tenants, and calculates cost functions based upon the cost function vector to predict the impact of the task request on the resources for each of the task requests. The actuator throttles the task requests based upon the budget policies for the impact on the resources to create at least one of the admitted task performed by the resource and a delayed task request.

    摘要翻译： 提供实施例以响应于来自租户的任务请求来管理执行任务的资源的系统性能。 在一个方面，一种系统，其包括被配置为在计算机系统的控制下执行具有冲击的至少一个允许的任务的至少一个资源。 计算机系统为多个租户提供服务。 计算机系统包括策略师，其被配置为评估所允许的任务的影响以创建包含多个成本函数规范的成本函数向量和包含多个预算策略的预算策略向量和执行器。 执行器从策略者接收成本函数向量和预算策略向量，接收多个租户中的一个租户的任务请求，并根据成本函数向量计算成本函数，以预测任务请求对资源的影响 每个任务请求。 执行器基于预算政策来阻碍任务请求，以对资源产生影响，以创建资源执行的至少一个被允许的任务和延迟的任务请求。

    Stable adaptive replacement cache processing
    6.
    发明授权
    Stable adaptive replacement cache processing 失效
    稳定的自适应替换缓存处理

    公开(公告)号：US08612689B2

    公开(公告)日：2013-12-17

    申请号：US13541430

    申请日：2012-07-03

    申请人： James Allen Larkby-Lahet ,  Prashant Pandey

    发明人： James Allen Larkby-Lahet ,  Prashant Pandey

    IPC分类号： G06F12/00 ,  G06F13/00 ,  G06F13/28

    CPC分类号： G06F12/126 ,  G06F12/0888 ,  G06F12/122

    摘要： A process for caching data in a cache memory includes upon detecting that a first page is in a first or second list, the first page is moved to a most recently used (MRU) position in the second list. Upon detecting that the first page is in a first history list, a first target size is updated to a second target size for the first and second lists, the first page is moved from the first history list to the MRU position in the second list, and the first page is fetched to the cache memory. Upon detecting that the first page is in a second history list, the second target size is updated to a third target size for the first and second lists, and the first page is moved from the second history list to the MRU position in the second list.

    摘要翻译： 用于缓存高速缓冲存储器中的数据的过程包括在检测到第一页面处于第一或第二列表中时，第一页面被移动到第二列表中的最近使用（MRU）位置。 在检测到第一页面处于第一历史列表中时，第一目标尺寸被更新为第一和第二列表的第二目标尺寸，第一页从第一历史列表移动到第二列表中的MRU位置， 并且第一页被提取到高速缓冲存储器。 在检测到第一页面处于第二历史列表中时，第二目标尺寸被更新为第一和第二列表的第三目标尺寸，并且第一页面从第二历史列表移动到第二列表中的MRU位置 。

    STABLE ADAPTIVE REPLACEMENT CACHE PROCESSING
    7.
    发明申请
    STABLE ADAPTIVE REPLACEMENT CACHE PROCESSING 失效
    稳定的自适应替换缓存处理

    公开(公告)号：US20120272010A1

    公开(公告)日：2012-10-25

    申请号：US13541430

    申请日：2012-07-03

    申请人： James Allen Larkby-Lahet ,  Prashant Pandey

    发明人： James Allen Larkby-Lahet ,  Prashant Pandey

    IPC分类号： G06F12/12

    CPC分类号： G06F12/126 ,  G06F12/0888 ,  G06F12/122

    摘要： A process for caching data in a cache memory includes upon detecting that a first page is in a first or second list, the first page is moved to a most recently used (MRU) position in the second list. Upon detecting that the first page is in a first history list, a first target size is updated to a second target size for the first and second lists, the first page is moved from the first history list to the MRU position in the second list, and the first page is fetched to the cache memory. Upon detecting that the first page is in a second history list, the second target size is updated to a third target size for the first and second lists, and the first page is moved from the second history list to the MRU position in the second list.

    摘要翻译： 用于缓存高速缓冲存储器中的数据的过程包括在检测到第一页面处于第一或第二列表中时，第一页面被移动到第二列表中的最近使用（MRU）位置。 在检测到第一页面处于第一历史列表中时，第一目标尺寸被更新为第一和第二列表的第二目标尺寸，第一页从第一历史列表移动到第二列表中的MRU位置， 并且第一页被提取到高速缓冲存储器。 在检测到第一页面处于第二历史列表中时，第二目标尺寸被更新为第一和第二列表的第三目标尺寸，并且第一页面从第二历史列表移动到第二列表中的MRU位置 。

    VECTOR THROTTLING TO CONTROL RESOURCE USE IN COMPUTER SYSTEMS
    8.
    发明申请
    VECTOR THROTTLING TO CONTROL RESOURCE USE IN COMPUTER SYSTEMS 失效
    矢量图控制计算机系统中的资源使用

    公开(公告)号：US20120079492A1

    公开(公告)日：2012-03-29

    申请号：US12889741

    申请日：2010-09-24

    申请人： David D. Chambliss ,  Prashant Pandey

    发明人： David D. Chambliss ,  Prashant Pandey

    IPC分类号： G06F9/50

    CPC分类号： G06F9/5083

    摘要： Embodiments are provided for managing the system performance of resources performing tasks in response to task requests from tenants. In one aspect, a system that comprises at least one resource configured to perform at least one admitted task with an impact under the control of a computer system. The computer system provides services to more than one tenant. The computer system comprises a strategist configured to assess the impact of the admitted task to create a cost function vector containing multiple cost function specifications and a budget policy vector containing multiple budget policies and an actuator. The actuator receives the cost function vector and the budget policy vector from the strategist, receives a task request one of the more than one tenants, and calculates cost functions based upon the cost function vector to predict the impact of the task request on the resources for each of the task requests. The actuator throttles the task requests based upon the budget policies for the impact on the resources to create at least one of the admitted task performed by the resource and a delayed task request.

    摘要翻译： 提供实施例以响应于来自租户的任务请求来管理执行任务的资源的系统性能。 在一个方面，一种系统，其包括被配置为在计算机系统的控制下执行具有冲击的至少一个允许的任务的至少一个资源。 计算机系统为多个租户提供服务。 计算机系统包括策略师，其被配置为评估所允许的任务的影响以创建包含多个成本函数规范的成本函数向量和包含多个预算策略的预算策略向量和执行器。 执行器从策略者接收成本函数向量和预算策略向量，接收多个租户中的一个租户的任务请求，并根据成本函数向量计算成本函数，以预测任务请求对资源的影响 每个任务请求。 执行器基于预算政策来阻碍任务请求，以对资源产生影响，以创建资源执行的至少一个被允许的任务和延迟的任务请求。

    METHOD AND APPARATUS FOR OPTIMIZING DATA ALLOCATION
    9.
    发明申请
    METHOD AND APPARATUS FOR OPTIMIZING DATA ALLOCATION 有权
    优化数据分配的方法和装置

    公开(公告)号：US20120054429A1

    公开(公告)日：2012-03-01

    申请号：US12871970

    申请日：2010-08-31

    申请人： Karan Gupta ,  Reshu Jain ,  Prashant Pandey ,  Himabindu Pucha

    发明人： Karan Gupta ,  Reshu Jain ,  Prashant Pandey ,  Himabindu Pucha

    IPC分类号： G06F12/02 ,  G06F12/16 ,  G06F12/00

    CPC分类号： G06F3/0631 ,  G06F3/0604 ,  G06F3/064 ,  G06F3/067

    摘要： Embodiments of the invention relate to block layout and block allocation in a file system to support write transactions. Regions in a cluster file system are defined to support a block allocation, include both write affinity and wide striping region. An allocation map is maintained to define and support the block allocation regions. For each write transaction, a copy of data is written to both regions, and in the event there is a shortage of blocks in one of the regions, at least one block in the other region is dynamically converted to support the write transaction.

    摘要翻译： 本发明的实施例涉及文件系统中的块布局和块分配以支持写入事务。 定义集群文件系统中的区域以支持块分配，包括写入亲和度和宽条带区域。 维护分配图以定义和支持块分配区域。 对于每个写入事务，数据的副本被写入两个区域，并且在其中一个区域中存在块的不足的情况下，另一个区域中的至少一个块被动态转换以支持写入事务。

    Read-modify-write protocol for maintaining parity coherency in a write-back distributed redundancy data storage system
    10.
    发明授权
    Read-modify-write protocol for maintaining parity coherency in a write-back distributed redundancy data storage system 有权
    用于在写回分布式冗余数据存储系统中维持奇偶校验一致性的读 - 修改 - 写协议

    公开(公告)号：US08103903B2

    公开(公告)日：2012-01-24

    申请号：US12710123

    申请日：2010-02-22

    申请人： James L. Hafner ,  Prashant Pandey ,  Tarun Thakur

    发明人： James L. Hafner ,  Prashant Pandey ,  Tarun Thakur

    IPC分类号： G06F11/00

    CPC分类号： G06F11/1076 ,  G06F11/1474 ,  G06F2211/1028 ,  G06F2211/1057

    摘要： Data storage reliability is maintained in a write-back distributed data storage system including multiple nodes, each node comprising a processor and an array of failure independent data storage devices. Information is stored as a set of stripes, each stripe including a collection of multiple data strips and associated parity strips, the stripes distributed across multiple corresponding primary data nodes and multiple corresponding parity nodes. A primary data node maintains the data strip holding a first copy of data, and each parity node maintains a parity strip holding a parity for the multiple data strips. A read-modify-write parity update protocol is performed for maintaining parity coherency, the primary data node driving parity coherency with its corresponding parity nodes, independently of other data nodes, in order to keep its relevant parity strips coherent.

    摘要翻译： 在包括多个节点的回写分布式数据存储系统中维持数据存储可靠性，每个节点包括处理器和故障独立数据存储设备的阵列。 信息被存储为一组条带，每个条带包括多个数据条带和相关联的奇偶校验条的集合，条带分布在多个对应的主数据节点和多个对应的奇偶校验节点上。 主数据节点保持数据带保持数据的第一副本，并且每个奇偶校验节点维持保持多个数据条的奇偶校验的奇偶校验条。 执行读 - 修改 - 写奇偶校验更新协议以维持奇偶校验一致性，主数据节点与其对应的奇偶校验节点驱动奇偶校验一致性，独立于其他数据节点，以便保持其相关奇偶校验条相符。