利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

56 条记录 (耗时 0.024 秒)

    ABILITY TO PARTITION AN ARRAY INTO TWO OR MORE LOGICAL ARRAYS WITH INDEPENDENTLY RUNNING SOFTWARE
    3.
    发明公开
    ABILITY TO PARTITION AN ARRAY INTO TWO OR MORE LOGICAL ARRAYS WITH INDEPENDENTLY RUNNING SOFTWARE 审中-公开
    使用独立运行软件将阵列分成两个或更多逻辑阵列的能力

    公开(公告)号：EP3281099A1

    公开(公告)日：2018-02-14

    申请号：EP16777006.4

    申请日：2016-01-21

    申请人： Pure Storage, Inc.

    发明人： BOTES, Par ,  COLGROVE, John ,  HAYES, John

    IPC分类号： G06F3/06

    CPC分类号： G06F3/0619 ,  G06F3/0644 ,  G06F3/065 ,  G06F3/0665 ,  G06F3/0689 ,  G06F11/1076 ,  G06F11/1441 ,  G06F11/2094

    摘要： A plurality of storage nodes in a single chassis is provided. The plurality of storage nodes includes a first plurality of storage nodes configured to communicate together as a first storage cluster and a second plurality of storage nodes configured to communicate together as a second storage cluster. Each of the first and second pluralities of storage nodes has nonvolatile solid-state memory for user data storage and each of the first and second pluralities of storage nodes is configured to distribute user data and metadata associated with the user data throughout a respective plurality of storage nodes such that a respective storage cluster maintains ability to read the user data, using erasure coding, despite a loss of one or more of the respective plurality of storage nodes.

    REBUILDING DATA ACROSS STORAGE NODES
    4.
    发明公开
    REBUILDING DATA ACROSS STORAGE NODES 审中-公开
    维多利亚时代日报

    公开(公告)号：EP3152686A1

    公开(公告)日：2017-04-12

    申请号：EP15803249.0

    申请日：2015-06-04

    申请人： Pure Storage, Inc.

    发明人： HAYES, John ,  COLGROVE, John ,  LEE, Robert ,  ROBINSON, Joshua ,  OSTROVSKY, Igor

    IPC分类号： G06F17/30 ,  G06F3/06

    CPC分类号： G06F11/1096 ,  G06F11/1076 ,  G06F11/108 ,  G06F11/1088 ,  G06F11/1415

    摘要： A method for proactively rebuilding user data in a plurality of storage nodes of a storage cluster is provided. The method includes distributing user data and metadata throughout the plurality of storage nodes such that the plurality of storage nodes can read the user data, using erasure coding, despite loss of two of the storage nodes. The method includes determining that one of the storage nodes is unreachable and determining to rebuild the user data for the one of the storage nodes that is unreachable. The method includes reading the user data across a remainder of the plurality of storage nodes, using the erasure coding and writing the user data across the remainder of the plurality of storage nodes, using the erasure coding. A plurality of storage nodes within a single chassis that can proactively rebuild the user data stored within the storage nodes is also provided.

    摘要翻译： 提供了一种用于主动地重建存储集群的多个存储节点中的用户数据的方法。 该方法包括在整个多个存储节点中分配用户数据和元数据，使得多个存储节点可以使用擦除编码来读取用户数据，尽管丢失了两个存储节点。 该方法包括确定存储节点中的一个是不可达的并且确定为不可达的存储节点之一重建用户数据。 该方法包括使用擦除编码在多个存储节点的剩余部分中使用擦除编码和跨多个存储节点的其余部分写入用户数据来读取用户数据。 还提供了可以主动地重建存储在存储节点内的用户数据的单个机架内的多个存储节点。

    MAPPING IN A STORAGE SYSTEM
    6.
    发明公开
    MAPPING IN A STORAGE SYSTEM 审中-公开
    画中画的存储系统

    公开(公告)号：EP2745197A1

    公开(公告)日：2014-06-25

    申请号：EP12754134.0

    申请日：2012-08-16

    申请人： Pure Storage, Inc.

    发明人： COLGROVE, John ,  HAYES, John ,  MILLER, Ethan ,  SANDVIG, Cary

    IPC分类号： G06F3/06 ,  G06F11/14

    CPC分类号： G06F3/0644 ,  G06F3/0608 ,  G06F3/0619 ,  G06F3/064 ,  G06F3/065 ,  G06F3/0665 ,  G06F3/0668 ,  G06F3/067

    摘要： A system and method for maintaining a mapping table in a data storage subsystem. A data storage subsystem supports multiple mapping tables. Records within a mapping table are arranged in multiple levels which may be logically ordered by time. Each level stores pairs of a key value and a pointer value. New records are inserted in a created new (youngest) level. All levels other than the youngest may be read only. In response to detecting a flattening condition, a data storage controller is configured to identify a group of two or more adjacent levels of the plurality of levels for flattening which are logically adjacent in time. A new level is created and one or more records stored within the group are stored in the new level, in response to detecting each of the one or more records stores a unique key among keys stored within the group.

    DYNAMIC RAID GEOMETRIES IN AN SSD ENVIRONMENT
    7.
    发明公开
    DYNAMIC RAID GEOMETRIES IN AN SSD ENVIRONMENT 审中-公开
    在EINRR SSD环境中的动态RAID槽型

    公开(公告)号：EP2622476A1

    公开(公告)日：2013-08-07

    申请号：EP11761771.2

    申请日：2011-09-19

    申请人： Pure Storage, Inc.

    发明人： COLGROVE, John ,  HAYES, John ,  HONG, Bo ,  MILLER, Ethan

    IPC分类号： G06F11/10 ,  G06F3/06

    CPC分类号： G06F3/0632 ,  G06F3/0605 ,  G06F3/0614 ,  G06F3/0688 ,  G06F11/1076 ,  G06F11/3034 ,  G06F11/3055 ,  G06F2211/1057 ,  G06F2211/1059

    摘要： A system and method for dynamic RAID geometries. A computer system comprises client computers and data storage arrays coupled to one another via a network. A data storage array utilizes solid-state drives and Flash memory cells for data storage. A storage controller within a data storage array is configured to configure a first subset of the storage devices for use in a first RAID layout, the first RAID layout including a first set of redundant data. The controller further configures a second subset of the storage devices for use in a second RAID layout, the second RAID layout including a second set of redundant data. Additionally, the controller configure an additional device not included in either the first subset or the second subset to store redundant data for both the first RAID layout and the second RAID layout.