| 摘要 |
A method (600) of prioritizing data (312) for recovery in a distributed storage system (100) includes, for each stripe (320) of a file (310) having chunks (330), determining whether the stripe comprises high-availability chunks (330a) or low- availability chunks (330b) and determining an effective redundancy value (ER) for each stripe. The effective redundancy value is based on the chunks and any system domains (402) associated with the corresponding stripe. The distributed storage system has a system hierarchy (400) including system domains. Chunks of a stripe associated with a system domain in an active state are accessible, whereas chunks of a stripe associated with a system domain in an inactive state are inaccessible. The method also includes reconstructing substantially immediately inaccessible, high-availability chunks having an effective redundancy value less than a threshold effective redundancy (ERT) value and reconstructing the inaccessible low-availability and other inaccessible high-availability chunks, after a threshold period of time. |
