中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

21 records (took 0.026 seconds)

    DATA PLACEMENT TECHNIQUE FOR STRIPING DATA CONTAINERS ACROSS VOLUMES OF A STORAGE SYSTEM CLUSTER
    11.
    发明申请
    DATA PLACEMENT TECHNIQUE FOR STRIPING DATA CONTAINERS ACROSS VOLUMES OF A STORAGE SYSTEM CLUSTER 审中-公开
    数据容器的数据放置技术用于存储系统集群中的数据容器

    公开(公告)号：WO2006118957A2

    公开(公告)日：2006-11-09

    申请号：PCT/US2006016055

    申请日：2006-04-27

    Applicant: NETWORK APPLIANCE INC

    Inventor： CORBETT PETER F ,  ENGLISH ROBERT M ,  KLEIMAN STEVEN R

    IPC: G06F3/06 ,  G06F11/10

    CPC classification number: G06F11/1096 ,  G06F3/0607 ,  G06F3/0632 ,  G06F3/0646 ,  G06F3/0689

    Abstract: A technique places content, such as data, of one or more data containers on volumes of a striped volume set (SVS). The placement of data across the volumes of the SVS allows specification of a deterministic pattern of fixed length. That is, the pattern determines a placement of data of a data container that is striped among the volumes of the SVS. The placement pattern is such that the stripes are distributed exactly or nearly equally among the volumes and that, within any local span of a small multiple of the number of volumes, the stripes are distributed nearly equally among the volumes. The placement pattern is also substantially similar for a plurality of SVSs having different numbers of volumes.

    Abstract translation: 一种技术将一个或多个数据容器的内容（如数据）放置在条带卷集（SVS）的卷上。 数据在SVS卷上的放置允许规定固定长度的确定性模式。 也就是说，该模式确定在SVS的卷之间条带化的数据容器的数据的放置。 放置图案使得条纹在卷之间精确地或几乎相等地分布，并且在卷的数量的小倍数的任何局部范围内，条纹在卷之间几乎相等地分布。 对于具有不同数量的体积的多个SVS，放置图案也基本相似。

    DYNAMIC PARITY DISTRIBUTION TECHNIQUE
    12.
    发明申请
    DYNAMIC PARITY DISTRIBUTION TECHNIQUE 审中-公开
    动态奇异性分配技术

    公开(公告)号：WO2005043378A3

    公开(公告)日：2008-06-12

    申请号：PCT/US2004036343

    申请日：2004-11-01

    Applicant: NETWORK APPLIANCE INC ,  KLEIMAN STEVEN R ,  ENGLISH ROBERT M ,  CORBETT PETER F

    Inventor： KLEIMAN STEVEN R ,  ENGLISH ROBERT M ,  CORBETT PETER F

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

    CPC classification number: G06F11/1076 ,  G06F11/1088

    Abstract: A dynamic parity distribution system and technique distributes parity across disks of an array. The dynamic parity distribution system includes a storage operating system that integrates a file system with a RAID system. In response to a request to store (write) data on the array, the file system determines which disks contain free blocks in a next allocated stripe of the array. There may be multiple blocks within the stripe that do not contain file system data (i.e., unallocated data blocks) and that could potentially store parity. One or more of those unallocated data blocks can be assigned to store parity, arbitrarily. According to the dynamic parity distribution technique, the file system determines which blocks hold parity each time there is a write request to the stripe. The technique alternately allows the RAID system to assign a block to contain parity when each stripe is written.

    Abstract translation: 动态奇偶校验分配系统和技术在阵列的磁盘上分配奇偶校验。 动态奇偶校验分配系统包括将文件系统与RAID系统集成的存储操作系统。 响应于在阵列上存储（写入）数据的请求，文件系统确定哪个磁盘在数组的下一个分配的条带中包含空闲块。 条带内可能存在不包含文件系统数据（即，未分配的数据块）并且可能存储奇偶校验的多个块。 这些未分配数据块中的一个或多个可以被任意地分配给存储奇偶校验。 根据动态奇偶校验分配技术，文件系统确定哪个块在每次存在针对条带的写入请求时保持奇偶校验。 该技术交替地允许RAID系统在写入每个条带时分配块以包含奇偶校验。

    METHOD AND APPARATUS FOR INCREASING THROUGHPUT IN A STORAGE SERVER
    13.
    发明申请
    METHOD AND APPARATUS FOR INCREASING THROUGHPUT IN A STORAGE SERVER 审中-公开
    用于增加存储服务器中的吞吐量的方法和设备

    公开(公告)号：WO2007047934A3

    公开(公告)日：2007-07-05

    申请号：PCT/US2006041055

    申请日：2006-10-19

    Applicant: NETWORK APPLIANCE INC ,  LANGO JASON A ,  ENGLISH ROBERT M ,  ENDO YASUHIRO ,  SHAH MEHUL S ,  MCGOVERN WILLIAM P

    Inventor： LANGO JASON A ,  ENGLISH ROBERT M ,  ENDO YASUHIRO ,  SHAH MEHUL S ,  MCGOVERN WILLIAM P

    IPC: G06F9/46

    CPC classification number: G06F9/5066 ,  G06F9/52 ,  G06F17/30091

    Abstract: Multiple domains are created for processes of a storage server. The processes are capable of execution on a plurality of processors in the storage server. The domains include a first domain, which includes multiple threads that can execute processes in the first domain in parallel, to service data access requests. A data set managed by the storage server is logically divided into multiple subsets, and each of the subsets is assigned to exactly one of the threads in the first domain, for processing of data access requests directed to the data set.

    Abstract translation: 为存储服务器的进程创建多个域。 这些过程能够在存储服务器中的多个处理器上执行。 这些域包括第一个域，该域包含可以并行执行第一个域中的进程的多个线程来处理数据访问请求。 由存储服务器管理的数据集在逻辑上被划分为多个子集，并且每个子集被分配给第一个域中的恰好一个线程，用于处理针对数据集的数据访问请求。

    SYSTEM AND METHOD FOR PROVIDING CONTINUOUS DATA PROTECTION
    14.
    发明申请
    SYSTEM AND METHOD FOR PROVIDING CONTINUOUS DATA PROTECTION 审中-公开
    提供连续数据保护的系统和方法

    公开(公告)号：WO2007127361A3

    公开(公告)日：2008-11-13

    申请号：PCT/US2007010223

    申请日：2007-04-26

    Applicant: NETWORK APPLIANCE INC ,  ZHENG LING ,  ENGLISH ROBERT M ,  MANLEY STEPHEN L ,  LEWIS BLAKE H

    Inventor： ZHENG LING ,  ENGLISH ROBERT M ,  MANLEY STEPHEN L ,  LEWIS BLAKE H

    IPC: G06F17/30 ,  G06F11/14

    CPC classification number: G06F11/1435 ,  G06F17/30085

    Abstract: A system and method provides continuous data protection using checkpoints in a write anywhere file system. During a consistency point of a write anywhere file system, freed blocks are identified and are appended to a delete log for retention. A consistency point log is updated with a new entry associated with the consistency point. If the file system needs to retrieve its state at a particular point in time, the stored blocks of the delete log may be recovered.

    Abstract translation: 系统和方法使用写入任意文件系统中的检查点提供持续的数据保护。 在写入任何文件系统的一致性点中，自由块被识别并附加到删除日志以进行保留。 使用与一致性点相关联的新条目更新一致性点日志。 如果文件系统需要在特定时间点检索其状态，则可以恢复存储的删除日志块。

    SYSTEM AND METHOD FOR RESTORING DATA ON DEMAND FOR INSTANT VOLUME RESTORATION
    15.
    发明申请
    SYSTEM AND METHOD FOR RESTORING DATA ON DEMAND FOR INSTANT VOLUME RESTORATION 审中-公开
    用于恢复数据的系统和方法用于即时容量恢复

    公开(公告)号：WO2006116293A3

    公开(公告)日：2007-02-22

    申请号：PCT/US2006015442

    申请日：2006-04-24

    Applicant: NETWORK APPLIANCE INC

    Inventor： LANGO JASON ANSEL ,  CHO YONG EUN ,  EASTHAM PAUL CHRISTOPER ,  ZHENG LING ,  MANLEY STEPHEN L ,  EDWARDS JOHN W JR ,  ENGLISH ROBERT M ,  ACKAOUY EMMANUEL

    IPC: G06F11/14 ,  G06F11/20

    CPC classification number: G06F11/1435 ,  G06F11/1464 ,  G06F11/1469

    Abstract: A technique is disclosed for restoring data of sparse volumes, where one or more block pointers within the file system structure are marked as ABSENT, and fetching the appropriate data from an alternate location on demand. Client data access requests to the local storage system initiate a restoration of the data from a backing store as required. A demand generator can also be used to restore the data as a background process by walking through the sparse volume and restoring the data of absent blocks. A pump module is also disclosed to regulate the access of the demand generator. Once all the data has been restored, the volume contains all data locally, and is no longer a sparse volume.

    Abstract translation: 公开了一种用于恢复稀疏卷的数据的技术，其中文件系统结构中的一个或多个块指针被标记为ABSENT，并且根据需要从备用位置获取适当的数据。 对本地存储系统的客户端数据访问请求根据需要启动从后台存储器恢复数据。 还可以使用需求生成器通过遍历稀疏卷并恢复缺少块的数据来将数据恢复为后台进程。 还公开了一种泵模块来调节需求发生器的通路。 一旦所有数据都已恢复，卷将包含本地的所有数据，并且不再是稀疏卷。

    SEMI-STATIC PARITY DISTRIBUTION TECHNIQUE
    16.
    发明申请
    SEMI-STATIC PARITY DISTRIBUTION TECHNIQUE 审中-公开
    半静止奇偶分配技术

    公开(公告)号：WO2005052784A3

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

    申请号：PCT/US2004039618

    申请日：2004-11-24

    Applicant: NETWORK APPLIANCE INC ,  CORBETT PETER F ,  ENGLISH ROBERT M ,  KLEIMAN STEVEN R

    Inventor： CORBETT PETER F ,  ENGLISH ROBERT M ,  KLEIMAN STEVEN R

    IPC: G06F11/10

    CPC classification number: G06F11/1096

    Abstract: A semi-static distribution technique distributes parity across disks of an array. According to the technique, parity is distributed (assigned) across the disks of the array in a manner that maintains a fixed pattern of parity blocks among the stripes of the disks. When one or more disks are added to the array, the semi-static technique redistributes parity in a way that does not require recalculation of parity or moving of any data blocks. Notably, the parity information is not actually moved; the technique merely involves a change in the assignment (or reservation) for some of the parity blocks of each pre-existing disk to the newly added disk.

    Abstract translation: 半静态分配技术在阵列的磁盘上分配奇偶校验。 根据该技术，奇偶校验以在盘的条带之间维持奇偶校验块的固定模式的方式分布（分配）在阵列的盘上。 当将一个或多个磁盘添加到阵列中时，半静态技术以不需要重新计算奇偶校验或移动任何数据块的方式重新分配奇偶校验。 值得注意的是，奇偶校验信息实际上没有被移动; 该技术仅涉及将每个预先存在的磁盘的一些奇偶校验块的分配（或预留）改变为新添加的磁盘。

    EXTENSION OF WRITE ANYWHERE FILE SYSTEM LAYOUT
    17.
    发明申请
    EXTENSION OF WRITE ANYWHERE FILE SYSTEM LAYOUT 审中-公开
    写入任何文件系统布局的扩展

    公开(公告)号：WO2005111804A3

    公开(公告)日：2006-05-26

    申请号：PCT/US2005013695

    申请日：2005-04-21

    Applicant: NETWORK APPLIANCE INC

    Inventor： EDWARS JOHN K ,  LEWIS BLAKE H ,  ENGLISH ROBERT M ,  HAMILTON ERIC ,  CORBETT PETER F

    IPC: G06F17/30 ,  G06F11/14 ,  G06F12/00

    CPC classification number: G06F3/0689 ,  G06F3/0619 ,  G06F3/0665 ,  G06F17/30233

    Abstract: A file system layout apportions an underlying physical volume into one or more virtual volumes (vvols) of a storage system. The underlying physical volume is an aggregate comprising one or more groups of disks, such as RAID groups, of the storage system. The aggregate has its own physical volume block number (pvbn) space and maintains metadata, such as block allocation structures, within that pvbn space. Each vvol has its own virtual volume block number (vvbn) space and maintains meta-data, such as block allocation structures, within that vvbn space. Notably, the block allocation structures of a vvol are sized to the vvol, and not to the underlying aggregate, to thereby allow operations that manage data served by the storage system (e.g., snap-shot operations) to efficiently work over the vvols. The file system layout extends the file system layout of a conventional write anywhere file layout system implementation, yet maintains performance properties of the conventional implementation.

    Abstract translation: 文件系统布局将底层物理卷分配到存储系统的一个或多个虚拟卷（vvols）中。 底层物理卷是包含存储系统的一组或多组磁盘（如RAID组）的聚合。 聚合具有自己的物理卷块数（pvbn）空间，并在该pvbn空间内维护诸如块分配结构的元数据。 每个vvol都有自己的虚拟卷块号（vvbn）空间，并在该vvbn空间内维护元数据，如块分配结构。 值得注意的是，vvol的块分配结构的大小适合vvol，而不是基础聚合，从而允许管理由存储系统服务的数据的操作（例如快照操作）以有效地在vvols上工作。 文件系统布局扩展了常规写入任何文件布局系统实现的文件系统布局，但是保持了传统实现的性能特性。

Patent Agency Ranking