利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

81 条记录 (耗时 0.035 秒)

    First responder parities for storage array
    31.
    发明授权
    First responder parities for storage array 有权

    公开(公告)号：US10572345B2

    公开(公告)日：2020-02-25

    申请号：US15819409

    申请日：2017-11-21

    申请人： International Business Machines Corporation

    发明人： Mario Blaum ,  Steven R. Hetzler

    IPC分类号： G06F11/10 ,  H03M13/37 ,  H03M13/15 ,  H03M13/29

    摘要： Embodiments relate to correcting erasures in a storage array. An aspect includes dividing data into a plurality of stripes for storage in a storage array comprising a plurality of storage locations, each stripe comprising M rows and N columns, each of the M rows including a number r of row parities, wherein r is greater than zero. Another aspect includes dividing each stripe into two or more column sets, each column set comprising a respective set of one or more columns of the stripe. Another aspect includes adding a respective first responder parity to each column set, wherein each first responder parity gives parity information for only the two or more columns in the first responder parity's respective column set.

    RECLAIMING FREE SPACE IN A STORAGE SYSTEM
    37.
    发明申请
    RECLAIMING FREE SPACE IN A STORAGE SYSTEM 审中-公开

    公开(公告)号：US20170235672A1

    公开(公告)日：2017-08-17

    申请号：US15042014

    申请日：2016-02-11

    申请人： International Business Machines Corporation

    发明人： Steven R. Hetzler ,  Wayne C. Hineman

    IPC分类号： G06F12/02

    CPC分类号： G06F3/0608 ,  G06F3/0652 ,  G06F3/067

    摘要： One embodiment provides a method for reclaiming free space. The method comprises selecting a first blob for reclamation from a first data center; sending a first message to a second data center indicating the first blob is to be reclaimed; sending a second message to the second data center after reclaiming the first blob; receiving a global reclamation complete message from the second data center; reading at least one data set from the first blob; and storing in a write buffer the at least one data set for encoding into a erasure code group in an alternative blob in the first data center. Further, upon receipt of the global reclamation message from the second data center, indicating the first blob is free in the map in the first data center. In one embodiment, selecting the first blob is based on the map indicating free space in the first data center.

    Time multiplexed redundant array of independent tapes
    39.
    发明授权
    Time multiplexed redundant array of independent tapes 有权
    独立磁带的时间复用冗余阵列

    公开(公告)号：US09495247B2

    公开(公告)日：2016-11-15

    申请号：US14524133

    申请日：2014-10-27

    申请人： International Business Machines Corporation

    发明人： Mario Blaum ,  Veera W. Deenadhayalan ,  Steven R. Hetzler ,  Wayne C. Hineman ,  Robert M. Rees ,  Pin Zhou

    IPC分类号： G06F11/10 ,  G06F3/06 ,  G11B20/12 ,  G11B20/10 ,  G11B20/18

    CPC分类号： G06F11/1076 ,  G06F3/0619 ,  G06F3/0644 ,  G06F3/0686 ,  G06F2211/1057 ,  G06F2211/108 ,  G11B20/10527 ,  G11B20/1833

    摘要： Embodiments relate to a computer system for storing data on a time multiplexed redundant array of independent tapes. An aspect includes a memory device that buffers data received by the computer system to be written to a set of tape data storage devices. The data is written to the set of tape data storage devices in blocks that form parity stripes across the set of tape data storage device. Aspects further includes a tape drive that writes data to one of the set of tape data storage devices at a time in a tape-sequential manner and a processor that computes a parity value for each of the parity stripes. The tape drive writes the parity values for each of the parity stripes to a last subset of tapes of the set of tape data storage devices.

    摘要翻译： 实施例涉及用于在独立磁带的时分复用冗余阵列上存储数据的计算机系统。 一个方面包括一个存储器装置，其缓冲由计算机系统接收的要写入一组磁带数据存储装置的数据。 数据被写入到在磁带数据存储设备集合上形成奇偶校验条带的块中的磁带数据存储设备集合。 方面还包括磁带驱动器，其以磁带顺序方式一次将数据写入到一组磁带数据存储设备中;以及处理器，其计算每个奇偶校验条带的奇偶校验值。 磁带驱动器将每个奇偶校验条带的奇偶校验值写入磁带数据存储设备集合的最后一个磁带子集。

    Codes of length tn invariant under rotations of order n
    40.
    发明授权
    Codes of length tn invariant under rotations of order n 有权
    长度tn的代码在n阶转动下不变

    公开(公告)号：US09454426B2

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

    申请号：US14324273

    申请日：2014-07-07

    申请人： International Business Machines Corporation

    发明人： John S. Best ,  Mario Blaum ,  Steven R. Hetzler

    IPC分类号： H03M13/11 ,  H03M13/00 ,  G06F11/10 ,  H03M13/03 ,  H03M13/13 ,  H03M13/29 ,  H03M13/19

    CPC分类号： G06F11/1004 ,  H03M13/033 ,  H03M13/13 ,  H03M13/136 ,  H03M13/19 ,  H03M13/29

    摘要： Embodiments include generating an error correction code by identifying two error-correcting codes of length n with minimum distances d and 2d, such that the second code is contained into the first code. Data is then encoded into t−1 blocks using the first code, and into the t-th block using the second block. The first t−1 encoded blocks are stored into t−1 blocks of memory locations, while the exclusive-OR (XOR) of such t−1 encoded blocks and the t-th encoded block is stored into a t-th block of memory location. The final encoded vector of length to is identified as belonging in a code with minimum distance 2d. Rotations of an encoded vector jn times are identified as belonging to the same equivalence class. A received vector or its rotations jn times can be successfully identified in the presence of up to d−1 errors, while d errors are identified as uncorrectable errors.

    摘要翻译： 实施例包括通过以最小距离d和2d识别长度为n的两个纠错码来产生纠错码，使得第二代码被包含在第一代码中。 然后使用第一代码将数据编码为t-1块，并使用第二块将其编码到第t块中。 第一t-1编码块被存储在存储器位置的t-1个块中，而这样的t-1编码块和第t个编码块的异或（XOR）被存储到第t个存储块中 位置。 长度为的最终编码矢量被标识为属于具有最小距离2d的代码。 编码矢量jn次的旋转被识别为属于相同的等价类。 在最多d-1个错误的情况下，可以成功识别接收到的矢量或其旋转次数，而d个错误被识别为不可纠正的错误。