Patent application number | Description | Published |
20100031082 | Prioritized Rebuilding of a Storage Device - Rebuilding a storage device after failure of a storage device is disclosed. The method is particularly useful for RAID groups of hard disks. The method may also apply to other storage media arranged as a group. The method includes rebuilding a hard disk in a non-linear fashion according to a heuristic analysis of logical units of the failed hard disk. The method may be implemented in hardware, firmware, software, or a combination thereof. | 02-04-2010 |
20100122115 | Storage Device Realignment - Realigning storage devices arranged as storage arrays when one of the storage arrays enters a critical state after failure of a storage device is disclosed. The method is particularly useful for RAID groups of storage devices. The method may be used with hard disk drives, solid-state drives, and other storage devices arranged as groups. The method includes identifying when a storage array of a plurality of storage arrays is in a critical condition. A critical condition storage array and a healthy storage array are identified. Both the critical condition storage array and the healthy storage array are rebuilt. The rebuilding includes configuring the critical condition storage array to include a storage device from the healthy storage array and configuring the healthy storage array to function with one less storage device. The method may be implemented in hardware, firmware, software, or a combination thereof. | 05-13-2010 |
20110289274 | Storage Device Realignment - Realigning storage devices arranged as storage arrays when one of the storage arrays enters a critical state after failure of a storage device is disclosed. The method is particularly useful for RAID groups of storage devices. The method may be used with hard disk drives, solid-state drives, and other storage devices arranged as groups. The method includes identifying that a storage array of a plurality of storage arrays is in a critical condition. A critical condition storage array and a healthy storage array are identified. Both the critical condition storage array and the healthy storage array are rebuilt. The rebuilding includes configuring the critical condition storage array to include a storage device from the healthy storage array and configuring the healthy storage array to function with one less storage device. The method may be implemented in hardware, firmware, software, or a combination thereof. | 11-24-2011 |
20140172930 | FAILURE RESILIENT DISTRIBUTED REPLICATED DATA STORAGE SYSTEM - A failure resilient distributed replicated data storage system is described herein. The storage system includes zones that are independent, and autonomous from each other. The zones include nodes that are independent and autonomous. The nodes include storage devices. When a data item is stored, it is partitioned into a plurality of data objects and a plurality of parity objects calculated. Reassembly instructions are created for the data item. The data objects and parity objects are spread across all nodes and zones in the storage system. Reassembly instructions are also spread across the zones. When a read request is received, the data item is prepared from the lowest latency nodes according to the reassembly instructions. This provides for data resiliency while keeping the amount of storage space required relatively low. | 06-19-2014 |
20140173235 | RESILIENT DISTRIBUTED REPLICATED DATA STORAGE SYSTEM - A resilient distributed replicated data storage system is described herein. The storage system includes zones that are independent, and autonomous from each other. The zones include nodes that are independent and autonomous. The nodes include storage devices. When a data item is stored, it is partitioned into a plurality of data objects and a plurality of parity objects are calculated. Reassembly instructions are created for the data item. The data objects, parity objects and reassembly instructions are spread across nodes and zones in the storage system according to a policy for the data item. When a zone is inaccessible, a virtual zone is created and used until the intended zone is available. When a read request is received, the data item is prepared from the lowest latency nodes according to the reassembly instructions, and a virtual zone is accessed in place of a real zone when the real zone is inaccessible. | 06-19-2014 |
20140380093 | RESILIENT DISTRIBUTED REPLICATED DATA STORAGE SYSTEM - A resilient distributed replicated data storage system is described herein. The storage system includes zones that are independent, and autonomous from each other. The zones include nodes that are independent and autonomous. The nodes include storage devices. When a data item is stored, it is partitioned into a plurality of data objects and a plurality of parity objects are calculated. Reassembly instructions are created for the data item. The data objects, parity objects and reassembly instructions are spread across nodes and zones in the storage system according to a policy for the data item. When a zone is inaccessible, a virtual zone is created and used until the intended zone is available. When a read request is received, the data item is prepared from the lowest latency nodes according to the reassembly instructions, and a virtual zone is accessed in place of a real zone when the real zone is inaccessible. | 12-25-2014 |
20150019598 | OBJECT FILE SYSTEM - An object based file system for storing and accessing objects is disclosed. The file system may be implemented as a method in hardware, firmware, software, or a combination thereof. The method may include receiving from an application program an object write request. A selected storage node on which to store the object may be selected, including identifying a least busy storage node and/or a least full storage node. The object and the object write request may be sent to the selected storage node. A write success message may be received from the selected storage node. The successful writing of the object may be reported to the application program. | 01-15-2015 |
20150019599 | OBJECT FILE SYSTEM - An object based file system for storing and accessing objects is disclosed. The file system may be implemented as a method in hardware, firmware, software, or a combination thereof. The method may include receiving from an application program an object write request. A selected storage node on which to store the object may be selected, including identifying a least busy storage node and/or a least full storage node. The object and the object write request may be sent to the selected storage node. A write success message may be received from the selected storage node. The successful writing of the object may be reported to the application program. | 01-15-2015 |