中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

20 records (took 0.017 seconds)

    Method and system for minimizing seek affinity and enhancing write sensitivity in a DASD array
    1.
    发明授权
    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数组位置更新块。

    Destaging modified data blocks from cache memory
    2.
    发明授权
    Destaging modified data blocks from cache memory 失效
    从缓存中破坏修改后的数据块

    公开(公告)号：US5542066A

    公开(公告)日：1996-07-30

    申请号：US172527

    申请日：1993-12-23

    Applicant: Richard L. Mattson ,  Jaishankar M. Menon

    Inventor： Richard L. Mattson ,  Jaishankar M. Menon

    IPC: G06F11/10 ,  G06F11/34 ,  G06F12/08 ,  G11C29/00 ,  G06F12/00

    CPC classification number: G06F12/0804 ,  G06F11/1008 ,  G06F11/3409 ,  G06F11/3485 ,  G06F12/0866 ,  G11C29/74

    Abstract: A controller for a disk array with parity and sparing includes a non-volatile cache memory and optimizes the destaging process for blocks from the cache memory to both maximize the cache hit ratio and minimize disk utilization. The invention provides a method for organizing the disk array into segments and dividing the cache memory into groups in order of least recently used memory locations and then determining metrics that permit the disk array controller to identify the cache memory locations having the most dirty blocks by segment and group and to identify the utilization rates of the disks. These characteristics are considered to determine when, what, and how to destage. For example, in terms of maximizing the cache hit ratio, when the percentage of dirty blocks in a particular group of the cache memory locations reaches a predetermined level, destaging is begun. The destaging operation continues until the percentage of dirty blocks decreases to a predetermined level. In terms of minimizing disk utilization, all of the dirty blocks in a segment having the most dirty blocks in a group are destaged.

    Abstract translation: 用于具有奇偶校验和备用的磁盘阵列的控制器包括非易失性高速缓存存储器，并且优化来自高速缓冲存储器的块的降级处理以最大化高速缓存命中率并最小化磁盘利用率。 本发明提供了一种用于将磁盘阵列组织成段并将高速缓存存储器按照最近最少使用的存储器位置的顺序划分成组的方法，然后确定允许磁盘阵列控制器通过片段识别具有最脏块的高速缓冲存储器位置的度量 并分组并确定磁盘的使用率。 这些特征被认为是决定什么时候，什么以及如何去世的。 例如，就最大化高速缓存命中率而言，当高速缓冲存储器位置的特定组中的脏块的百分比达到预定水平时，开始着陆。 破坏操作继续，直到脏块的百分比减小到预定水平。 在最小化磁盘利用率的情况下，具有组中最脏的块的段中的所有脏块都将被排除。

    System for managing log structured array (LSA) of DASDS by managing segment space availability and reclaiming regions of segments using garbage collection procedure
    4.
    发明授权
    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 means for execution of commands accessing variable length records stored on fixed block formatted DASDS of an N+2 DASD synchronous array
    6.
    发明授权
    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上偏移的一个块。

    Efficient variable-block data storage system employing a staggered fixed-block-architecture array
    10.
    发明授权
    Efficient variable-block data storage system employing a staggered fixed-block-architecture array 失效
    高效的可变块数据存储系统采用交错的固定块架构阵列

    公开(公告)号：US5459853A

    公开(公告)日：1995-10-17

    申请号：US979740

    申请日：1992-11-23

    Applicant: John S. Best ,  Steven R. Hetzler ,  Roger F. Hoyt ,  Jaishankar M. Menon ,  Michael F. Mitoma

    Inventor： John S. Best ,  Steven R. Hetzler ,  Roger F. Hoyt ,  Jaishankar M. Menon ,  Michael F. Mitoma

    IPC: G06F3/06 ,  G06F11/10 ,  G11B20/10 ,  G11B20/12 ,  G06F12/00 ,  G06F12/04

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

    Abstract: A method for operating a synchronized array of fixed block (FBA) formatted Direct Access Storage Devices (DASDs) to store and update variable-length (CKD) formatted records. This method is suitable for use with DASDs that obtain high recording density by using read and write head technology requiring "micro-jogging" to adjust for differing read and write head alignment or banded disk architecture having a higher block count in the outer tracks than in the inner tracks. Magneto-resistive heads may require micro-jogging to realign the write head for recording after reading the physical track location. The invention employs a DASD staggered array architecture having logical tracks consisting of diagonal-major sequences of consecutive blocks arranged in a predetermined wrap-around manner such as a topological cylinder or torus. The minimum necessary number of DASDs (N) in the staggered array is limited by the fixed block size (B), the interblock gap size (G), the average DASD data transfer rate (D), and the micro-jog delay time (T). A (N+1).sup.th DASD may be added to record the parity of each diagonal-major sequence for improved fault-tolerance.

    Abstract translation: 一种用于操作固定块（FBA）格式化的直接存取存储设备（DASD）的同步阵列以存储和更新可变长度（CKD）格式记录的方法。 该方法适用于通过使用需要“微点动”的读写头技术来获得高记录密度的DASD，用于调整不同的读写头对准或带外磁盘结构，在外轨道中具有较高的块数，而不是 内轨。 在读取物理轨道位置之后，磁阻头可能需要微型点动来重新对准写入头进行记录。 本发明采用具有逻辑轨迹的DASD交错阵列架构，其逻辑轨道由以诸如拓扑柱面或环面的预定绕环方式布置的连续块的对角线主序列组成。 交错阵列中DASD（N）的最小必需数量受固定块大小（B），块间间隙大小（G），平均DASD数据传输速率（D）和微点动延迟时间（D） T）。 可以添加A（N + 1）DASD来记录每个对角线主序列的奇偶校验，以提高容错能力。

Patent Agency Ranking