公开(公告)号：US12184776B2

公开(公告)日：2024-12-31

申请号：US18172037

申请日：2023-02-21

Applicant: PURE STORAGE, INC.

Inventor： Constantine P. Sapuntzakis ,  Kiron Vijayasankar

IPC: H04L9/08 ,  G06F3/06 ,  H04L9/14

Abstract: A method of decommissioning a key in a decryption storage system includes scanning a storage system to identify metadata associated with a current key to be decommissioned. The method further includes encrypting, with the current key, data corresponding to the metadata to generate encrypted data. The method further includes decrypting the encrypted data with a target key to generate decrypted data. The method further includes modifying, by a processing device, the metadata to identify the target key to generate modified metadata. The method further includes storing the decrypted data and the modified metadata to the storage system.

公开(公告)号：US20220382917A1

公开(公告)日：2022-12-01

申请号：US17886079

申请日：2022-08-11

Applicant: PURE STORAGE, INC.

Inventor： Kiron Vijayasankar ,  Alexandre Xavier Duchateau ,  Constantine P. Sapuntzakis ,  Yuval Frandzel

IPC: G06F21/78 ,  H04L69/04 ,  G06F21/60 ,  H04L9/40 ,  G06F3/06 ,  G06F21/64 ,  H04L67/1097 ,  H04L9/32

Abstract: A method includes compressing data to generate compressed data having a first block size corresponding to a block-size requirement of a client device. The method further includes encrypting the compressed data to generate an encrypted data packet. The method further includes adding, by a processing device, a padding bit pattern to the encrypted data packet to generate a data block for storage, the data block having a second block size determined by a buffer size of a storage array.

公开(公告)号：US10896068B1

公开(公告)日：2021-01-19

申请号：US16743285

申请日：2020-01-15

Applicant: PURE STORAGE, INC.

Inventor： Yuval Frandzel ,  Kiron Vijayasankar

IPC: G06F9/50 ,  G06F13/16 ,  G06F9/48 ,  G06F3/06

Abstract: Ensuring the fair utilization of system resources using workload based, time-independent scheduling, including: determining whether an amount of available system resources in the storage system has reached a predetermined reservation threshold; and responsive to determining that the amount of available system resources in the storage system has reached the predetermined reservation threshold: determining whether one or more entities in the storage system have utilized system resources in excess of their fair share by a predetermined threshold during one or more time-independent periods; and responsive to determining that one or more entities in the storage system have utilized system resources in excess of their fair share by the predetermined threshold during the time-independent period, limiting the one or more entities from issuing additional I/O requests to the storage system.

公开(公告)号：US10831935B2

公开(公告)日：2020-11-10

申请号：US16116772

申请日：2018-08-29

Applicant: PURE STORAGE, INC.

Inventor： Kiron Vijayasankar ,  Alexandre Xavier Duchateau ,  Constantine P. Sapuntzakis ,  Yuval Frandzel

IPC: G06F21/78 ,  H04L29/06 ,  G06F21/60 ,  G06F3/06 ,  G06F21/64 ,  H04L29/08 ,  H04L9/32

Abstract: A method of encryption management with host-side data reduction includes identifying data to be written to a storage array and compressing the data to generate compressed data. The method further includes encrypting the compressed data to generate an encrypted data packet. The method further includes adding, by a processing device of a host, a padding bit pattern to the encrypted data packet to generate a data block for storage. The method further includes sending the data block to the storage array.

公开(公告)号：US10331588B2

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

申请号：US15697022

申请日：2017-09-06

Applicant: Pure Storage, Inc.

Inventor： Yuval Frandzel ,  Kiron Vijayasankar

IPC: G06F12/00 ,  G06F13/00 ,  G06F13/18 ,  G06F13/16

Abstract: Ensuring the appropriate utilization of system resources using weighted workload based, time-independent scheduling, including: receiving an I/O request associated with an entity; determining whether an amount of system resources required to service the I/O request is greater than an amount of available system resources in a storage system; responsive to determining that the amount of system resources required to service the I/O request is greater than the amount of available system resources in the storage system: queueing the I/O request in an entity-specific queue for the entity; detecting that additional system resources in the storage system have become available; and issuing an I/O request from an entity-specific queue for an entity that has a highest priority, where a priority for each entity is determined based on the amount of I/O requests associated with the entity and a weighted proportion of resources designated for use by the entity.

公开(公告)号：US12079148B2

公开(公告)日：2024-09-03

申请号：US18496499

申请日：2023-10-27

Applicant: PURE STORAGE, INC.

Inventor： Yuval Frandzel ,  Kiron Vijayasankar

IPC: G06F13/18 ,  G06F13/16

CPC classification number: G06F13/18 ,  G06F13/1642

Abstract: Ensuring the appropriate utilization of system resources using weighted workload based, time-independent scheduling, including: receiving an I/O request associated with an entity; determining whether an amount of system resources required to service the I/O request is greater than an amount of available system resources in a storage system; responsive to determining that the amount of system resources required to service the I/O request is greater than the amount of available system resources in the storage system: queueing the I/O request in an entity-specific queue for the entity; detecting that additional system resources in the storage system have become available; and issuing an I/O request from an entity-specific queue for an entity that has a highest priority, where a priority for each entity is determined based on the amount of I/O requests associated with the entity and a weighted proportion of resources designated for use by the entity.

公开(公告)号：US11803492B2

公开(公告)日：2023-10-31

申请号：US17985515

申请日：2022-11-11

Applicant: PURE STORAGE, INC.

Inventor： Yuval Frandzel ,  Kiron Vijayasankar

IPC: G06F13/18 ,  G06F13/16

CPC classification number: G06F13/18 ,  G06F13/1642

Abstract: Ensuring the appropriate utilization of system resources using weighted workload based, time-independent scheduling, including: receiving an I/O request associated with an entity; determining whether an amount of system resources required to service the I/O request is greater than an amount of available system resources in a storage system; responsive to determining that the amount of system resources required to service the I/O request is greater than the amount of available system resources in the storage system: queueing the I/O request in an entity-specific queue for the entity; detecting that additional system resources in the storage system have become available; and issuing an I/O request from an entity-specific queue for an entity that has a highest priority, where a priority for each entity is determined based on the amount of I/O requests associated with the entity and a weighted proportion of resources designated for use by the entity.

公开(公告)号：US11520936B1

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

申请号：US17130422

申请日：2020-12-22

Applicant: PURE STORAGE, INC.

Inventor： Yuval Frandzel ,  Kiron Vijayasankar ,  Alexandre Xavier Duchateau ,  Constantine P. Sapuntzakis

IPC: G06F3/06 ,  G06F21/78 ,  G06F21/60 ,  H04L9/40 ,  G06F21/64 ,  H04L67/1097 ,  H04L9/32 ,  H04L69/04 ,  H04L9/00

Abstract: A method of volume compressed header identification includes reading, by a processing device of a host, compressible data on a sector of a storage volume of a storage array. The method further includes compressing the compressible data to generate compressed data for the sector. The method further includes adding, by the processing device of the host, metadata associated with the storage volume to the compressed data. The method further includes writing the compressed data, including the added metadata, to the sector of the storage volume of the storage array.

公开(公告)号：US11451391B1

公开(公告)日：2022-09-20

申请号：US16661160

申请日：2019-10-23

Applicant: Pure Storage, Inc.

Inventor： Andrew Bernat ,  Alexandre Duchâteau ,  Marco Sanvido ,  Constantine Sapuntzakis ,  Kiron Vijayasankar

IPC: H04L9/32 ,  G06F21/60 ,  H04L9/40 ,  H04L67/10 ,  H04L67/1097 ,  H04W12/0431 ,  G06F9/455

Abstract: Protecting an encryption key for data stored in a storage system that includes a plurality of storage devices, including: reading, from at least a majority of the storage devices, a portion of an apartment key; reconstructing the apartment key using the portions of the apartment key read by the majority of the storage devices; unlocking the main portion of each of the storage devices utilizing the apartment key; reading, from the main portion of one of the storage devices, a portion of a third-party resource access key; requesting, from the third-party resource utilizing the third-party resource access key, an encryption key; receiving, from the third-party resource, the encryption key; and decrypting the data stored on the storage devices utilizing the encryption key.

公开(公告)号：US10353743B1

公开(公告)日：2019-07-16

申请号：US15967040

申请日：2018-04-30

Applicant: PURE STORAGE, INC.

Inventor： Yuval Frandzel ,  Kiron Vijayasankar

IPC: G06F13/16 ,  G06F9/50 ,  G06F3/06 ,  G06F9/48

Abstract: Ensuring the fair utilization of system resources using workload based, time-independent scheduling, including: receiving an I/O request associated with an entity; determining whether an amount of system resources required to service the I/O request is greater than an amount of available system resources in a storage system; responsive to determining that the amount of system resources required to service the I/O request is greater than the amount of available system resources in the storage system: queueing the I/O request in an entity-specific queue for the entity; detecting that additional system resources in the storage system have become available; and responsive to detecting that additional system resources in the storage system have become available, issuing an I/O request from an entity-specific queue for an entity that has a highest priority among entities with non-empty entity-specific queues.