中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

20 records (took 0.019 seconds)

    Method and means for execution of commands accessing variable length records stored on fixed block formatted DASDS of an N+2 DASD synchronous array
    1.
    发明授权
    Method and means for execution of commands accessing variable length records stored on fixed block formatted DASDS of an N+2 DASD synchronous array 失效
    用于执行访问存储在N + 2 DASD同步阵列的固定块格式的DASDS上的可变长度记录的命令的方法和装置

    公开(公告)号：US5506979A

    公开(公告)日：1996-04-09

    申请号：US679455

    申请日：1991-04-02

    Applicant: Jaishankar M. Menon

    Inventor： Jaishankar M. Menon

    IPC: G06F3/06 ,  G06F11/10 ,  G11B20/10 ,  G11B20/18 ,  G06F12/00

    CPC classification number: G06F11/1076 ,  G06F11/1008 ,  G11B20/10 ,  G11B20/1833 ,  G06F2003/0697 ,  G06F3/0601

    Abstract: Variable length records can be accessed from an array of N+2 synchronous fixed block formatted DASDs in a single pass and in the presence of a single DASD failure if each record is partitioned into a variable number of K fixed length blocks, the blocks are written on the DASDs in column major order K modulo (N+1), the order is constrained such that the first block of each record resides on the (N+l)st DASD, a parity block for each column resides on an (N+2)nd DASD, and each parity block spans N blocks in the same column from the first N DASDs and one block one column offset thereto on the (N+1)st DASD.

    Abstract translation: 可以在单次通过的N + 2同步固定块格式的DASD阵列中访问可变长度记录，并且如果每个记录被划分为可变数目的K个固定长度块，则存在单个DASD故障，这些块被写入 在DASD列主要序列K模（N + 1）中，顺序被约束，使得每个记录的第一块驻留在（N + 1）stDASD上，每列的奇偶校验块驻留在（N + 2）nd DASD，并且每个奇偶校验块跨越来自前N个DASD的同一列中的N个块以及在第（N + 1）个DASD上偏移的一个块。

    Method and system for minimizing seek affinity and enhancing write sensitivity in a DASD array
    2.
    发明授权
    Method and system for minimizing seek affinity and enhancing write sensitivity in a DASD array 失效
    用于最小化寻找亲和度并增强DASD阵列中写入敏感度的方法和系统

    公开(公告)号：US5416915A

    公开(公告)日：1995-05-16

    申请号：US989245

    申请日：1992-12-11

    Applicant: Richard L. Mattson ,  Jaishankar M. Menon

    Inventor： Richard L. Mattson ,  Jaishankar M. Menon

    IPC: G06F3/06 ,  G06F11/10 ,  G06F11/20 ,  G06F11/16 ,  G06F12/06

    CPC classification number: G06F11/1076 ,  G06F11/1008 ,  G06F3/0601 ,  G06F2003/0697

    Abstract: A method and system for minimizing seek affinity and enhancing write sensitivity in a direct access storage device (DASD) array are disclosed. SEEK affinity and WRITE efficiency are preserved in which logical cylinders, as recorded on the DASD array, are managed as individual log structured files (LSF). Tracks or segments of data and parity blocks having the same or different parity group affinity and stored on the same or different DASD cylindrical addresses are written into a directory managed buffer. Blocks having the same parity affinity and written to counterpart cylinders are written out from the buffer to spare space reserved as part of each DASD cylinder. Otherwise, blocks are updated in place in their DASD array location.

    Abstract translation: 公开了一种在直接访问存储设备（DASD）阵列中最小化搜寻亲和度并提高写入灵敏度的方法和系统。 保留SEEK亲和力和写入效率，其中记录在DASD阵列上的逻辑柱面作为单独的日志结构化文件（LSF）进行管理。 具有相同或不同的奇偶校验组相似度并存储在相同或不同DASD圆柱形地址上的数据和奇偶校验块的轨迹或奇偶校验块被写入目录管理缓冲器。 具有相同奇偶性相似性并写入对应气瓶的块从缓冲器中写出作为每个DASD气缸一部分保留的备用空间。 否则，在其DASD数组位置更新块。

    System and method for identifying inconsistent parity in an array of storage
    6.
    发明授权
    System and method for identifying inconsistent parity in an array of storage 失效
    用于识别存储阵列中的不一致奇偶校验的系统和方法

    公开(公告)号：US5574882A

    公开(公告)日：1996-11-12

    申请号：US397817

    申请日：1995-03-03

    Applicant: Jaishankar M. Menon ,  James C. Wyllie ,  Geoffrey A. Riegel

    Inventor： Jaishankar M. Menon ,  James C. Wyllie ,  Geoffrey A. Riegel

    IPC: G06F3/06 ,  G06F11/10 ,  G06F12/00 ,  G06F13/00

    CPC classification number: G06F11/1076 ,  G06F2211/1009

    Abstract: A system and method are provided that is used by software implemented Redundancy Array of Inexpensive Disk (RAID) arrays to achieve adequate performance and reliability, as well as to improve performance or low cost hardware Raids. The enhancements to the basic RAID implementation speeds up recovery time for software RAIDS. A method is provided for storing data in an array of storage devices. A plurality of block locations on the storage devices are logically arranged as a parity group wherein a parity block stored in a block location as part of a parity group is logically derived from the combination of data blocks stored in the parity group, and each block in a parity group is stored on a different storage device. A plurality of parity groups are grouped into a parity group set. A request is received to write a new data block location on a storage device. The old data block stored at the block location is read. The new data block is written to the block location. When the parity set is in an unmodified state prior to the current write, an indicator is written to the storage device that the parity group set is in a modified state. In a preferred embodiment, this enhancement uses a bit map stored on disk, called Parity Group Set, (PGS) bit map, to mark inconsistent parity groups, replacing the Non-Volatile Random Access Memory, (NVRAM) used for similar purposes by hardware RAIDs. Further enhancements optimized sequential input/output, (I/O) data stream.

    Abstract translation: 提供了一种由软件实现的廉价磁盘冗余阵列（RAID）阵列使用的系统和方法，以实现足够的性能和可靠性，以及提高性能或低成本硬件RAID。 基本RAID实施的增强可以加快软件RAIDS的恢复时间。 提供了一种用于将数据存储在存储设备阵列中的方法。 存储设备上的多个块位置被逻辑地布置为奇偶校验组，其中作为奇偶校验组的一部分存储在块位置中的奇偶校验块从存储在奇偶校验组中的数据块的组合逻辑地导出，并且每个块 奇偶校验组存储在不同的存储设备上。 多个奇偶校验组被分组成奇偶校验组集合。 接收到在存储设备上写入新的数据块位置的请求。 读取存储在块位置的旧数据块。 新数据块被写入块位置。 当奇偶校验集在当前写入之前处于未修改状态时，将指示符写入存储设备，奇偶校验组集合处于修改状态。 在优选实施例中，该增强使用存储在磁盘上的位图（称为奇偶校验集合（PGS）位图）来标记不一致的奇偶校验组，用硬件替代用于类似目的的非易失性随机存取存储器（NVRAM） RAID 进一步增强优化的顺序输入/输出（I / O）数据流。

    System for managing log structured array (LSA) of DASDS by managing segment space availability and reclaiming regions of segments using garbage collection procedure
    7.
    发明授权
    System for managing log structured array (LSA) of DASDS by managing segment space availability and reclaiming regions of segments using garbage collection procedure 失效
    通过管理段空间可用性和使用垃圾收集程序回收段的区域来管理DASDS的日志结构化阵列（LSA）的系统

    公开(公告)号：US5551003A

    公开(公告)日：1996-08-27

    申请号：US196047

    申请日：1994-02-14

    Applicant: Richard L. Mattson ,  Jaishankar M. Menon

    Inventor： Richard L. Mattson ,  Jaishankar M. Menon

    IPC: G06F3/06 ,  G06F11/10 ,  G06F11/20 ,  G06F13/24

    CPC classification number: G06F11/1076 ,  G06F11/1008 ,  G06F3/0601 ,  G06F2003/0697

    Abstract: Seek affinity is preserved in a segment oriented, cached, log structured array (LSA) of DASDs responsive to accesses dominated by sequential read and random writes of logical tracks stored in the segments. This is achieved by collecting all the write modified read active tracks and clean read active tracks either destaged from the cache or garbage collected from the LSA and rewriting them out to the LSA as segments into regions of contiguous segments of read active tracks. Also, all write modified read inactive tracks and clean read inactive tracks either destaged from cache or garbage collected from the LSA are collected and rewritten out to the LSA as segments into regions of contiguous segments of read inactive tracks. Garbage collection is initiated when the detected free space in a region falls below a threshold and continues until the collected segments exceed a second threshold. Alternatively, write age of logical tracks may be used instead of read activity so as to cluster LSA DASDs into a region of segments formed from old write active logical tracks and a region of current write active logical tracks.

    Abstract translation: 寻求关联性保留在DASD的面向扇区，缓存的对数结构化阵列（LSA）中，响应于通过存储在段中的逻辑轨道的顺序读取和随机写入而主导的访问。 这是通过收集所有写入修改的读活动轨道和清除从缓存收集的高速缓存或垃圾回收的读活动轨迹，并将其作为段重新写入LSA作为读活动轨道的连续段的区域。 此外，从LSA收集的高速缓存或垃圾邮件中的所有写入修改的读取非活动轨道和清除读取的非活动轨迹被收集并重写为LSA作为段读取非活动轨道的连续段的区域。 当区域中检测到的可用空间下降到阈值以下并持续直到所收集的段超过第二阈值时，起始收集垃圾。 或者，可以使用逻辑轨道的写入时间而不是读取活动，以便将LSA DASD聚类到由旧的写入活动逻辑磁道和当前写入活动逻辑磁道的区域形成的段的区域中。

    Method and apparatus for providing distributed sparing with uniform workload distribution in failures
    8.
    发明授权
    Method and apparatus for providing distributed sparing with uniform workload distribution in failures 失效
    用于在故障中提供均匀工作负载分布的分布式备用的方法和装置

    公开(公告)号：US5485571A

    公开(公告)日：1996-01-16

    申请号：US173441

    申请日：1993-12-23

    Applicant: Jaishankar M. Menon

    Inventor： Jaishankar M. Menon

    IPC: G06F11/10 ,  G11C29/00 ,  G06F11/20

    CPC classification number: G11C29/74 ,  G06F11/1076 ,  G06F2211/1028

    Abstract: Data regions, parity regions, and spare regions in a redundant array of storage units are distributed such that each storage unit in the array has the same number of parity regions before, during, and after a failure of one or more storage units such that there is a uniform workload distribution among the storage units during normal operation, during the rebuild process, and during operation after the rebuild and before repair or replacement of the failed unit. The array provides uniform workload distribution for one or more failures of storage units. The number of storage units and the number of storage regions per storage unit is specified once the number of regions in a parity group and the number of failures to be managed are specified. The data regions, parity regions, and spare regions are then placed to provide the uniform workload distribution. Data, parity, and spare regions also can be distributed across multiple redundant arrays to provide the failure-tolerant advantages with uniform workload distribution.

    Abstract translation: 分布在存储单元的冗余阵列中的数据区域，奇偶校验区域和备用区域，使得阵列中的每个存储单元在一个或多个存储单元的故障之前，期间和之后具有相同数量的奇偶校验区域，使得 是在正常操作期间，重建过程中以及重建之后的操作期间以及在故障单元的维修或更换之前的存储单元之间的统一工作负载分配。 阵列为存储单元的一个或多个故障提供统一的工作负载分配。 指定奇偶校验组中的区域数量和要管理的故障数量的存储单元数量和每个存储单元的存储区域数量。 然后将数据区域，奇偶校验区域和备用区域放置以提供统一的工作负载分布。 数据，奇偶校验和备用区也可以分布在多个冗余阵列中，以提供具有统一工作负载分布的容错优势。

    CKD channel with predictive track table
    9.
    发明授权
    CKD channel with predictive track table 失效
    CKD通道具有预测轨迹表

    公开(公告)号：US5283884A

    公开(公告)日：1994-02-01

    申请号：US816017

    申请日：1991-12-30

    Applicant: Jaishankar M. Menon ,  John E. Lindley ,  Robert W. Shomler

    Inventor： Jaishankar M. Menon ,  John E. Lindley ,  Robert W. Shomler

    IPC: G06F12/08 ,  G06F12/00

    CPC classification number: G06F12/0866 ,  Y10S707/99953 ,  Y10S707/99956

    Abstract: A method for managing cache accessing of CKD formatted records that uses a Predictive Track Table to reduce host delays resulting from cache write misses. Because a significant portion of CKD formatted DASD tracks contain records having no key fields, identical logical and physical cylinder and head (CCHH) fields and similar-sized data fields, a compact description of such records by record count and length data, indexed by track, can be quickly searched to determine the physical track location of a record update that misses the cache. The Predictive Track Table search is much faster than the host wait state imposed by access and search of the DASD to read the missing track into cache. If the updated record that misses cache is found within the set of records in the Predictive Track Table, then the update may be immediately written to cache and to a Non-Volatile Store (NVS) without a DASD read access. This update then may be later destaged asynchronously to the DASD from either the cache or the NVS. Otherwise, if not found in a predictive track, the update record is written directly to the disk and the cache, subject to the LRU/MRU discipline, incurring the normal cache write-miss host wait state.

    Abstract translation: 用于管理使用预测轨迹表的CKD格式化记录的高速缓存访​​问以减少由高速缓存写入未命中导致的主机延迟的方法。 由于CKD格式的DASD轨道的重要部分包含没有关键字段，相同的逻辑和物理柱面和头（CCHH）字段和类似大小的数据字段的记录，通过记录计数和长度数据对这些记录的紧凑描述进行索引 ，可以快速搜索以确定错过高速缓存的记录更新的物理轨道位置。 预测轨迹表搜索比通过访问和搜索DASD强制的主机等待状态快得多，以将丢失的轨迹读入高速缓存。 如果在预测跟踪表中的记录集内找到错过高速缓存的更新记录，则可以立即将更新写入高速缓存和非易失性存储（NVS），而不进行DASD读取访问。 该更新然后可能随后从高速缓存或NVS异步到达DASD。 否则，如果在预测轨道中没有找到，更新记录将直接写入磁盘和高速缓存，受LRU / MRU规则的影响，从而导致正常的缓存写入 - 未命中主机等待状态。

Patent Agency Ranking