Pure Storage Assigned Twenty Patents

Storage unit, (SU) report cards
Pure Storage, Inc., Mountain View, CA, has been assigned a patent (10,404,410) developed by Resch, Jason K., Chicago, IL, and Wozniak, Ethan S., Park Ridge, IL, for “storage unit, (SU) report cards.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A computing device includes an interface configured to interface and communicate with a dispersed storage network, DSN, a memory that stores operational instructions, and processing circuitry operably coupled to the interface and to the memory. The processing circuitry is configured to execute the operational instructions to perform various operations and functions. The computing device maintain memory ranking information for a set of storage units, (SUs) and receives a read data request. The computing device selects a decode threshold number and/or a read threshold number of SUs to service the read data request based on the memory ranking information. The computing device recovers the data segment and transmits a read data response that is based on the processing the read data request.”

The patent application was filed on December 12, 2017 (15/839,639).

Sliding windows for batching index updates
Pure Storage, Inc., Mountain View, CA, has been assigned a patent (10,402,423) developed by Dhuse, Greg R., and Resch, Jason K., Chicago, IL, for a “sliding windows for batching index updates.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A computing device includes an interface configured to interface and communicate with a dispersed storage network, DSN, a memory that stores operational instructions, and processing circuitry operably coupled to the interface and to the memory. The processing circuitry is configured to execute the operational instructions to perform various operations and functions. The computing device determines a performance level that is based on updating of an index node that is associated with distributed storage within the DSN of a set of encoded data slices, (EDSs) that is associated with a data object. When the computing device determines to modify an index node update time period based on the performance level that is based on the updating of the index node, the computing device further determines whether to shorten or lengthen the index node update time period and selectively/adaptively performs such shorten or lengthen operations based on such determination.”

The patent application was filed on April 25, 2018 (15/962,923).

Facilitating data consistency in dispersed storage network
Pure Storage, Inc., Mountain View, CA, has been assigned a patent (10,402,395) developed by Resch, Jason K., Chicago, IL, Baptist, Andrew D., Mt. Pleasant, WI, McShane, Niall J., Arlington Heights, IL, Dhuse, Greg R., Chicago, IL, Shirley, Jr., Thomas F., Wauwatosa, WI, Palinckx, Gregory, Cherry Hills Village, CO, Kennedy, Russell P., Boulder, CO, Gladwin, S. Christopher, Chicago, IL, McCammon, Robert C., Downer Grove, IL, and Sherer, James, Lake Zurich, IL, for a “facilitating data consistency in a dispersed storage network.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A method for execution by a dispersed storage and task, (DST) processing unit that includes a processor includes determining to access a set of storage units, identifying an information dispersal algorithm, (IDA) width and a decode threshold number associated with the set of storage units, determining a number of available storage units of the set of storage units, determining a write threshold number and a read threshold number based on the number of available storage units and in accordance with a consistency approach, and accessing at least some of the available storage units utilizing at least one of the write and read threshold numbers.”

The patent application was filed on May 14, 2018 (15/978,596).

Slice migration in dispersed storage network
Pure Storage, Inc., Mountain View, CA, has been assigned a patent (10,402,393) developed by Dhuse, Greg R., and Resch, Jason K., Chicago, IL, for a “slice migration in a dispersed storage network.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A method for use by a source storage unit of a dispersed storage network includes identifying a slice name corresponding to a slice to migrate from a source storage unit to a destination storage unit, sending the slice to migrate to the destination storage unit, generating a slice verification request and sending the slice verification request to the destination storage unit, receiving an integrity value from the destination storage unit, and determining when the integrity value compares favorably to the slice verification request. When the source storage unit determines that the integrity value compares favorably to the slice verification request, a slice name assignment associated with the slice name is updated and the slice is deleted from the source storage unit.”

The patent application was filed on August 1, 2016 (15/225,476).

Overcoming bottlenecks in zero information gain, rebuild operations
Pure Storage, Inc., Mountain View, CA, has been assigned a patent (10,402,271) developed by Viraraghavan, Praveen, and Resch, Jason K., Chicago, IL, for an “overcoming bottlenecks in zero information gain, (ZIG) rebuild operations.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”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 processing circuitry operably coupled to the interface and to the memory. The SU determines to rebuild an encoded data slice, (EDS) of a set of EDSs based on a storage error of the EDS and selects combining units to enable rebuilding of the EDS. The SU also selects participating storage units, (SUs) that store at least the decode threshold number of EDSs and facilitates establishing pairwise encryption keys between appropriate components. The SU facilitates the combining units and the SU receiving encrypted representations of the decode threshold number of EDSs of the set of EDSs. The SU combines an encrypted combined partial slice and any additional encrypted representation to generate an encrypted rebuilt EDS and decrypts the encrypted rebuilt EDS to generate a rebuilt EDS.”

The patent application was filed on December 13, 2017 (15/840,999).

Deterministically determining affinity for source name range
Pure Storage, Inc., Mountain View, CA, has been assigned a patent (10,402,270) developed by Resch, Jason K., and Dhuse, Greg R., Chicago, IL, for a “deterministically determining affinity for a source name range.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”Systems and methods for storing encoded data slices in a dispersed storage network, (DSN) involve receiving a write data object request, determining a source name for the data object, identifying a source name range corresponding to the source name, and identifying a storage pattern associated with the source name range. Based on the source name range, a set of DS units can be identified as affinity DS units that correspond to the storage pattern. The data object is encoded to produce encoded affinity data slices which are output to the affinity DS units. A determination is made that an encoded data slice was improperly stored. One or more other encoded data slices corresponding to the data object may then be output to one or more DS units of the set of units other than the affinity DS units.”

The patent application was filed on November 6, 2017 (15/804,424).

Storing data in accordance with performance
Pure Storage, Inc., Mountain View, CA, has been assigned a patent (10,402,269) developed by Dhuse, Greg, Resch, Jason K., Chicago, IL, and Shirley, Jr., Thomas Franklin, Wauwalosa, WI, for a “storing data in accordance with a performance threshold.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A computer readable storage medium includes a first memory section that stores operational instructions that, when executed by a computing device of a dispersed storage network, (DSN), cause the computing device to, for a first phase of a multiple phase write operation, determine whether to send a write performance threshold number of write requests to storage units. When yes, a second memory section storing operational instructions causes the computing device to, send them to storage units. When no, a third memory section storing operational instructions causes the computing device to determine whether to change the write performance threshold number for a second phase of the multiple write operation. When the write performance threshold number is to be changed, change the write performance threshold number and send the changed write performance threshold number of write commit requests to a second subset of the set of storage units.”

The patent application was filed on September 12, 2018 (16/128,730).

Utilizing dispersed storage network access token module to acquire digital content
Pure Storage, Inc., Mountain View, CA, has been assigned a patent (10,402,268) developed by Grube, Gary W., Barrington Hills, IL, Markison, Timothy W., Mesa, AZ, Dhuse, Greg, Resch, Jason K., Volvovski, Ilya, Chicago, IL, and Leggette, Wesley, Oak Park, IL, for “utilizing a dispersed storage network access token module to acquire digital content from a digital content provider.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A method begins with a computing device receiving a request to acquire digital content from a digital content provider and forwarding the request to a dispersed storage network, (DSN) pre-paid module. The method continues with the DSN pre-paid module validating the request, generating a plurality of sets of at least a threshold number of digital content read requests, and sending the plurality of sets of the at least a threshold number of digital content read requests to the digital content provider via the computing device when the request to acquire the digital content is validated. The method continues with at least one of the DSN pre-paid module and the computing device receiving a plurality of sets of at least a decoded threshold number of encoded data slices and decoding the plurality of sets of the at least a decoded threshold number of encoded data slices to produce the digital content.”

The patent application was filed on January 10, 2012 (13/347,334).

Redundant array of independent disks in direct-mapped flash storage
Pure Storage, Inc., Mountain View, CA, has been assigned a patent (10,402,266) developed by Kirkpatrick, Peter E., and Karr, Ronald, Mountain View, CA, for a “redundant array of independent disks in a direct-mapped flash storage system.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”In one implementation, storage system includes embedded storage devices, where each embedded storage device includes a direct-mapped solid state drive, (SSD) storage portion and storage system controllers. The storage system controllers may be operatively coupled to the embedded storage devices via a bus. The storage system controllers may receive data to be written to the plurality embedded storage devices, select a plurality of available allocation units from the direct-mapped SSD storage portions of the plurality of embedded storage devices, respectively, and calculate a verification signature corresponding to the data. The storage system controllers may also write the data and the verification signature to a first subset of the plurality of available allocation units, calculate an erasure code corresponding to the data and the verification signature, and write the erasure code to a second subset of allocation units.”

The patent application was filed on July 31, 2017 (15/665,128).

Transferring encoded data slices in dispersed storage network
Pure Storage, Inc., Mountain View, CA, has been assigned a patent (10,402,122) developed by Resch, Jason K., and Motwani, Manish, Chicago, IL, for “transferring encoded data slices in a dispersed storage network.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A method for transferring encoded data slices from a first storage unit to a second storage unit begins by a processing module ascertaining a first mathematical process used to determine that the encoded data slices are to be stored in the first storage unit, where the first mathematical process includes a first mathematical function sequence and a first set of coefficients. The method continues with the processing module determining a second mathematical process, which indicates that the encoded data slices are to be stored in the second storage unit, where the second mathematical process corresponds to an adjustment of at least one of the first mathematical function sequence and the first set of coefficients. The method continues with the processing module transferring, based on a transfer command, the encoded data slices from the first storage unit to the second storage unit utilizing the second mathematical process.”

The patent application was filed on March 28, 2016 (15/082,887).

Updating distributed storage network software
Pure Storage, Inc., Mountain View, CA, has been assigned a patent (10,395,054) developed by Resch, Jason K., Chicago, IL, for “updating distributed storage network software.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A method begins by a management unit of a distributed storage network, (DSN) sending a software update notice to a plurality of dispersed storage, (DS) units, wherein the plurality of DS units supports a plurality of digital storage vaults, and wherein a set of DS units of the plurality of DS units supports a digital storage vault of the plurality of digital storage vaults. The method continues with a DS processing module determining an update strategy for updating software of the plurality of DS units such that at least a decode threshold number of DS units of the set of DS units is continually available to service access requests to the digital storage vault and updating the software of at least some of the plurality of DS units in accordance with the update strategy.”

The patent application was filed on May 4, 2012 (13/464,015).

Transferring task execution in distributed storage and task network
Pure Storage, Inc., Mountain View, CA, has been assigned a patent (10,394,613) developed by Grube, Gary W., Barrington Hills, IL, and Markison, Timothy W., Mesa, AZ, for “transferring task execution in a distributed storage and task network.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A method includes encoding a data object using an encoding matrix having a unity matrix portion to produce a plurality of sets of encoded data slices that includes data encoded slices and redundancy encoded slices. The method further includes dividing a task into a set of partial tasks. The method further includes determining processing speeds of a set of distributed storage and task, (DST) execution units allocated for storing the plurality of sets of encoded data slices. The method further includes mapping storage and partial task assignments regarding the data encoded slices of the plurality of sets of encoded data slices to the set of DST execution units based on the processing speeds. The method further includes outputting the data encoded slices of the plurality of sets of encoded data slices and the set of partial tasks to the set of DST execution units in accordance with the storage-task mapping.”

The patent application was filed on January 10, 2017 (15/402,346).

Multi-level stage locality selection on large system
Pure Storage, Inc., Mountain View, CA, has been assigned a patent (10,394,476) developed by Baptist, Andrew D., Mt. Pleasant, WI, Resch, Jason K., and Volvovski, Ilya, Chicago, IL, for a “multi-level stage locality selection on a large system.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A method for execution by a computing device of a dispersed storage network, (DSN). The method begins with obtaining a plurality of write requests. The method continues where for a write request of the plurality of write requests, the computing device generates a vault identification and a generation number. The method continues where the computing device obtains a rounded timestamp and a capacity factor and generates a temporary object number based on the rounded timestamp and the capacity factor. The method continues where the computing device generates a temporary source name based on the vault identification, the generation number, and the temporary object number. The method continues where the computing device identifies a set of storage units of a plurality of sets of storage units of the DSN based on the temporary source name.”

The patent application was filed on August 8, 2017 (15/671,670).

Determining how to service requests based on several indicators
Pure Storage, Inc., Mountain View, CA, has been assigned a patent (10,389,845) developed by Resch, Jason K., Chicago, IL, for “determining how to service requests based on several indicators.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A method for execution by a dispersed storage, (DST) processing module includes receiving a data request. An estimated performance level is determined for each of a set of data access approaches, and one data access approach is selected. A data response that includes direction information is issued to the requesting entity when the selected approach includes directing the requesting entity to access an alternate DS processing module. The data object is recovered and a data response is issued to the requesting entity when the selected approach includes accessing the set of DS units directly. A redirect request is issued to the alternate DS processing module when the selected approach includes redirecting the data request, and the alternate DS processing module obtains and issues the data object. A data response is issued to the requesting entity when the alternate DS processing module issues the data object via a redirect response.”

The patent application was filed on August 28, 2017 (15/688,162).

Prioritizing memory devices to replace based on namespace health
Pure Storage, Inc., Mountain View, CA, has been assigned a patent (10,389,814) developed by Cocagne, Thomas D., Elk Grove Village, IL, for “prioritizing memory devices to replace based on namespace health.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A computing device includes an interface configured to interface and communicate with a dispersed storage network, DSN, a memory that stores operational instructions, and processing circuitry operably coupled to the interface and to the memory. The processing circuitry is configured to execute the operational instructions to perform various operations and functions. The computing device detects memory error(s) associated with a plurality of sets of memory devices of sets of storage unit(s), SU(s)) within the DSN that distributedly store a set of encoded data slices, (EDSs). The computing device facilitates detection of EDS error(s) associated with the memory error(s). For a set of memory devices, the computing device establishes a corresponding memory replacement priority level and facilitates replacement of corresponding memory device(s) associated with the EDS error(s) based on the corresponding memory replacement priority level.”

The patent application was filed on December 13, 2017 (15/840,508).

Data reduction with end-to-end security
Pure Storage, Inc., Mountain View, CA, has been assigned a patent (10,387,661) developed by Davis, John D., San Francisco, CA, Irwin, Jonas R., Livermore, CA, and Miller, Ethan L., Santa Cruz, CA, for a “data reduction with end-to-end security.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A storage controller coupled to a storage array comprising one or more storage devices receives a request to write encrypted data to a volume resident on a storage array, where the encrypted data comprises data encrypted by a first encryption key that is associated with at least one property of the data. The storage controller determines a decryption key to decrypt the encrypted data, decrypts the encrypted data using the decryption key, performs at least one data reduction operation on the decrypted data, encrypts the reduced data using a second encryption key to generate a second encrypted data, and storing the second encrypted data on the storage array.”

The patent application was filed on January 9, 2017 (15/402,195).

Distributed storage integrity processing
Pure Storage, Inc., Mountain View, CA, has been assigned a patent (10,387,256) developed by Dhuse, Greg, Chicago, IL, Baptist, Andrew, Mt. Pleasant, WI, Mark, Zachary J., Resch, Jason K., and Volvovski, Ilya, Chicago, IL, for “method and apparatus for distributed storage integrity processing.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A distributed storage integrity system in a dispersed storage network includes a scanning agent and a control unit. The scanning agent identifies an encoded data slice that requires rebuilding, wherein the encoded data slice is one of a plurality of encoded data slices generated from a data segment using an error encoding dispersal function. The control unit retrieves at least a number T of encoded data slices needed to reconstruct the data segment based on the error encoding dispersal function. The control unit is operable to reconstruct the data segment from at least the number T of the encoded data slices and generate a rebuilt encoded data slice from the reconstructed data segment. The scanning agent is located in a storage unit and the control unit is located in the storage unit or in a storage integrity processing unit, a dispersed storage processing unit or a dispersed storage managing unit.”

The patent application was filed on June 2, 2017 (15/612,243).

Synchronously storing data in plurality of dispersed storage networks
Pure Storage, Inc., Mountain View, CA, has been assigned a patent (10,387,252) developed by Gray, Adam M., Dhuse, Greg R., Chicago, IL, Baptist, Andrew D., Mt. Pleasant, WI, Khadiwala, Ravi V., Bartlett, IL, Leggette, Wesley B., Chicago, IL, Horan, Scott M., Clarendon Hills, IL, Borich, Franco V., Naperville, IL, Cilfone, Bart R., and Scholl, Daniel J., Chicago, IL, for “synchronously storing data in a plurality of dispersed storage networks.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”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.”

The patent application was filed on July 27, 2017 (15/661,332).

Recovering data from microslices in dispersed storage network
Pure Storage, Inc., Mountain View, CA, has been assigned a patent (10,387,250) developed by Resch, Jason K., and Leggette, Wesley, Chicago, IL, for “recovering data from microslices in a dispersed storage network.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A method includes dispersed storage error encoding a data segment into a plurality of encoded micro slices in accordance with micro slice encoding parameters that include a micro slice width number and a micro slice decode threshold number. The micro slice decode threshold number of encoded micro slices is needed to recover the data segment. The method further includes arranging the plurality of encoded micro slices into a set of meta slices in accordance with meta slice encoding parameters that include a meta slice width number and a meta slice decode threshold number. The meta slice decode threshold number of encoded meta slices is needed to recover the micro slice decode threshold number of encoded micro slices. The method further includes sending the set of encoded meta slices to a set of storage units.”

The patent application was filed on January 4, 2017 (15/398,163).

Dispersed storage network file system directory
Pure Storage, Inc., Mountain View, CA, has been assigned a patent (10,387,247) developed by Baptist, Andrew, Mt. Pleasant, WI, and Motwani, Manish, Chicago, IL, for a “dispersed storage network file system directory.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A dispersed storage device manages a file system directory of a dispersed storage network by receiving a data object to be stored and a user file name of the data object, calculating a data compression function of the data object, creating a file identifier based on a result of the data compression function, creating a source name for the data object using the file identifier and linking the user file name to the source name in the file system directory.”

The patent application was filed on May 30, 20147 (14/291,199).