Patents by Inventor Shikha Shree

Shikha Shree 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: 10678642
    Abstract: A method begins by a processing module determining, by a first storage unit, that a storage growth rate is unfavorable for the first storage unit over an estimated time frame of reallocating at least a portion of encoded data slices stored in the first storage unit to one or more additional storage units. The method continues with the processing module when the storage growth rate is unfavorable, selecting an unfavorable growth rate abatement approach to include prioritizing new deletes and outgoing allocations such that estimated required storage capacity is less than available storage capacity of the first storage unit for the estimated time frame of the reallocation of the at least a portion of encoded data slices. The method continues with the processing module facilitating implementation of the unfavorable growth rate abatement approach.
    Type: Grant
    Filed: August 21, 2018
    Date of Patent: June 9, 2020
    Assignee: PURE STORAGE, INC.
    Inventors: Bart R. Cilfone, Ravi V. Khadiwala, Niall J. McShane, Manish Motwani, Jason K. Resch, Shikha Shree
  • Publication number: 20180357122
    Abstract: A method begins by a processing module determining, by a first storage unit, that a storage growth rate is unfavorable for the first storage unit over an estimated time frame of reallocating at least a portion of encoded data slices stored in the first storage unit to one or more additional storage units. The method continues with the processing module when the storage growth rate is unfavorable, selecting an unfavorable growth rate abatement approach to include prioritizing new deletes and outgoing allocations such that estimated required storage capacity is less than available storage capacity of the first storage unit for the estimated time frame of the reallocation of the at least a portion of encoded data slices. The method continues with the processing module facilitating implementation of the unfavorable growth rate abatement approach.
    Type: Application
    Filed: August 21, 2018
    Publication date: December 13, 2018
    Inventors: Bart R. Cilfone, Ravi V. Khadiwala, Niall J. McShane, Manish Motwani, Jason K. Resch, Shikha Shree
  • Patent number: 10089180
    Abstract: A method begins by a processing module determining, by a first storage unit, that a storage growth rate is unfavorable for the first storage unit over an estimated time frame of reallocating at least a portion of encoded data slices stored in the first storage unit to one or more additional storage units. The method continues with the processing module when the storage growth rate is unfavorable, selecting an unfavorable growth rate abatement approach such that estimated required storage capacity is less than available storage capacity of the first storage unit for the estimated time frame of the reallocation of the at least a portion of encoded data slices. The method continues with the processing module facilitating implementation of the unfavorable growth rate abatement approach.
    Type: Grant
    Filed: May 2, 2016
    Date of Patent: October 2, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Bart R. Cilfone, Ravi V. Khadiwala, Niall J. McShane, Manish Motwani, Jason K. Resch, Shikha Shree
  • Publication number: 20170192698
    Abstract: Systems and methods for determining utilization levels of storage within a dispersed storage network (DSN). The methods include obtaining transaction records, updating a cumulative data storage byte-hour count for storage of corresponding bytes of encoded data slices in the storage units of the DSN, and issuing byte-hour usage information based on the updated cumulative data storage byte-hour counts. Each transaction record can include one or more of an operation count, an operation type (e.g., read, write, delete), number of slice bytes transferred, number of slice bytes deleted, a timestamp, a user identifier, and a vault identifier. The updating can include one or more of identifying the one or more affiliated entities, determining a byte-hour adjustment (i.e., up or down) based on a transaction record, and updating a byte-hour record for affiliated entities based on the byte-hour adjustment.
    Type: Application
    Filed: October 27, 2016
    Publication date: July 6, 2017
    Inventors: Bart R. Cilfone, Adam M. Gray, Scott M. Horan, Wesley B. Leggette, Jason K. Resch, Shikha Shree, Ilya Volvovski
  • Publication number: 20170031752
    Abstract: A method begins by a processing module determining, by a first storage unit, that a storage growth rate is unfavorable for the first storage unit over an estimated time frame of reallocating at least a portion of encoded data slices stored in the first storage unit to one or more additional storage units. The method continues with the processing module when the storage growth rate is unfavorable, selecting an unfavorable growth rate abatement approach such that estimated required storage capacity is less than available storage capacity of the first storage unit for the estimated time frame of the reallocation of the at least a portion of encoded data slices. The method continues with the processing module facilitating implementation of the unfavorable growth rate abatement approach.
    Type: Application
    Filed: May 2, 2016
    Publication date: February 2, 2017
    Inventors: Bart R. Cilfone, Ravi V. Khadiwala, Niall J. McShane, Manish Motwani, Jason K. Resch, Shikha Shree