DSSD Assigned Two Patents
System with incremental multi-dimensional RAID, guaranteed read latency
By Jean Jacques Maleval | January 3, 2013 at 2:50 pmSystem with incremental multi-dimensional RAID
DSSD, Inc., Menlo Park, CA, has been assigned a patent (8,341,342) developed by Jeffrey S. Bonwick, Los Altos, CA, and William H. Moore, Fremont, CA, for a "storage system with incremental multi-dimensional RAID."
The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method for storing data including receiving a request to write data and in response the request, selecting a RAID grid location in a RAID grid to write the data. The method further includes writing the data to memory, updating a data structure to indicate that the RAID grid location is filled, identifying a parity value in the RAID grid to update, where the parity value is associated with a second RAID grid location in the RAID grid, updating the parity value using the data and the parity value to obtain an updated parity value and storing the updated parity value in the memory. Prior to the first data grid being filled determining a physical address in persistent storage corresponding to the RAID grid location and writing the data to the first physical address."
The patent application was filed on March 23, 2012 (13/428,817).
Storage system with guaranteed read latency
DSSD, Inc., Menlo Park, CA, has been assigned a patent (8,301,832) developed by William H. Moore, Fremont, CA, and Jeffrey S. Bonwick, Los Altos, CA, for a "storage system with guaranteed read latency."
The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method for writing data to persistent storage. The method includes receiving a first request to write a first datum to persistent storage including NAND dies, identifying a first NAND die in which to write a first copy of the first datum and a second NAND die in which to write a second copy, generating a second request to write the first copy of the first datum to the first NAND die and a third request to write the second copy to the second NAND die, and waiting until the first NAND die and second NAND die not are busy. Based on a determination that the first NAND die and the second NAND die are not busy: issuing the second request to the first NAND die, and issuing the third request to the second NAND die after the second request is complete."
The patent application was filed on March 23, 2012 (13/428,631).