Pure Storage, Inc.

Vmware, Inc.

Timothy W Brennan

John Colgrove

Ronald S Karr

Ethan L Miller

Robert H Lee

Andrew R Bernat

Constantine P Sapuntzakis

Mark L McAuliffe

Neil A Vachharajani

Neil Buda Vachharajani

Marco Sanvido

Alan Stuart Driscoll

Eric D Seppanen

Grigori Inozemtsev

Yuval Frandzel

Farhan Abrol

Peter E Kirkpatrick

Wei Tang

Xiaohui Wang

Roland Schemers

Radek Aster

Boris Feigin

Benjamin Scholbrock

Jimmy Chi-Wai Chui

Nidhi Pankaj Doshi

Irfan Hamid

Damian Pablo Yurzola

James Andrew Clark

Ross Dargahi

Tsu-Hao Chang

Mark McAULIFFE

Yunpeng Duan

Jiho Hahm

Daniel Geoffrey Karp

Matthew Owen Williams

Mark L Mcauliffe

Staging data on a storage element integrating fast durable storage and bulk durable storage, including: receiving, at a storage element integrating fast durable storage and bulk durable storage, a data storage operation from a host computer; storing data corresponding to the data storage operation within fast durable storage in accordance with a first data resiliency technique; and responsive to detecting a condition for transferring data between fast durable storage and bulk durable storage, transferring the data from fast durable storage to bulk durable storage in accordance with a second data resiliency technique.

Tiering valid data after a disaster recovery operation

A method for rebuilding data when changing erase block sizes in a storage system is provided. The method includes determining one or more erase blocks to be rebuilt and allocating one or more replacement erase blocks, wherein the one or more erase blocks and the one or more replacement erase blocks have differing erase block sizes. The method includes mapping logical addresses, for the one or more erase blocks, to the one or more replacement erase blocks and rebuilding the one or more erase blocks into the one or more replacement erase blocks, in accordance with the mapping.

Allocation of differing erase block sizes

Performing partial redundant array of independent disks (RAID) stripe parity calculations, including: receiving a last portion of a RAID stripe among multiple portions of the RAID stripe, all portions for a successful write of the RAID stripe being previously received except for the last portion; calculating a parity value based on the last portion of the RAID stripe and a previous parity value without calculating the parity value using a previous portion of the RAID stripe; and writing of the RAID stripe.

Efficient redundant array of independent disks (RAID) stripe parity calculations

A method of using flash storage devices with different sized erase blocks is provided. The method includes allocating a plurality of erase blocks of heterogeneous erase block sizes to a RAID stripe, to form a tile pattern having the heterogeneous erase block sizes in the RAID stripe. The method includes writing the RAID stripe across the flash storage devices in accordance with the allocating, and stopping the writing the RAID stripe, responsive to contents of the RAID stripe reaching a threshold.

Pattern forming for heterogeneous erase blocks

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

A method of data reduction in a partially encrypted volume includes receiving data to be stored on a storage array, decrypting the data using a first encryption key to generate first decrypted data, and decrypting the data using a second encryption key to generate second decrypted data. The method further includes comparing, by a storage array controller, a first compressibility value of the first decrypted data to a second compressibility value of the second decrypted data. The method further includes storing the first decrypted data if the first compressibility value is greater than or equal to the second compressibility value. The method further includes storing the second decrypted data if the second compressibility value is greater than the first compressibility value.

Optimizing data reduction for data in encrypted volumes

Storage bandwidth for a storage system process is adjusted responsive to an input output (I/O) write request to write data to a zoned storage device. The storage bandwidth is adjusted by calculating an allocation share for the storage system process requesting to write the data and opening a new zone for the storage system process upon determining that an open zone usage by the storage system process is under the allocation share for the storage system process.

Utilizing allocation shares to improve parallelism in a zoned drive storage system

Encrypting data in a non-volatile memory express ('NVMe') storage device

Continuous value data redundancy, including: receiving, by a storage system, a dataset; determining, based on a data resiliency metric, an integer redundancy value for the dataset from among a plurality of redundancy values; and generating, based on the integer redundancy value for the dataset, data recovery information for the dataset, wherein the integer redundancy value for the dataset is different from at least one other integer redundancy value for another dataset stored within the storage system.

Generating recovery information using data redundancy

Encrypting data to optimize data reduction

A method of performing partial redundant array of independent disks (RAID) stripe parity calculations is disclosed. The method includes receiving a last portion of a RAID stripe among multiple portions of the RAID stripe, all portions for a successful write of the RAID stripe being previously received except for the last portion. The method also includes calculating a parity value based on the last portion of the RAID stripe and a previous parity value without calculating the parity value using a previous portion of the RAID stripe. The method further includes writing of the RAID stripe.

Performing partial redundant array of independent disks (RAID) stripe parity calculations

Heterogeneous erase blocks

Administering storage access in a cloud-based storage system includes: acquiring, by a first storage controller, in response to a protocol request for exclusive access to an area of storage, a first lease for the area of storage of the cloud-based storage system; and storing, by the first storage controller, a first identifier for the first lease in a predefined portion of the area of storage, where the predefined portion of the area of storage is accessible to a second storage controller.

Administering storage access in a cloud-based storage system

Identifying valid data after a storage system recovery

Data rebuild when changing erase block sizes during drive replacement

Growing community of inventors

Mountain View, CA, United States of America

Timothy W Brennan