Pure Storage, Inc.

Ethan L Miller

John Colgrove

John Martin Hayes

Bo Hong

Cary A Sandvig

Feng Wang

Ronald S Karr

Christopher Golden

Craig Harmer

Andrew R Bernat

Jianting Cao

Benjamin P Borowiec

Joseph S Hasbani

Lydia Mai Do

Neil A Vachharajani

Terence W Noonan

Steve Hodgson

Robert H Lee

Constantine P Sapuntzakis

Malcolm Sharpe

Naveen Neelakantam

Taher Vohra

Marco Sanvido

Grigori Inozemtsev

Par Botes

Daquan Zuo

Jimmy T Hu

John D Davis

Mark L McAuliffe

Ganesh Ramanarayanan

Timothy W Brennan

Alan Stuart Driscoll

Wei Zhang

Igor Ostrovsky

Brian Gold

Peter Vajgel

Christopher R Lumb

Joern W Engel

Jonas R Irwin

Alex Ho

Yuhong Mao

Benjamin Scholbrock

Patrick D Lee

Andrew Kleinerman

Peter E Kirkpatrick

Damian Pablo Yurzola

Neil Buda Vachharajani

Vinay Perneti

David Whitlock

Arun Rokade

Rajesh Kanungo

Alexandre Xavier Duchâteau

Nicholas George Psaki

Robert Lee

John A Colgrove

Craig K Harmer

Redundant array of independent drives (RAID) sub-stripes are formed across one or more solid-state storage devices of storage nodes of a storage system. The RAID sub-stripes include corresponding shards of data to be stored at the solid-state storage devices, wherein at least one of the RAID sub-stripes has at least two of the corresponding shards of data on a same storage node. At least one global parity shard is generated for the RAID sub-stripes. The at least one global parity shard is to be stored on a first storage node that is different from each of the same storage nodes storing the at least two of the corresponding shards of data.

Intelligently forming data stripes including multiple shards in a single failure domain

A method of cache management, the method comprising: identifying, among a plurality of storage items, storage items having an access count above a first threshold to generate a set of storage items; identifying, among the set of storage items, storage items having an updated access count above a second threshold to generate a subset of storage items, wherein, for each storage item, the updated access count is dependent upon a number of accesses subsequent to generating the set of storage items; and adding the storage items of the subset of storage items to a cache.

Cache management based on storage access

Providing authorization and authentication in a cloud for a user of a storage array includes: receiving, by a storage array access module from a client-side array services module, a token representing authentication of user credentials and authorized access privileges defining one or more storage array services accessible by the user, where the token is generated by a cloud-based security module upon authentication of the user credentials and identification of authorized access privileges for the user; receiving, by the storage array access module from the user, a user access request to one or more storage array services; and determining, by the storage array access module, whether to grant the user access request in dependence upon the authorized access privileges represented by the token.

Multi-array user authorization for cloud-based storage systems

Utilizing a non-repeating identifier to encrypt data, including: receiving a request to write data to a storage device; selecting a segment-offset pair where the data will be stored, where the selected segment-offset pair is unique to every other segment-offset pair utilized during the lifetime of the storage device; and encrypting the data in dependence upon an identifier of the segment-offset pair.

Encrypting data using non-repeating identifiers

Intra-block error correction including generating reconstructed sub-portions of a portion of a dataset that is distributed into a plurality of portions that are stored on different storage devices of the storage system, wherein the dataset indicates a first number of errors that is greater than a second number of parity data portions of the dataset, determining that a sub-portion of the dataset does not match a corresponding reconstructed sub-portion of the dataset; and based on the determination, replacing the sub-portion of the dataset with the reconstructed sub-portion of the dataset.

Using intra-block redundancy calculations

Deduplicating data based on recently reading the data, including: determining whether a calculated signature for write data matches a particular signature corresponding to data that was recently read from the storage device, wherein the signature is calculated using the write data as input; and after determining that the calculated signature for the write data matches the particular signature, obtaining the data that was recently read and comparing the data that was recently read to the write data.

Identifying duplicate data based on recently read data

A computer system comprising: a data storage medium comprising a plurality of storage devices configured to store data; and a data storage controller coupled to the data storage medium; wherein the data storage controller is configured to: determine a target number of storage devices in a group of storage devices in a storage system that may exhibit variable I/O response times; detect one or more conditions associated with the group of storage devices; and after detecting the one or more conditions, change the target number of storage devices that may exhibit variable I/O response times.

Balancing the number of read operations and write operations that may be simultaneously serviced by a storage system

Self-tuning clusters for resilient microservices, including: receiving, by a services orchestrator within a cloud-computing environment and from a plurality of cloud computing instances, respective latency measurements corresponding to respective control plane operations directed to a shared resource of the plurality of cloud computing instances; determining, based on a current timeout value and on the respective latency measurements from the plurality of cloud computing instances, an updated timeout value for the shared resource; and providing, to each of the plurality of cloud computing instances, the updated timeout value for the shared resource.

Orchestrating self-tuning for cloud storage

Systems and method for implementing deduplication process based on performance analyses. The system may include a processing device to determine a first performance metric associated with retrieving a second stored data block that is within a specified range of a duplicate of the first data block and a second performance metric associated with retrieving a hash value corresponding to the second stored data block. The processing device further to retrieve the second stored data block within a specified range of the duplicate of the first data block in response to the first performance metric not exceeding the second performance metric.

Deduplication selection and optimization

A system and method for managing tables in a storage system is described.

Flash system having multiple fingerprint tables

In one implementation, a method includes identifying a first content-dependent feature associated with a data sector. The method further includes determining a baseline data sector associated with the data sector. The method further includes determining, by a processing device, a content-dependent delta between the first content-dependent feature and a second content-dependent feature of the baseline data sector. The method further includes providing the content-dependent delta and an indicator to the baseline data sector for storage on a plurality of storage devices.

Similarity data for reduced data usage

Data protection in a storage system that includes a plurality of Non-Volatile Memory Express ('NVMe') Solid State Drives (‘SSDs’), including: retrieving, from a plurality of NVMe SSDs (‘Non-Volatile Memory Express Solid State Drives’) of a storage system, one or more unencrypted shares of a master secret; reconstructing the master secret using the shares of the master secret; decrypting one or more encrypted device keys using the master secret; and using the decrypted device keys to perform a plurality of accesses to one or more of the NVMe SSDs.

Encrypting data in a storage device

Providing for increased flexibility for large scale parity, the including: writing data to a storage system, including utilizing a first data protection scheme; identifying, for storage media in the storage system, characteristics of the storage media; identifying, in dependence up the characteristics for the storage media, a second data protection scheme to use for the data; and writing the data to the to the storage system utilizing the second data protection scheme.

Data storage based on characteristics of storage media

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.

Storage node data placement utilizing similarity

Methods, computer systems, and computer readable medium are described for low latency reads using cached deduplicated data, including: receiving a request to read data from a storage system; query, using a generated hash value associated with the request to read data, one or more deduplication tables that corresponds to the hash value; and responsive to determining that the one or more deduplication tables includes an entry that corresponds to the hash value, using a mapping contained in the entry to perform the requested to read data, wherein the mapping includes a pointer to a physical location where at least a portion of the data is stored.

Low latency reads using cached deduplicated data

Growing community of inventors

Mountain View, CA, United States of America

Ethan L Miller