利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

148 条记录 (耗时 0.031 秒)

    Increased destaging efficiency by smoothing destaging between current and desired number of destage tasks
    2.
    发明授权
    Increased destaging efficiency by smoothing destaging between current and desired number of destage tasks 有权
    通过平滑目前和所需数量的目的任务之间的破坏来提高降落效率

    公开(公告)号：US09442847B2

    公开(公告)日：2016-09-13

    申请号：US13363092

    申请日：2012-01-31

    申请人： Michael T. Benhase ,  Lokesh M. Gupta ,  Roger G. Hathorn ,  Sonny E. Williams

    发明人： Michael T. Benhase ,  Lokesh M. Gupta ,  Roger G. Hathorn ,  Sonny E. Williams

    IPC分类号： G06F9/46 ,  G06F9/455 ,  G06F12/08 ,  G06F12/12

    CPC分类号： G06F12/0804 ,  G06F12/0868 ,  G06F12/121 ,  G06F2212/1024 ,  G06F2212/281 ,  G06F2212/312 ,  G06F2212/462

    摘要： Techniques for increased destaging efficiency by smoothing destaging tasks to reduce long input/output (I/O) read operations are described. A system may comprise a processor device operable in the computing storage environment. The processor device calculates a current number of the destaging tasks and calculates a desired number of the destaging tasks. The processor device smoothes the destaging of the of the destaging tasks between the desired number of the destaging tasks and the current number of the destaging tasks by accelerating the calculating of the current number of the destaging tasks and the desired number of the destaging tasks, according to either a time interval or a variable recomputed destaging task interval, for reaching the desired number of the destaging tasks by decrementing the current number of destaging tasks or incrementing the current number of destaging tasks.

    摘要翻译： 描述了通过平滑降级任务以减少长输入/输出（I / O）读取操作来提高降级效率的技术。 系统可以包括可在计算存储环境中操作的处理器设备。 处理器设备计算当前的目标数量并计算所需的数目的降级任务。 处理器设备通过加速计算当前数量的降级任务和期望数量的降级任务来平滑所需数目的目标任务数目与当前数量的目标任务之间的目标任务的分级，根据 到时间间隔或变量重新计算的降级任务间隔，以通过减少当前数量的降级任务或增加当前数量的降级任务来达到期望数量的降级任务。

    Assigning device adaptors and background tasks to use to copy source extents to target extents in a copy relationship
    3.
    发明授权
    Assigning device adaptors and background tasks to use to copy source extents to target extents in a copy relationship 有权
    分配设备适配器和后台任务以用于将源区域复制到复制关系中的目标区域

    公开(公告)号：US08972676B2

    公开(公告)日：2015-03-03

    申请号：US13016834

    申请日：2011-01-28

    申请人： Michael T. Benhase ,  Theresa M. Brown ,  Lokesh M. Gupta ,  Carol S. Mellgren

    发明人： Michael T. Benhase ,  Theresa M. Brown ,  Lokesh M. Gupta ,  Carol S. Mellgren

    IPC分类号： G06F12/00 ,  G06F3/06 ,  G06F11/14

    CPC分类号： G06F3/065 ,  G06F3/0617 ,  G06F3/0619 ,  G06F3/0631 ,  G06F3/0665 ,  G06F3/067 ,  G06F3/0689 ,  G06F11/1448 ,  G06F11/1456 ,  G06F11/1466

    摘要： Provided are a computer program product, system, and method for assigning device adaptors and background tasks to use to copy source extents to target extents in a copy relationship. A relation is provided of a plurality of source extents in source ranks to copy to a plurality of target extents in target ranks in the storage system. One target rank in the relation is used to determine an order in which the target ranks in the relation are selected to register for copying. For each selected target rank in the relation selected according to the determined order, an iteration of a registration operation is performed to register the selected target rank and a selected source rank copied to the selected target rank in the relation. The registration operation comprises indicating in a device adaptor assignment data structure a source device adaptor and target device adaptor to use to copy the selected rank to the selected target rank and adding an entry to a priority queue for the relation for the selected target rank. The selected source rank is copied to the selected target rank using as the source and target device adaptors indicated in the device adaptor assignment data structure for the selected target rank in response to processing the entry in the priority queue added to the priority queue for the selected target rank.

    摘要翻译： 提供了一种用于分配设备适配器和后台任务的计算机程序产品，系统和方法，用于将源区段复制到复制关系中的目标区域。 在源级别中提供多个源盘区的关系，以复制到存储系统中的目标队列中的多个目标盘区。 该关系中的一个目标等级用于确定选择该关系中的目标队列进行注册以进行复制的顺序。 对于根据确定的顺序选择的关系中的每个所选择的目标等级，执行注册操作的迭代以将所选择的目标等级和所选择的源等级复制到所述关系中的所选择的目标等级。 注册操作包括在设备适配器中指示数据结构指定源设备适配器和目标设备适配器以用于将所选择的等级复制到所选择的目标等级，并且将用于所选目标等级的关系的条目添加到优先级队列中。 响应于处理加入到所选择的优先级队列的优先级队列中的条目，使用作为所选择的目标等级的设备适配器分配数据结构中指示的源和目标设备适配器将所选择的源等级复制到所选择的目标等级， 目标等级。

    Periodic destages from inside and outside diameters of disks to improve read response time via traversal of a spatial ordering of tracks
    4.
    发明授权
    Periodic destages from inside and outside diameters of disks to improve read response time via traversal of a spatial ordering of tracks 有权
    通过圆盘的内部和外部直径定期运行，以通过遍历轨道的空间排序来提高读取响应时间

    公开(公告)号：US08838905B2

    公开(公告)日：2014-09-16

    申请号：US13299054

    申请日：2011-11-17

    申请人： Michael T. Benhase ,  Lokesh M. Gupta ,  Christopher J. Strauss ,  Will A. Wright

    发明人： Michael T. Benhase ,  Lokesh M. Gupta ,  Christopher J. Strauss ,  Will A. Wright

    IPC分类号： G06F12/00

    CPC分类号： G11B21/025 ,  G06F12/126

    摘要： A storage controller that includes a cache, receives a command from a host, wherein a set of criteria corresponding to read response times for executing the command have to be satisfied. A destage application that destages tracks based at least on recency of usage and spatial location of the tracks is executed, wherein a spatial ordering of the tracks is maintained in a data structure, and the destage application traverses the spatial ordering of the tracks. Tracks are destaged from at least inside or outside diameters of disks at periodic intervals, while traversing the spatial ordering of the tracks, wherein the set of criteria corresponding to the read response times for executing the command are satisfied.

    摘要翻译： 一种包括缓存的存储控制器，从主机接收命令，其中必须满足与用于执行命令的读取响应时间相对应的一组标准。 执行至少基于轨道的使用和空间位置的重新排列来追踪轨道的转移应用，其中，轨道的空间排序被保持在数据结构中，并且目的地应用遍历轨道的空间排序。 在穿过轨道的空间排序的同时，以周期性间隔从至少内部或外部直径的磁道中移动轨迹，其中满足与用于执行该命令的读取响应时间对应的一组标准。

    REPLICATING TRACKS FROM A FIRST STORAGE SITE TO A SECOND AND THIRD STORAGE SITES
    6.
    发明申请
    REPLICATING TRACKS FROM A FIRST STORAGE SITE TO A SECOND AND THIRD STORAGE SITES 有权
    将第一个存储站点的路由更改为第二个和第三个存储站点

    公开(公告)号：US20140075110A1

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

    申请号：US13612314

    申请日：2012-09-12

    申请人： Michael T. Benhase ,  Lokesh M. Gupta ,  Brian D. Hatfield ,  Gail A. Spear

    发明人： Michael T. Benhase ,  Lokesh M. Gupta ,  Brian D. Hatfield ,  Gail A. Spear

    IPC分类号： G06F12/16 ,  G06F12/08

    CPC分类号： G06F3/0619 ,  G06F3/0605 ,  G06F3/065 ,  G06F3/0665 ,  G06F3/067 ,  G06F3/0689 ,  G06F12/0866 ,  G06F12/0868 ,  G06F12/12 ,  G06F2212/262

    摘要： Provided are a computer program product, system, and method for replicating tracks from a first storage to a second and third storages. A determination is made of a track in the first storage to transfer to the second storage as part of a point-in-time copy relationship and of a stride of tracks including the target track. The stride of tracks including the target track is staged from the first storage to a cache according to the point-in-time copy relationship. The staged stride is destaged from the cache to the second storage. The stride in the cache is transferred to the third storage as part of a mirror copy relationship. The stride of tracks in the cache is demoted in response to destaging the stride of the tracks in the cache to the second storage and transferring the stride of tracks in the cache to the third storage.

    摘要翻译： 提供了一种用于将轨道从第一存储器复制到第二和第三存储器的计算机程序产品，系统和方法。 确定在第一存储器中的轨道作为时间点复制关系的一部分和包括目标轨道的轨迹的步幅传送到第二存储器。 根据时间点复制关系，将包含目标轨道的轨道的步幅从第一个存储器暂存到高速缓存。 分阶段的步伐已经从高速缓存迁移到第二个存储。 缓存中的步幅作为镜像复制关系的一部分传输到第三个存储。 响应于高速缓存中的轨道的步幅降级到第二存储器并且将高速缓存中的轨迹的步幅传送到第三存储器，缓存中的轨道的步幅被降级。

    Compression on thin provisioned volumes using extent based mapping
    7.
    发明授权
    Compression on thin provisioned volumes using extent based mapping 失效
    使用基于范围的映射压缩精简配置卷

    公开(公告)号：US08667180B2

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

    申请号：US13531925

    申请日：2012-06-25

    申请人： Michael T. Benhase ,  Binny S. Gill ,  Lokesh M. Gupta ,  Matthew J. Kalos ,  Gail A. Spear

    发明人： Michael T. Benhase ,  Binny S. Gill ,  Lokesh M. Gupta ,  Matthew J. Kalos ,  Gail A. Spear

    IPC分类号： G06F15/16

    CPC分类号： G06F3/064 ,  G06F3/0608 ,  G06F3/0613 ,  G06F3/067 ,  G06F12/0804 ,  G06F12/0868 ,  G06F2212/401

    摘要： For facilitating data compression, a set of logical extents, each having compressed logical tracks of data, is mapped to a head physical extent and, if the head physical extent is determined to have been filled, to at least one overflow extent having spatial proximity to the head physical extent. Pursuant to at least one subsequent write operation and destage operation, the at least one subsequent write operation and destage operation determined to be associated with the head physical extent, the write operation is mapped to one of the head physical extent, the at least one overflow extent, and an additional extent having spatial proximity to the at least one overflow extent.

    摘要翻译： 为了便于数据压缩，将具有压缩的数据的逻辑轨迹的一组逻辑盘区映射到头部物理范围，并且如果将头部物理范围确定为已经被填充到至少一个具有空间接近的溢出范围 头部物理范围。 根据至少一个随后的写入操作和终止操作，所述至少一个随后的写入操作和后退操作被确定为与所述头部物理范围相关联，所述写入操作被映射到所述头部物理范围中的一个，所述至少一个溢出 并且具有与至少一个溢出范围的空间接近的附加程度。

    Prefetching data tracks and parity data to use for destaging updated tracks
    8.
    发明授权
    Prefetching data tracks and parity data to use for destaging updated tracks 失效
    预取数据轨道和奇偶校验数据以用于降级更新的轨道

    公开(公告)号：US08631190B2

    公开(公告)日：2014-01-14

    申请号：US13189285

    申请日：2011-07-22

    申请人： Michael T. Benhase ,  Binny S. Gill ,  Lokesh M. Gupta ,  James L. Hafner

    发明人： Michael T. Benhase ,  Binny S. Gill ,  Lokesh M. Gupta ,  James L. Hafner

    IPC分类号： G06F13/10

    CPC分类号： G06F12/0868 ,  G06F12/0862 ,  G06F12/0897

    摘要： Provided are a computer program product, system, and method for prefetching data tracks and parity data to use for destaging updated tracks. A write request is received including at least one updated track to the group of tracks. The at least one updated track is stored in a first cache device. A prefetch request is sent to the at least one sequential access storage device to prefetch tracks in the group of tracks to a second cache device. A read request is generated to read the prefetch tracks following the sending of the prefetch request. The read prefetch tracks returned to the read request from the second cache device are stored in the first cache device. New parity data is calculated from the at least one updated track and the read prefetch tracks.

    摘要翻译： 提供了一种用于预取数据轨道和奇偶校验数据以用于降级更新的轨道的计算机程序产品，系统和方法。 接收包括至少一个更新的轨道到轨道组的写入请求。 所述至少一个更新的轨道存储在第一高速缓存设备中。 预取请求被发送到至少一个顺序访问存储设备以将轨道组中的轨道预取到第二高速缓存设备。 在发送预取请求之后，生成读取请求以读取预取轨迹。 从第二高速缓存设备返回到读取请求的读取预取轨迹存储在第一高速缓存设备中。 从所述至少一个更新的轨道和读取的预取轨迹计算新的奇偶校验数据。

    Systems and methods for managing cache destage scan times
    9.
    发明授权
    Systems and methods for managing cache destage scan times 失效
    用于管理缓存目的地扫描时间的系统和方法

    公开(公告)号：US08589623B2

    公开(公告)日：2013-11-19

    申请号：US13493786

    申请日：2012-06-11

    申请人： Brent C. Beardsley ,  Michael T. Benhase ,  Lokesh M. Gupta ,  Sonny E. Williams

    发明人： Brent C. Beardsley ,  Michael T. Benhase ,  Lokesh M. Gupta ,  Sonny E. Williams

    IPC分类号： G06F12/00

    CPC分类号： G06F12/0804 ,  G06F12/0859 ,  G06F12/0866

    摘要： A system includes a cache and a processor. The processor is configured to utilize a first thread to continually determine a desired scan time for scanning the plurality of storage tracks in the cache and utilize a second thread to continually control an actual scan time of the plurality of storage tracks in the cache based on the continually determined desired scan time. One method includes utilizing a first thread to continually determine a desired scan time for scanning the plurality of storage tracks in the cache and utilizing a second thread to continually control an actual scan time of the plurality of storage tracks in the cache based on the continually determined desired scan time.

    摘要翻译： 系统包括缓存和处理器。 处理器被配置为利用第一线程来连续地确定用于扫描高速缓存中的多个存储轨道的期望的扫描时间，并且利用第二线程基于所述缓存器来连续地控制多个存储轨道的实际扫描时间 持续确定所需的扫描时间。 一种方法包括利用第一线程来连续地确定用于扫描高速缓存中的多个存储轨道的期望的扫描时间，并且利用第二线程基于连续地确定的高速缓存中的多个存储轨道的实际扫描时间 所需的扫描时间。