Patents by Inventor Kiron Vijayasankar
Kiron Vijayasankar has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11113409Abstract: A method of efficient rekey in a transparent decrypting storage array includes receiving an instruction to rekey data on a storage array, wherein the instruction identifies first encryption information and second encryption information. The method further includes decrypting, by a processing device of a storage array controller, the data using the first encryption information to generate decrypted data. The method further includes encrypting the decrypted data using the second encryption information to generate encrypted data.Type: GrantFiled: October 26, 2018Date of Patent: September 7, 2021Assignee: Pure Storage, Inc.Inventors: Constantine P. Sapuntzakis, Kiron Vijayasankar, Yuval Frandzel
-
Patent number: 10901660Abstract: 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.Type: GrantFiled: August 30, 2018Date of Patent: January 26, 2021Assignee: Pure Storage, Inc.Inventors: Yuval Frandzel, Kiron Vijayasankar, Alexandre Xavier Duchateau, Constantine P. Sapuntzakis
-
Patent number: 10896068Abstract: 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.Type: GrantFiled: January 15, 2020Date of Patent: January 19, 2021Assignee: Pure Storage, Inc.Inventors: Yuval Frandzel, Kiron Vijayasankar
-
Patent number: 10853281Abstract: 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.Type: GrantFiled: June 24, 2019Date of Patent: December 1, 2020Assignee: Pure Storage, Inc.Inventors: Yuval Frandzel, Kiron Vijayasankar
-
Publication number: 20200364379Abstract: 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.Type: ApplicationFiled: July 30, 2020Publication date: November 19, 2020Inventors: Kiron Vijayasankar, Alexandre Xavier Duchateau, Constantine P. Sapuntzakis, Yuval Frandzel
-
Patent number: 10831935Abstract: 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.Type: GrantFiled: August 29, 2018Date of Patent: November 10, 2020Assignee: Pure Storage, Inc.Inventors: Kiron Vijayasankar, Alexandre Xavier Duchateau, Constantine P. Sapuntzakis, Yuval Frandzel
-
Patent number: 10678436Abstract: A storage system performs garbage collection with data compression. A storage controller in the storage system determines a garbage collection directive by evaluating the amount of reclaimable space relative to a target amount of reclaimable space. Garbage collection is performed using data compression tunable to compression aggressiveness according to the garbage collection directive.Type: GrantFiled: May 29, 2018Date of Patent: June 9, 2020Assignee: Pure Storage, Inc.Inventors: Yanwei Jiang, Aswin Karumbunathan, Naveen Neelakantam, Kiron Vijayasankar, Bo Feng, Joern Engel
-
Patent number: 10671439Abstract: Workload planning with quality-of-service (‘QoS’) integration, including: determining, for each of a plurality of entities, one or more QoS thresholds associated with the entity; determining, for each of the plurality of entities, one or more resource utilization levels associated with the entity; and determining, in dependence upon the one or more QoS thresholds associated with the plurality of entities, the one or more resource utilization levels associated with the plurality of entities, and one or more overprovisioning factors associated with the storage system, a risk factor that identifies the likelihood that one or more system resources will be overconsumed by the plurality of entities.Type: GrantFiled: September 6, 2017Date of Patent: June 2, 2020Assignee: Pure Storage, Inc.Inventors: Yuval Frandzel, Ivan Iannaccone, Kiron Vijayasankar
-
Publication number: 20200134202Abstract: A method of efficient rekey in a transparent decrypting storage array includes receiving an instruction to rekey data on a storage array, wherein the instruction identifies first encryption information and second encryption information. The method further includes decrypting, by a processing device of a storage array controller, the data using the first encryption information to generate decrypted data. The method further includes encrypting the decrypted data using the second encryption information to generate encrypted data.Type: ApplicationFiled: October 26, 2018Publication date: April 30, 2020Inventors: Constantine P. Sapuntzakis, Kiron Vijayasankar, Yuval Frandzel
-
Patent number: 10585711Abstract: 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.Type: GrantFiled: December 20, 2016Date of Patent: March 10, 2020Assignee: Pure Storage, Inc.Inventors: Yuval Frandzel, Kiron Vijayasankar
-
Patent number: 10534648Abstract: Ensuring the fair utilization of system resources using workload based, time-independent scheduling, including: determining whether an amount of system resource utilization in the storage system has reached a predetermined utilization threshold; and responsive to determining that the amount of system resource utilization in the storage system has reached a predetermined utilization 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 a time-independent period; 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, freezing, at least partially, an amount by which the one or more entities in the storage system have utilized system resources in excess of their fair share.Type: GrantFiled: December 20, 2016Date of Patent: January 14, 2020Assignee: Pure Storage, Inc.Inventors: Yuval Frandzel, Kiron Vijayasankar
-
Patent number: 10484174Abstract: 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.Type: GrantFiled: November 1, 2017Date of Patent: November 19, 2019Assignee: Pure Storage, Inc.Inventors: Andrew Bernat, Alexandre Duchâteau, Marco Sanvido, Constantine Sapuntzakis, Kiron Vijayasankar
-
Patent number: 10353743Abstract: 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.Type: GrantFiled: April 30, 2018Date of Patent: July 16, 2019Assignee: Pure Storage, Inc.Inventors: Yuval Frandzel, Kiron Vijayasankar
-
Patent number: 10331588Abstract: 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.Type: GrantFiled: September 6, 2017Date of Patent: June 25, 2019Assignee: Pure Storage, Inc.Inventors: Yuval Frandzel, Kiron Vijayasankar
-
Publication number: 20190065788Abstract: 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.Type: ApplicationFiled: August 29, 2018Publication date: February 28, 2019Inventors: Kiron Vijayasankar, Alexandre Xavier Duchateau, Constantine P. Sapuntzakis, Yuval Frandzel
-
Patent number: 10146585Abstract: 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: queuing 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.Type: GrantFiled: December 19, 2016Date of Patent: December 4, 2018Assignee: Pure Storage, Inc.Inventors: Yuval Frandzel, Kiron Vijayasankar
-
Publication number: 20180067881Abstract: 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.Type: ApplicationFiled: September 6, 2017Publication date: March 8, 2018Inventors: YUVAL FRANDZEL, KIRON VIJAYASANKAR
-
Publication number: 20180067771Abstract: 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: queuing 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.Type: ApplicationFiled: December 19, 2016Publication date: March 8, 2018Inventors: YUVAL FRANDZEL, KIRON VIJAYASANKAR
-
Publication number: 20180067772Abstract: 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.Type: ApplicationFiled: December 20, 2016Publication date: March 8, 2018Inventors: YUVAL FRANDZEL, KIRON VIJAYASANKAR
-
Publication number: 20180067775Abstract: Ensuring the fair utilization of system resources using workload based, time-independent scheduling, including: determining whether an amount of system resource utilization in the storage system has reached a predetermined utilization threshold; and responsive to determining that the amount of system resource utilization in the storage system has reached a predetermined utilization 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 a time-independent period; 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, freezing, at least partially, an amount by which the one or more entities in the storage system have utilized system resources in excess of their fair share.Type: ApplicationFiled: December 20, 2016Publication date: March 8, 2018Inventors: YUVAL FRANDZEL, KIRON VIJAYASANKAR