-
公开(公告)号：US10430306B2
公开(公告)日：2019-10-01
申请号：US15332321
申请日：2016-10-24
Applicant: Pure Storage, Inc.
Inventor： John Davis , Brian Gold , Shantanu Gupta , John Hayes , Robert Lee , Igor Ostrovsky , Rusty Sears
Abstract: A plurality of storage nodes is provided. Each of the plurality of storage nodes includes nonvolatile solid-state memory for user data storage. The plurality of storage nodes is configured to distribute the user data and metadata associated with the user data throughout the plurality of storage nodes such that the plurality of storage nodes maintain the ability to read the user data, using erasure coding, despite a loss of two of the plurality of storage nodes. The plurality of storage nodes is configured to initiate an action based on the redundant copies of the metadata, responsive to achieving a level of redundancy for the redundant copies of the metadata. A method for accessing user data in a plurality of storage nodes having nonvolatile solid-state memory is also provided.
-
公开(公告)号：US20190294329A1
公开(公告)日：2019-09-26
申请号：US16436482
申请日：2019-06-10
Applicant: PURE STORAGE, INC.
Inventor： Robert Lee , Christopher Lumb , Ethan L. Miller , Igor Ostrovsky
IPC: G06F3/06
Abstract: Systems and methods of deduplication aware scalable content placement am described. A method may include receiving data to be stored on one or more nodes of a storage array and calculating a plurality of hashes corresponding to the data. The method further includes determining a first subset of the plurality of hashes, determining a second subset of the plurality of hashes of the first subset, and generating a node candidate placement list. The method may further include sending the first subset to one or more nodes represented on the node candidate placement list and receiving, from the nodes represented on the node candidate placement list, characteristics corresponding to the nodes represented on the candidate placement list. The method may further include identifying one of the one or more nodes represented on the candidate placement list m view of the characteristic and sending the data to the identified node.
-
公开(公告)号：US10360214B2
公开(公告)日：2019-07-23
申请号：US16045814
申请日：2018-07-26
Applicant: PURE STORAGE, INC.
Inventor： Brian Gold , Emily Watkins , Ivan Jibaja , Igor Ostrovsky , Roy Kim
Abstract: Ensuring reproducibility in an artificial intelligence infrastructure that includes one or more storage systems and one or more graphical processing unit (‘GPU’) servers, including: identifying, by a unified management plane, one or more transformations applied to a dataset by the artificial intelligence infrastructure, wherein applying the one or more transformations to the dataset causes the artificial intelligence infrastructure to generate a transformed dataset; storing, within the one or more storage systems, information describing the dataset, the one or more transformations applied to the dataset, and the transformed dataset; identifying, by the unified management plane, one or more machine learning models executed by the artificial intelligence infrastructure using the transformed dataset as input; and storing, within the one or more storage systems, information describing one or more machine learning models executed using the transformed dataset as input.
-
公开(公告)号：US10359942B2
公开(公告)日：2019-07-23
申请号：US15339302
申请日：2016-10-31
Applicant: PURE STORAGE, INC.
Inventor： Robert Lee , Christopher Lumb , Ethan L. Miller , Igor Ostrovsky
Abstract: Systems and methods of deduplication aware scalable content placement are described. A method may include receiving data to be stored on one or more nodes of a storage array and calculating a plurality of hashes corresponding to the data. The method further includes determining a first subset of the plurality of hashes, determining a second subset of the plurality of hashes of the first subset, and generating a node candidate placement list. The method may further include sending the first subset to one or more nodes represented on the node candidate placement list and receiving, from the nodes represented on the node candidate placement list, characteristics corresponding to the nodes represented on the candidate placement list. The method may further include identifying one of the one or more nodes represented on the candidate placement list in view of the characteristic and sending the data to the identified node.
-
公开(公告)号：US10303547B2
公开(公告)日：2019-05-28
申请号：US15315676
申请日：2015-06-04
Applicant: Pure Storage, Inc.
Inventor： John Hayes , John Colgrove , Robert Lee , Joshua Robinson , Igor Ostrovsky
Abstract: 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.
-
Patent Agency Ranking
公开(公告)号：US20180121089A1
公开(公告)日：2018-05-03
申请号：US15339302
申请日：2016-10-31
Applicant: PURE STORAGE, INC.
Inventor： Robert Lee , Christopher Lumb , Ethan L. Miller , Igor Ostrovsky
IPC: G06F3/06
CPC classification number: G06F3/061 , G06F3/0608 , G06F3/0641 , G06F3/0647 , G06F3/067 , G06F3/0688 , G06F3/0689
Abstract: Systems and methods of deduplication aware scalable content placement are described. A method may include receiving data to be stored on one or more nodes of a storage array and calculating a plurality of hashes corresponding to the data. The method further includes determining a first subset of the plurality of hashes, determining a second subset of the plurality of hashes of the first subset, and generating a node candidate placement list. The method may further include sending the first subset to one or more nodes represented on the node candidate placement list and receiving, from the nodes represented on the node candidate placement list, characteristics corresponding to the nodes represented on the candidate placement list. The method may further include identifying one of the one or more nodes represented on the candidate placement list in view of the characteristic and sending the data to the identified node.
-
公开(公告)号：US20170017662A1
公开(公告)日：2017-01-19
申请号：US14798371
申请日：2015-07-13
Applicant: Pure Storage, Inc.
Inventor： John Hayes , Robert Lee , Igor Ostrovsky , Peter Vajgel
CPC classification number: G06F3/0679 , G06F16/182
Abstract: A method for accessing a file in a storage system is provided. The method includes determining, for each file chunk of the file, an authority among differing storage nodes of the storage system and receiving from the authority having ownership of the file chunk, location information for the file chunk. The method includes accessing file chunks of the file as directed by each of the determined authorities.
Abstract translation: 提供了一种访问存储系统中的文件的方法。 该方法包括为文件的每个文件块确定存储系统的不同存储节点之间的权限，并从具有文件块所有权的机构接收文件块的位置信息。 该方法包括按照每个确定的权限的指示访问文件的文件块。
-
公开(公告)号：US09218244B1
公开(公告)日：2015-12-22
申请号：US14296160
申请日：2014-06-04
Applicant: Pure Storage, Inc.
Inventor： John Hayes , John Colgrove , Robert Lee , Joshua Robinson , Igor Ostrovsky
CPC classification number: G06F11/1096 , G06F11/1076 , G06F11/108 , G06F11/1088 , G06F11/1415
Abstract: 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.
Abstract translation: 提供了一种在存储集群的多个存储节点中主动重建用户数据的方法。 该方法包括在整个多个存储节点中分配用户数据和元数据，使得多个存储节点可以使用擦除编码来读取用户数据，尽管存在两个存储节点。 该方法包括确定存储节点中的一个是不可达的并且确定重新生成不可达的存储节点之一的用户数据。 该方法包括使用擦除编码在多个存储节点的剩余部分中使用擦除编码和写入用户数据来跨多个存储节点的其余部分读取用户数据。 还提供了可以主动地重建存储在存储节点内的用户数据的单个机架内的多个存储节点。
-
公开(公告)号：US20150355974A1
公开(公告)日：2015-12-10
申请号：US14296160
申请日：2014-06-04
Applicant: Pure Storage, Inc.
Inventor： John HAYES , John Colgrove , Robert Lee , Joshua Robinson , Igor Ostrovsky
IPC: G06F11/14
CPC classification number: G06F11/1096 , G06F11/1076 , G06F11/108 , G06F11/1088 , G06F11/1415
Abstract: 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.
Abstract translation: 提供了一种在存储集群的多个存储节点中主动重建用户数据的方法。 该方法包括在整个多个存储节点中分配用户数据和元数据，使得多个存储节点可以使用擦除编码来读取用户数据，尽管存在两个存储节点。 该方法包括确定存储节点中的一个是不可达的并且确定重新生成不可达的存储节点之一的用户数据。 该方法包括使用擦除编码在多个存储节点的剩余部分中使用擦除编码和写入用户数据来跨多个存储节点的其余部分读取用户数据。 还提供了可以主动地重建存储在存储节点内的用户数据的单个机架内的多个存储节点。
-
公开(公告)号：US09003144B1
公开(公告)日：2015-04-07
申请号：US14296146
申请日：2014-06-04
Applicant: Pure Storage, Inc.
Inventor： John Hayes , Igor Ostrovsky , Robert Lee , Shantanu Gupta , Rusty Sears , John Davis , Brian Gold
CPC classification number: G06F11/2069 , G06F3/0619 , G06F3/064 , G06F3/065 , G06F3/067 , G06F3/0683 , G06F3/0688 , G06F11/1016 , G06F11/1092 , G06F11/1435 , G06F11/1451 , G06F11/2094 , G06F12/0638 , G06F2201/805 , G06F2201/82 , G06F2201/84 , G06F2212/205
Abstract: A plurality of storage nodes in a single chassis is provided. The plurality of storage nodes in the single chassis is configured to communicate together as a storage cluster. Each of the plurality of storage nodes includes nonvolatile solid-state memory for user data storage. The plurality of storage nodes is configured to distribute the user data and metadata associated with the user data throughout the plurality of storage nodes such that the plurality of storage nodes maintain the ability to read the user data, using erasure coding, despite a loss of two of the plurality of storage nodes. The plurality of storage nodes configured to initiate an action based on the redundant copies of the metadata, responsive to achieving a level of redundancy for the redundant copies of the metadata. A method for accessing user data in a plurality of storage nodes having nonvolatile solid-state memory is also provided.
Abstract translation: 提供了单个机箱中的多个存储节点。 单个机箱中的多个存储节点被配置为一起作为存储集群通信。 多个存储节点中的每一个包括用于用户数据存储的非易失性固态存储器。 多个存储节点被配置为在整个多个存储节点中分配与用户数据相关联的用户数据和元数据，使得多个存储节点使用擦除编码保持读取用户数据的能力，尽管丢失了两个 的多个存储节点。 多个存储节点被配置为基于元数据的冗余副本来发起动作，响应于实现元数据的冗余副本的冗余级别。 还提供了一种用于访问具有非易失性固态存储器的多个存储节点中的用户数据的方法。
-
-
-
-
-
-
-
-
-
Search Results
86
records
(took 0.036 seconds)
