利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

181 条记录 (耗时 0.031 秒)

    Scanning modified data during power loss
    1.
    发明授权
    Scanning modified data during power loss 失效
    在掉电期间扫描修改后的数据

    公开(公告)号：US07260695B2

    公开(公告)日：2007-08-21

    申请号：US10795168

    申请日：2004-03-05

    申请人： Gary W. Batchelor ,  Michael T. Benhase ,  Carl E. Jones

    发明人： Gary W. Batchelor ,  Michael T. Benhase ,  Carl E. Jones

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

    CPC分类号： G06F11/1441 ,  G06F11/2015

    摘要： A back-up power source and a back-up storage device are utilized to power a processor and a volatile memory device during a primary power failure. An emergency data-storage algorithm is invoked to create a table of modified data analogous to data residing in a non-volatile memory device associated with a different processor. This table of modified data is written to the back-up storage device.

    摘要翻译： 在主电源故障期间，利用备用电源和备用存储设备为处理器和易失性存储器件供电。 调用紧急数据存储算法以创建类似于驻留在与不同处理器相关联的非易失性存储器设备中的数据的修改数据表。 修改后的数据表被写入备用存储设备。

    Efficient maintenance of memory list
    2.
    发明授权
    Efficient maintenance of memory list 失效
    高效维护内存列表

    公开(公告)号：US07376806B2

    公开(公告)日：2008-05-20

    申请号：US10991109

    申请日：2004-11-17

    申请人： Ronald J. Chapman ,  Gary W. Batchelor ,  Michael T. Benhase ,  Kenneth W. Todd

    发明人： Ronald J. Chapman ,  Gary W. Batchelor ,  Michael T. Benhase ,  Kenneth W. Todd

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

    CPC分类号： G06F11/1016 ,  G06F3/061 ,  G06F3/0619 ,  G06F3/0638

    摘要： Data management systems, such as used in disk control units, employ memory entry lists to help keep track of user data. Improved performance of entry list maintenance is provided by the present invention. Much of the protocol employed to conduct such maintenance is preferably performed by hardware-based logic, thereby freeing other system resources to execute other processes. New entries to the memory list are only allowed at predetermined addresses and entries are updated by writing a predetermined data pattern to a previously allocated address. Optionally, improved error detection, such as a longitudinal redundancy check, may also be performed in an efficient manner during entry list maintenance to assure the integrity of the list.

    摘要翻译： 诸如在磁盘控制单元中使用的数据管理系统使用存储器条目列表来帮助跟踪用户数据。 本发明提供了改进的入口表维护性能。 用于进行这种维护的协议中的大部分优选地通过基于硬件的逻辑执行，从而释放其他系统资源来执行其他进程。 存储器列表的新条目仅允许在预定地址处，并且通过将预定数据模式写入先前分配的地址来更新条目。 可选地，改进的错误检测（例如纵向冗余校验）也可以在进入列表维护期间以有效的方式执行，以确保列表的完整性。

    Handling high priority requests in a sequential access storage device having a non-volatile storage cache
    6.
    发明授权
    Handling high priority requests in a sequential access storage device having a non-volatile storage cache 有权
    在具有非易失性存储高速缓存的顺序存取存储设备中处理高优先权请求

    公开(公告)号：US08996789B2

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

    申请号：US13411159

    申请日：2012-03-02

    申请人： Michael T. Benhase ,  Lokesh M. Gupta

    发明人： Michael T. Benhase ,  Lokesh M. Gupta

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

    CPC分类号： G06F12/0804 ,  G06F12/0868 ,  G06F12/0897 ,  G06F2212/1016 ,  G06F2212/225 ,  G06F2212/285 ,  G06F2212/312

    摘要： Modified tracks for write requests to a sequential access storage medium in a sequential access storage device are cached in a non-volatile storage, which is a faster access device than the sequential access storage medium. A request queue includes destage requests to destage the modified tracks in the non-volatile storage device to the sequential access storage medium and read requests to access read requested tracks from the sequential access storage medium. A comparison is made of a current position of a read/write mechanism with respect to physical locations on the sequential access storage medium of the tracks subject to the destage requests indicated in the request queue. A determination is made of one of the destage requests to process based on the comparison. The modified track for the determined destage request is written from the non-volatile storage device to the sequential access storage medium.

    摘要翻译： 用于向顺序访问存储设备中的顺序访问存储介质的写请求的修改轨道被缓存在非易失性存储器中，该非易失性存储器是比顺序访问存储介质更快的访问设备。 请求队列包括将非易失性存储设备中的经修改的轨道去往顺序存取存储介质并读取从顺序访问存储介质访问读请求的轨道的请求的到达请求。 比较读/写机构相对于在请求队列中指示的流出请求的轨道的顺序存取介质上的物理位置的当前位置。 根据比较确定要处理的要求之一。 用于确定的流出请求的经修改的轨道从非易失性存储设备写入顺序存取存储介质。

    Populating a first stride of tracks from a first cache to write to a second stride in a second cache
    8.
    发明授权
    Populating a first stride of tracks from a first cache to write to a second stride in a second cache 有权
    从第一个高速缓冲存储器中填充轨迹的第一步，以写入第二个高速缓存中的第二个步幅

    公开(公告)号：US08966178B2

    公开(公告)日：2015-02-24

    申请号：US13352230

    申请日：2012-01-17

    申请人： Kevin J. Ash ,  Michael T. Benhase ,  Lokesh M. Gupta ,  Matthew J. Kalos ,  Karl A. Nielsen

    发明人： Kevin J. Ash ,  Michael T. Benhase ,  Lokesh M. Gupta ,  Matthew J. Kalos ,  Karl A. Nielsen

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

    CPC分类号： G06F12/0868 ,  G06F12/0804 ,  G06F12/0897 ,  G06F12/128 ,  G06F2212/262 ,  G06F2212/312 ,  G06F2212/462

    摘要： Provided are a computer program product, system, and method for managing data in a cache system comprising a first cache, a second cache, and a storage system. A determination is made of tracks stored in the storage system to demote from the first cache. A first stride is formed including the determined tracks to demote. A determination is made of a second stride in the second cache in which to include the tracks in the first stride. The tracks from the first stride are added to the second stride in the second cache. A determination is made of tracks in strides in the second cache to demote from the second cache. The determined tracks to demote from the second cache are demoted.

    摘要翻译： 提供了一种用于管理包括第一高速缓存，第二高速缓存和存储系统的高速缓存系统中的数据的计算机程序产品，系统和方法。 确定存储在存储系统中的轨道以从第一高速缓存降级。 形成第一步，包括确定的轨道降级。 确定在第二高速缓存中的第二步，其中包括在第一步中的轨道。 来自第一步的轨道被添加到第二缓存中的第二步。 确定第二高速缓存中的步幅中的轨迹以从第二高速缓存降级。 确定的从第二个缓存降级的轨迹将被降级。

    Writing of data of a first block size in a raid array that stores and mirrors data in a second block size
    10.
    发明授权
    Writing of data of a first block size in a raid array that stores and mirrors data in a second block size 有权
    在RAID阵列中写入第一个块大小的数据，该阵列数组以第二个块大小存储和镜像数据

    公开(公告)号：US08954668B2

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

    申请号：US13113562

    申请日：2011-05-23

    申请人： Michael T. Benhase ,  Akihiro Nose ,  Masaru Sugiura

    发明人： Michael T. Benhase ,  Akihiro Nose ,  Masaru Sugiura

    IPC分类号： G06F12/00 ,  G06F11/10

    CPC分类号： G06F12/00 ,  G06F3/061 ,  G06F3/064 ,  G06F3/0689 ,  G06F11/10 ,  G06F11/2087

    摘要： Data that is to be written is received, wherein the data is indicated in one or more blocks of a first block size. Each of the one or more blocks of the first block size is written in consecutive blocks of a second block size that is larger in size than the first block size, wherein each of the consecutive blocks of the second block size stores only one block of the first block size, and wherein each of the consecutive blocks of the second block size has empty space remaining, subsequent to the writing of each of the one or more blocks of the first block size. Filler data is written in the empty space remaining in each of the consecutive blocks of the second block size.

    摘要翻译： 接收要写入的数据，其中数据以第一块大小的一个或多个块指示。 第一块大小的一个或多个块中的每一个被写入尺寸大于第一块大小的第二块大小的连续块中，其中第二块大小的每个连续块只存储一个块 第一块大小，并且其中在写入第一块大小的一个或多个块中的每一个之后，其中第二块大小的每个连续块具有剩余的空间。 填充数据被写入剩余在第二块大小的每个连续块中的空白空间中。