Patents by Inventor Daniel J. Scholl

Daniel J. Scholl 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: 20190347005
    Abstract: A method begins with a computing device of a distributed storage network (DSN) being designated to process a write request from a Decentralized, or Distributed, Agreement Protocol (DAP) and continues with the computing device retrieving a current policy for the storage units (SUs) associated with the write request, where the current policy specifies the current connectivity for the SUs. The method continues by using the current policy to configure a data structure to process the write request, where the data structure is based on scaling triggers and a load balancing scheme. The method continues with the data structure incorporating a primary queue and scaling the addition of secondary queues based on the scaling triggers and/or the load balancing scheme.
    Type: Application
    Filed: May 11, 2018
    Publication date: November 14, 2019
    Inventors: Amit H. Lamba, Daniel J. Scholl, Jason K. Resch, Brian F. Ober
  • Publication number: 20190339893
    Abstract: A method for execution by a container instance manager (CIM) includes determining to create a new instance of a first data container, where the first data container is stored in a first memory location. Creation of the new instance of the first data container for storage in a second memory location is facilitated in response to the determining to create the new instance. The method further includes determining to remove a duplicate instance of a second data container. Deletion of the duplicate instance of the second data container from memory is facilitated in response to the determining to remove the duplicate instance.
    Type: Application
    Filed: July 22, 2019
    Publication date: November 7, 2019
    Inventors: Rohan P. Shah, Harsha Hegde, Wesley B. Leggette, Daniel J. Scholl, Jason K. Resch, Yogesh R. Vedpathak, Manish Motwani
  • Patent number: 10467095
    Abstract: A method includes identifying, by a computing device of a dispersed storage network (DSN), a delegate device of a plurality of delegate devices of the DSN for processing a change to a node of a plurality of nodes of a hierarchical index structure. The method further includes sending, by the computing device, a change type specific request to the delegate device regarding the change to the node. The method further includes determining, by the delegate device, whether the delegate device is responsible for executing the change type specific request. When the delegate device is responsible for executing the change type specific request, the method further includes sending, by the delegate device, a response message to the computing device indicating that the delegate device is responsible for executing the change type specific request. The method further includes executing, by the delegate device, the change type specific request.
    Type: Grant
    Filed: October 26, 2016
    Date of Patent: November 5, 2019
    Assignee: Pure Storage, Inc.
    Inventors: Greg R. Dhuse, Adam M. Gray, Scott M. Horan, Ravi V. Khadiwala, Tyler K. Reid, Daniel J. Scholl, Ilya Volvovski
  • Publication number: 20190332475
    Abstract: A method includes registering, by a first computing device, with a distributed storage network (DSN) to indicate that a first storage site is connected via a common local area network with the first computing device and is the primary storage site for the first computing device. The method continues with the first computing device to store a write threshold number of encoded data slices (EDSs) to the first storage site, obtaining a first writing pattern for writing the write threshold number of EDSs to the first plurality of storage units, and transmitting at least a portion of a remaining number of EDSs to one or more storage units at a second storage site, where the remaining number of EDSs are EDSs not included in the write threshold number of EDSs and the second storage site and the first storage site are each one of a sharing group of storage sites.
    Type: Application
    Filed: July 11, 2019
    Publication date: October 31, 2019
    Inventors: Thomas Dubucq, Daniel J. Scholl
  • Patent number: 10423359
    Abstract: A method for execution by one or more processing modules of one or more computing devices of a dispersed storage network (DSN). The method begins by receiving a data access requests with regards to a data object. The method continues by identifying a vault set based on the data access request, where a plurality of storage vaults includes the vault set. The method continues by obtaining configuration information associated with the vault set and determining whether to process the data access request based on the obtained configuration information associated with the vault set.
    Type: Grant
    Filed: December 11, 2017
    Date of Patent: September 24, 2019
    Assignee: PURE STORAGE, INC.
    Inventors: Adam M. Gray, Greg R. Dhuse, Andrew D. Baptist, Ravi V. Khadiwala, Wesley B. Leggette, Scott M. Horan, Franco V. Borich, Bart R. Cilfone, Daniel J. Scholl
  • Patent number: 10394650
    Abstract: A method includes utilizing, by a first computing device, a first writing pattern to write a set of encoded data slices to a sharing group of sites. The first writing pattern includes writing a write threshold number of encoded data slices to storage units of a first site and writing a remaining number of encoded data slices to another storage unit(s) in another site(s). The method further includes sending, by storage units of the first site, encoded data slices of up to the write threshold number to other storage units in accordance with an inter-site storage unit relationship. The method further includes, when indicating in the inter-site storage unit relationship, sending, by storage unit(s) of the other site(s), encoded data slices of the remaining number of encoded data slices to other storage units in accordance with the inter-site storage unit relationship.
    Type: Grant
    Filed: June 3, 2016
    Date of Patent: August 27, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Thomas Dubucq, Daniel J. Scholl
  • Patent number: 10387382
    Abstract: Methods and systems for estimating a number of entries in a dispersed hierarchical index. The method and systems involve determining a number of random walks N to perform on the dispersed hierarchical index, conducting N walkthroughs based on the number of walkthroughs, determining a number of walk entries for each of the N random walks and averaging the number of walk entries for each of the N random walks to produce an estimated total number of entries for the dispersed hierarchical index. The determining may be based on one or more of a number of levels, a desired confidence interval, a predetermination, and interpretation of system registry information, and an interpretation of a request. Each random walk starts at a root node and ends at a leaf node through L levels of the dispersed hierarchical index.
    Type: Grant
    Filed: October 27, 2016
    Date of Patent: August 20, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Greg R. Dhuse, Kevin M. Freese, Jason K. Resch, Daniel J. Scholl, Ethan S. Wozniak
  • Patent number: 10387252
    Abstract: A method begins with a processing module obtaining a data object from a user and identifying a plurality of virtual storage vaults (VSVs) for storage of the data object. The method continues with the processing module determining dispersal error encoding parameters associated with a first virtual storage vault and error encoding the data object in accordance with those dispersal error encoding parameters to produce a corresponding plurality of sets of encoded data slices (EDSs), issuing write slice requests for the EDSs and receiving EDS information from at least some of the plurality of VSVs. When the EDS information indicates that a threshold number of VSVs have successfully stored the plurality of sets of encoded data slices within a synchronization timeframe, the method continues with the processing module issuing a favorable response to the user, or when a threshold number of VSVs have not successfully stored the plurality of sets of encoded data slices initiating a retry process.
    Type: Grant
    Filed: July 27, 2017
    Date of Patent: August 20, 2019
    Assignee: PURE STORAGE, INC.
    Inventors: Adam M. Gray, Greg R. Dhuse, Andrew D. Baptist, Ravi V. Khadiwala, Wesley B. Leggette, Scott M. Horan, Franco V. Borich, Bart R. Cilfone, Daniel J. Scholl
  • Patent number: 10379961
    Abstract: A method for execution by one or more processing modules of one or more computing devices of a dispersed storage network (DSN), the method begins by, receiving a write data object request and writing and committing the data object as a set of encoded data slices into DSN memory. The method continues by writing and committing an index consistency write-intent to DSN memory. The method continues by writing metadata of the data object to DSN memory. The method continues by write and committing an index entry to DSN memory. The method continues, during a finalization of the index consistency write-intent, by executing the index consistency write-intent to ensure consistency between the metadata of the data object and metadata located in the index entry.
    Type: Grant
    Filed: April 11, 2017
    Date of Patent: August 13, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Daniel J. Scholl, Jeremy S. Jarczyk, Wesley B. Leggette, Jason K. Resch, Yogesh R. Vedpathak, Manish Motwani, Tyler K. Reid
  • Patent number: 10379942
    Abstract: A method includes determining to transfer a data object from a first container of a vault to a second container of the vault. The method further includes determining first and second storage parameters for the first and second containers, respectively. When the first storage parameters substantially match the second storage parameters, the method further includes retrieving metadata of the data object from a first container structure associated with the first container. The method further includes modifying the metadata regarding the transferring of the data object from the first container to the second container to produce modified metadata. The method further includes adding the modified metadata to a second container structure associated with the second container such that the data object is accessible via the second container.
    Type: Grant
    Filed: September 27, 2017
    Date of Patent: August 13, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Harsha Hegde, Lakshmi Krishna Priya Kala, Wesley B. Leggette, Manish Motwani, Jason K. Resch, Daniel J. Scholl, Rohan P. Shah, Yogesh R. Vedpathak
  • Publication number: 20190146711
    Abstract: A method includes, during a given time interval, receiving a plurality of write requests regarding updates to an object, creating a plurality of write intent messages for the plurality of write requests, dispersed storage error encoding the plurality of write intent messages to produce a plurality of sets of encoded intent slices, and sending the plurality of sets of encoded intent slices to a set of storage units of the DSN for storage therein. The method further includes, after expiration of the given time interval, categorizing each write intent message of the plurality of write intent messages with respect to other write intent messages of the plurality of write intent messages, where a write intent message is categorized as complimentary, non-compete, or compete, creating a single write command that encompasses complimentary and non-compete write intent messages, and executing the single write command on the object to produce an updated object.
    Type: Application
    Filed: November 14, 2017
    Publication date: May 16, 2019
    Inventors: Daniel J. Scholl, Ravi V. Khadiwala, Greg R. Dhuse
  • Publication number: 20190138385
    Abstract: A method for execution by a dispersed storage (DS) cleanup unit includes determining a dead session of a DSN. A subset of a plurality of eventual consistency intent names is generated by identifying eventual consistency intent names that include a session identifier corresponding to the dead session in a prefix of the eventual consistency intent names, where the subset of the plurality of eventual consistency intent names corresponds to all eventual consistency intents of the dead session. A subset of storage units responsible for storing the all eventual consistency intents of the dead session is determined based on the prefix of the eventual consistency intent names in the subset. All eventual consistency intents of the dead session are retrieved from the subset of storage units, and execution of eventual consistency updates indicated in the all eventual consistency intents of the dead session is facilitated.
    Type: Application
    Filed: January 7, 2019
    Publication date: May 9, 2019
    Inventors: Ravi V. Khadiwala, Manish Motwani, Renars W. Narubin, Jason K. Resch, Daniel J. Scholl, Yogesh R. Vedpathak
  • Patent number: 10248495
    Abstract: A method for execution by a dispersed storage (DS) cleanup unit includes determining a dead session of a DSN. A subset of a plurality of eventual consistency intent names is generated by identifying eventual consistency intent names that include a session identifier corresponding to the dead session in a prefix of the eventual consistency intent names, where the subset of the plurality of eventual consistency intent names corresponds to all eventual consistency intents of the dead session. A subset of storage units responsible for storing the all eventual consistency intents of the dead session is determined based on the prefix of the eventual consistency intent names in the subset. All eventual consistency intents of the dead session are retrieved from the subset of storage units, and execution of eventual consistency updates indicated in the all eventual consistency intents of the dead session is facilitated.
    Type: Grant
    Filed: February 17, 2017
    Date of Patent: April 2, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Ravi V. Khadiwala, Manish Motwani, Renars W. Narubin, Jason K. Resch, Daniel J. Scholl, Yogesh R. Vedpathak
  • Publication number: 20190095277
    Abstract: A method includes determining to transfer a data object from a first container of a vault to a second container of the vault. The method further includes determining first and second storage parameters for the first and second containers, respectively. When the first storage parameters substantially match the second storage parameters, the method further includes retrieving metadata of the data object from a first container structure associated with the first container. The method further includes modifying the metadata regarding the transferring of the data object from the first container to the second container to produce modified metadata. The method further includes adding the modified metadata to a second container structure associated with the second container such that the data object is accessible via the second container.
    Type: Application
    Filed: September 27, 2017
    Publication date: March 28, 2019
    Inventors: Harsha Hegde, Lakshmi Krishna Priya Kala, Wesley B. Leggette, Manish Motwani, Jason K. Resch, Daniel J. Scholl, Rohan P. Shah, Yogesh R. Vedpathak
  • Patent number: 10241677
    Abstract: A storage unit (SU) includes an interface configured to interface and communicate with a dispersed storage network (DSN), a memory that stores operational instructions, and a processing module operably coupled to the interface and memory such that the processing module, when operable within the SU based on the operational instructions, is configured to perform various operations. The SU stores at least one encoded data slice (EDS) of first EDSs corresponding to a data object that are distributedly stored in first SUs and also an intent message that includes specifications for consistency between the data object and metadata of the data object. A second set of EDSs corresponding to the metadata are distributedly stored in second SUs. The SU services the intent message to determine consistency of the data object and the metadata based on the specifications and deletes the intent message when they are consistent.
    Type: Grant
    Filed: February 24, 2017
    Date of Patent: March 26, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Thomas Dubucq, Jeremy S. Jarczyk, Ravi V. Khadiwala, Manish Motwani, Renars W. Narubin, Jason K. Resch, Daniel J. Scholl, Yogesh R. Vedpathak
  • Publication number: 20190050290
    Abstract: A method includes identifying a fallback delegate device of a plurality of delegate devices for changing one or more nodes of a plurality of nodes of a hierarchical index structure, where a primary delegate device of the plurality of delegate devices is responsible for changing the one or more nodes and where each delegate device of a plurality of delegate devices is assigned an individual global namespace address that is partially based on a location within the DSN. The method further includes determining to process a change to a node of the one or more nodes using the fallback delegate device.
    Type: Application
    Filed: October 15, 2018
    Publication date: February 14, 2019
    Inventors: Greg R. Dhuse, Adam M. Gray, Scott M. Horan, Ravi V. Khadiwala, Tyler K. Reid, Jason K. Resch, Daniel J. Scholl, Ilya Volvovski
  • Patent number: 10176044
    Abstract: A method includes determining that a primary delegate device is unavailable. The method continues by identifying a fallback delegate device for changing a node of a hierarchical index structure using a deterministic function. The deterministic function includes performing a first modification of global namespace address of the unavailable primary delegate device to produce a first modified address identifier. The deterministic function further includes determining whether another delegate device of the plurality of delegate devices has a global namespace address corresponding to the first modified address identifier. When the global namespace address of other delegate device corresponds to the first modified address identifier, the method further includes processing a change to a node of the one or more nodes via the other delegate device as the fallback delegate device.
    Type: Grant
    Filed: October 26, 2016
    Date of Patent: January 8, 2019
    Assignee: International Business Machines Corporation
    Inventors: Greg R. Dhuse, Adam M. Gray, Scott M. Horan, Ravi V. Khadiwala, Tyler K. Reid, Jason K. Resch, Daniel J. Scholl, Ilya Volvovski
  • Publication number: 20190004725
    Abstract: A method for execution by a container instance manager (CIM) includes determining to create a new instance of a first data container, where the first data container is stored in a first memory location. Creation of the new instance of the first data container for storage in a second memory location is facilitated in response to the determining to create the new instance. The method further includes determining to remove a duplicate instance of a second data container. Deletion of the duplicate instance of the second data container from memory is facilitated in response to the determining to remove the duplicate instance.
    Type: Application
    Filed: June 28, 2017
    Publication date: January 3, 2019
    Inventors: Rohan P. Shah, Harsha Hegde, Wesley B. Leggette, Daniel J. Scholl, Jason K. Resch, Yogesh R. Vedpathak, Manish Motwani
  • Publication number: 20180293266
    Abstract: A method for execution by one or more processing modules of one or more computing devices of a dispersed storage network (DSN), the method begins by, receiving a write data object request and writing and committing the data object as a set of encoded data slices into DSN memory. The method continues by writing and committing an index consistency write-intent to DSN memory. The method continues by writing metadata of the data object to DSN memory. The method continues by write and committing an index entry to DSN memory. The method continues, during a finalization of the index consistency write-intent, by executing the index consistency write-intent to ensure consistency between the metadata of the data object and metadata located in the index entry.
    Type: Application
    Filed: April 11, 2017
    Publication date: October 11, 2018
    Inventors: Daniel J. Scholl, Jeremy S. Jarczyk, Wesley B. Leggette, Jason K. Resch, Yogesh R. Vedpathak, Manish Motwani, Tyler K. Reid
  • Publication number: 20180270060
    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: Application
    Filed: March 17, 2017
    Publication date: September 20, 2018
    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