Patents by Inventor Manish Motwani

Manish Motwani 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).

  • Publication number: 20200304572
    Abstract: A method for execution by a dispersed storage and task (DST) processing unit includes determining a first optimal slice size requirement is determined for a first independent data element (IDE). The first IDE is split into a first plurality of IDEs based on determining the first IDE compares unfavorably to the first optimal slice size requirement. An error coding function is performed on the first plurality of IDEs to produce a set of encoded slices for each of the first plurality of IDEs for transmission to storage units. A subset of additional IDEs are selected to be merged into a merged IDE based on a second optimal slice size requirement, and continuous content of the subset of additional IDEs is concatenated to produce the merged IDE. The error coding function is performed on the merged IDE to produce a second set of encoded slices for transmission to storage units.
    Type: Application
    Filed: March 21, 2019
    Publication date: September 24, 2020
    Inventors: Jason K. Resch, Ram Narayanan, Andrew D. Baptist, Praveen Viraraghavan, Wesley B. Leggette, Ethan S. Wozniak, Manish Motwani, Bart R. Cilfone, Greg R. Dhuse
  • Publication number: 20200304573
    Abstract: A method for execution by a dispersed storage and task (DST) processing unit includes determining a first optimal slice size requirement is determined for a first independent data element (IDE). The first IDE is split into a first plurality of IDEs based on determining the first IDE compares unfavorably to the first optimal slice size requirement. An error coding function is performed on the first plurality of IDEs to produce a set of encoded slices for each of the first plurality of IDEs for transmission to storage units. A subset of additional IDEs are selected to be merged into a merged IDE based on a second optimal slice size requirement, and continuous content of the subset of additional IDEs is concatenated to produce the merged IDE. The error coding function is performed on the merged IDE to produce a second set of encoded slices for transmission to storage units.
    Type: Application
    Filed: September 16, 2019
    Publication date: September 24, 2020
    Inventors: Jason K. Resch, Ram Narayanan, Andrew D. Baptist, Praveen Viraraghavan, Wesley B. Leggette, Ethan S. Wozniak, Manish Motwani, Bart R. Cilfone, Greg R. Dhuse
  • Publication number: 20200225881
    Abstract: A method for execution by a storage unit in a dispersed storage network (DSN) includes selecting a storage zone of a memory device of the storage unit based on zone allocation parameters, and designating the selected storage zone as open for writes. A data slice is received via a network for storage. The data slice is written sequentially at a memory location of the one of storage zone based on determining that the storage zone is designated as open for writes. A pointer corresponding to the data slice that indicates the storage zone and the memory location is generated. A read request is received via the network from a requesting entity that indicates the data slice. The data slice is retrieved from the memory device based on the pointer, and is transmitted to the requesting entity.
    Type: Application
    Filed: March 30, 2020
    Publication date: July 16, 2020
    Inventors: Andrew D. Baptist, Manish Motwani, Praveen Viraraghavan, Ilya Volvovski
  • Patent number: 10693640
    Abstract: Systems and Methods for encrypting and decrypting data in a dispersed storage network are disclosed. A data object may be encrypted using a data object specific encryption key, a container specific encryption key, a tenant account specific encryption key, or a time based encryption key. This specific, or more generally, secondary encryption key can be derived from a master or primary encryption key. Encryption key metadata pertaining to the master encryption key and the specific encryption key is also created and stored in the DSN. When reading an encrypted data object, the master encryption key can be retrieved and, along with the encryption key metadata, used to derive the specific encryption key. The specific encryption key can then be used to decrypt the encrypted data object to recover the data object.
    Type: Grant
    Filed: March 17, 2017
    Date of Patent: June 23, 2020
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Adam M. Gray, Harsha Hegde, Wesley B. Leggette, Manish Motwani, Jason K. Resch, Daniel J. Scholl, Mark D. Seaborn, Rohan P. Shah, Yogesh R. Vedpathak
  • Patent number: 10678450
    Abstract: A method begins by a processing module determining a priority access level of an encoded data slice stored on a memory device. The method continues by determining a soft failure level for the memory device, wherein the soft failure level includes a plurality of discrete usability levels with a highest usability level representing a maximum amount of usable memory, a second usability level representing a lower usability level than the highest usability level and a lowest usability level representing an unusable level when the usable memory is below a threshold. The method continues with the processing module determining whether to migrate the encoded data slice from the memory device based on the priority access level and the end-of-life memory level. The method continues with the processing module identifying another memory device. The method continues with the processing module facilitating migration of the encoded data slice to another memory device.
    Type: Grant
    Filed: October 30, 2018
    Date of Patent: June 9, 2020
    Assignee: PURE STORAGE, INC.
    Inventors: Gary W. Grube, Jason K. Resch, Timothy W. Markison, Ilya Volvovski, Manish Motwani
  • 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
  • Patent number: 10681138
    Abstract: A method begins by a processing module of a dispersed storage network (DSN) receiving content from a data source for storage in the DSN. The method continues with the processing module transforming the content into a plurality of formats of a set of set of formats according to a formatting scheme and dispersed storage error encoding each format of the plurality formats to produce a corresponding plurality of sets of encoded data slices. The method continues with the processing module generating a logical address for each format, and generating a corresponding plurality of sets of slice names for each logical address. The method continues with the processing unit facilitating storage of the corresponding set of encoded data slices in a set of storage units using the corresponding plurality of sets of slice names.
    Type: Grant
    Filed: November 15, 2018
    Date of Patent: June 9, 2020
    Assignee: PURE STORAGE, INC.
    Inventors: S. Christopher Gladwin, Jason K. Resch, Manish Motwani
  • Patent number: 10678622
    Abstract: Monitoring the health status of a distributed storage network (DSN) and scheduling maintenance tasks relating to identified memory failures. In various examples, monitoring the health status of the DSN can include obtaining status information regarding storage units of the DSN and, based thereon, determining that memory of one or more of the storage units requires repair. Physical locations for identified storage units are determined, as well as the level of data loss risk associated with encoded data stored in the storage units. Based on this information, a repair plan is generated for and issued to the identified storage units. A repair plan may include, for example, an ordered list of maintenance tasks that are prioritized to balance data loss risk considerations with repair effort efficiency considerations. The maintenance tasks may be mapped to available service operators for performing the desired repairs (e.g., based on physical locations of the storage units).
    Type: Grant
    Filed: February 7, 2017
    Date of Patent: June 9, 2020
    Assignee: PURE STORAGE, INC.
    Inventors: Manish Motwani, Jason K. Resch
  • Patent number: 10678462
    Abstract: A method for execution by a dispersed storage and task (DST) execution unit includes generating location weight data that includes a plurality of location weights assigned to a plurality of memory devices of the DST execution unit. A first one of the plurality of memory devices and a second one of the plurality of memory devices are selected for reallocation based on the location weight data. The reallocation is executed by removing a data slice from the first one of the plurality of memory devices and storing the data slice in the second one of the plurality of memory devices.
    Type: Grant
    Filed: January 28, 2019
    Date of Patent: June 9, 2020
    Assignee: PURE STORAGE, INC.
    Inventors: Andrew D. Baptist, Ravi V. Khadiwala, Manish Motwani, Jason K. Resch, Trevor J. Vossberg, Ethan S. Wozniak
  • Patent number: 10671326
    Abstract: A storage unit (SU) in a dispersed storage network (DSN) coordinates with affiliated dispersed storage units (SUs) to designate a leader SU among the plurality of SUs and when the SU is designated the leader, receives management information that is associated with the affiliated SUs from at least some of the affiliated SUs. The SU processes the management information from the at least some of the affiliated SUs to determine whether at least one of the affiliated SUs is offline; and based on a determination that the at least one of the SUs of the affiliated SUs is offline, transmits the management information for the affiliated SUs to one or more administrators associated with the DSN.
    Type: Grant
    Filed: August 1, 2018
    Date of Patent: June 2, 2020
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Bart R. Cilfone, Alan M. Frazier, Patrick A. Tamborski, Sanjaya Kumar, Manish Motwani
  • Patent number: 10666596
    Abstract: A method for processing partial tasks in a distributed storage network (DSN) includes receiving a partial task request message for a DS execution unit, where the partial task request message includes corresponding partial tasks. The method continues by processing each partial task request message in accordance with the processing parameters to produce task request slice groupings, generating slices, such that each message is directed at a corresponding DS execution unit, and the sending the slice groupings and the task request slice groupings to the selected DS execution units for storage therein. The method continues by retrieving at least a decode threshold number of task response slices of one or more task response slice groupings from the DS execution units, decoding the task response slices, retrieving at least a decode threshold number of partial result slices, and decoding the partial results slices and processing the partial results to produce a result.
    Type: Grant
    Filed: May 9, 2019
    Date of Patent: May 26, 2020
    Assignee: PURE STORAGE, INC.
    Inventors: Wesley B. Leggette, Andrew D. Baptist, Greg R. Dhuse, Jason K. Resch, Ilya Volvovski, Manish Motwani, S. Christopher Gladwin, Gary W. Grube, Thomas F. Shirley, Jr.
  • Publication number: 20200145511
    Abstract: A method includes receiving, by a first computing device, a data access request from a client device, where the first computing device is aware of geographical locations of other computing devices, and where the data access request includes a client geographical location header and a redirection count header. When the redirection count header is higher than a redirection count threshold, the method includes processing the data access request. When the redirection count header is lower than the redirection count threshold, the method includes determining an optimal computing device to process the data access request. When the optimal computing device is geographically closer to the first computing device than the client device, the method includes, proxying the data access request to the optimal computing device. When the optimal computing device is geographically closer to the client device, the method includes sending a redirect response to the client device.
    Type: Application
    Filed: November 5, 2018
    Publication date: May 7, 2020
    Inventors: Adam M. Gray, Manish Motwani, Ravi V. Khadiwala, Jason K. Resch, Yogesh R. Vedpathak
  • Patent number: 10642532
    Abstract: A method for execution by a storage unit in a dispersed storage network (DSN) includes selecting a storage zone of a memory device of the storage unit based on zone allocation parameters, and designating the selected storage zone as open for writes. A data slice is received via a network for storage. The data slice is written sequentially at a memory location of the one of storage zone based on determining that the storage zone is designated as open for writes. A pointer corresponding to the data slice that indicates the storage zone and the memory location is generated. A read request is received via the network from a requesting entity that indicates the data slice. The data slice is retrieved from the memory device based on the pointer, and is transmitted to the requesting entity.
    Type: Grant
    Filed: February 28, 2017
    Date of Patent: May 5, 2020
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Andrew D. Baptist, Manish Motwani, Praveen Viraraghavan, Ilya Volvovski
  • Patent number: 10635536
    Abstract: A method for execution by a device of a dispersed storage network (DSN) to access a set of encoded data slices. The method begins by performing a first distributed agreement protocol (DAP) function using a slice identifier and a first set of coefficients to identify a set of storage units. The method continues by performing a second DAP function using the slice identifier and a second set of coefficients to identify pillar numbers for the set of storage units. The method continues by sending a set of data access requests to the set of storage units in accordance with the pillar numbers, wherein a data access request of the set of data access requests includes a slice name for a corresponding one of the set of encoded data slices and wherein the slice name includes one of the pillar numbers.
    Type: Grant
    Filed: March 23, 2017
    Date of Patent: April 28, 2020
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Andrew D. Baptist, Wesley B. Leggette, Manish Motwani, Jason K. Resch, Ethan S. Wozniak
  • Patent number: 10628245
    Abstract: A method for distributed monitoring of storage units of a dispersed storage network (DSN) including a plurality of sets of storage units. A managing unit of the DSN obtains configuration information relating to the DSN storage resources and selects a target storage unit to be monitored. The managing unit also determines a number of other storage units to be used in monitoring the target storage unit. Selection of the monitoring storage units includes determining, for each of a plurality of storage units of the DSN, an estimated failure correlation level with the target storage unit. Based at least in part on this information, the determined number of storage units are selected and assigned to monitor the target storage unit. The managing unit subsequently receives status information, relating to the target storage unit, from the monitoring storage units.
    Type: Grant
    Filed: July 9, 2018
    Date of Patent: April 21, 2020
    Assignee: PURE STORAGE, INC.
    Inventors: Bart R. Clifone, Jason K. Resch, Manish Motwani, Wesley B. Leggette
  • Patent number: 10585748
    Abstract: A method begins by a computing device of a dispersed storage network (DSN) maintaining a queue of pending requests to access the DSN while new requests are added to the queue and executed requests are deleted from the queue. The method continues by the computing device determining, for each pending request in the queue, a prioritization score to produce a plurality of prioritization scores. The prioritization score is determined by determining an identity of a requestor associated with a pending request, obtaining a trust score based on the requestor's identity, and obtaining a compliance score based on the requestor's identity. The trust score indicates the requestor's level of legitimate use of the DSN and the compliance score indicates the requestor's level of compliance with DSN system requests. The method continues by the computing device executing pending requests of the queue in accordance with the plurality of prioritization scores.
    Type: Grant
    Filed: September 29, 2017
    Date of Patent: March 10, 2020
    Assignee: International Business Machines Corporation
    Inventors: Andrew D. Baptist, Bart R. Cilfone, Greg R. Dhuse, Harsha Hegde, Wesley B. Leggette, Manish Motwani, Jason K. Resch, Ilya Volvovski, Ethan S. Wozniak
  • Patent number: 10585715
    Abstract: A processing system in a dispersed storage and a task (DST) network operates by receiving data and a corresponding task; identifying candidate DST execution units for executing partial tasks of the corresponding task; receiving distributed computing capabilities of the candidate DST execution units; selecting a subset of DST execution units of the candidate DST execution units to favorably execute the partial tasks of the corresponding task; determining task partitioning of the corresponding task into the partial tasks based on one or more of the distributed computing capabilities of the subset of DST execution units; determining processing parameters of the data based on the task partitioning; partitioning the tasks based on the task partitioning to produce the partial tasks; processing the data in accordance with the processing parameters to produce slice groupings; and sending the slice groupings and the partial tasks to the subset of DST execution units.
    Type: Grant
    Filed: April 9, 2019
    Date of Patent: March 10, 2020
    Assignee: PURE STORAGE, INC.
    Inventors: Andrew D. Baptist, Greg R. Dhuse, S. Christopher Gladwin, Gary W. Grube, Wesley B. Leggette, Manish Motwani, Jason K. Resch, Thomas F. Shirley, Jr., Ilya Volvovski
  • Patent number: 10579309
    Abstract: A method is provided for increasing throughput in a distributed storage network (DSN). A storage unit (SU) of the DSN receives a set of access requests regarding a set of encoded data slices and determines whether processing one or more access requests from the set of access requests can be delayed. Based on performance information regarding the one or more access requests the SU queues the requests and delays the processing of the requests in order to achieve higher throughput.
    Type: Grant
    Filed: February 16, 2017
    Date of Patent: March 3, 2020
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Andrew D. Baptist, Greg R. Dhuse, Manish Motwani, Jason K. Resch, Praveen Viraraghavan, Ilya Volvovski, Ethan S. Wozniak
  • Patent number: 10567509
    Abstract: A method by a computing device of a dispersed storage network (DSN) begins by determining whether alternate form data (AFD) exists for a data object. When the alternate form data does not exist, the method continues by identifying a content derivation function in accordance with an AFD policy of the DSN. The method continues by identifying a portion of the data object based on the content derivation function and identifying one or more sets of encoded data slices of a plurality of sets of encoded data slices corresponding to the portion of the data object. The method continues by generating at least a portion of the AFD based on the one or more sets of encoded data slices. The method continues by storing the at least a portion of the AFD within memory of the DSN in accordance with a storage approach.
    Type: Grant
    Filed: May 15, 2017
    Date of Patent: February 18, 2020
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Wesley B. Leggette, Manish Motwani, Brian F. Ober, Jason K. Resch
  • Publication number: 20200042382
    Abstract: A storage unit (SU) in a dispersed storage network (DSN) coordinates with affiliated dispersed storage units (SUs) to designate a leader SU among the plurality of SUs and when the SU is designated the leader, receives management information that is associated with the affiliated SUs from at least some of the affiliated SUs. The SU processes the management information from the at least some of the affiliated SUs to determine whether at least one of the affiliated SUs is offline; and based on a determination that the at least one of the SUs of the affiliated SUs is offline, transmits the management information for the affiliated SUs to one or more administrators associated with the DSN.
    Type: Application
    Filed: August 1, 2018
    Publication date: February 6, 2020
    Inventors: Bart R. Cilfone, Alan M. Frazier, Patrick A. Tamborski, Sanjaya Kumar, Manish Motwani