Volume-level redundancy coding techniques for sequential transfer optimized storage devices

A system, comprising:

• one or more processors;
• and
• memory that stores computer-executable instructions that, if executed, cause the system to:
• sort a plurality of archives in a predetermined order for storage, in the predetermined order, on a plurality of volumes;
• generate indexes for the plurality of volumes, each index of the indexes reflecting a subset of the sorted plurality of archives to be stored on a respective volume of the plurality of volumes;
• process the indexes and the plurality of archives with a redundancy code so as to generate a plurality of shards, wherein a subset of the plurality of shards includes original data of the plurality of archives;
• store the plurality of shards on the plurality of volumes such that a subset of the plurality of volumes includes the original data;
• detect a shard among the subset of the plurality of shards as unavailable;
• and
• use a second subset of the plurality of shards to regenerate the unavailable shard using the redundancy code.

A non-transitory computer-readable storage medium having stored thereon executable instructions that, as a result of being executed by one or more processors of a computer system, cause the computer system to at least:

• determine an order for a plurality of archives in which the plurality of archives is to be stored on a plurality of volumes;
• generate indexes for the plurality of volumes, each index of the indexes reflecting a subset of plurality of archives to be stored on a respective volume of the plurality of volumes in the determined order;
• and
• generate a plurality of shards, each shard of the plurality of shards corresponding to a volume of the plurality of volumes, by applying a redundancy code to at least the indexes and the plurality of archives such that:
• a subset of the plurality of shards contains original data of the plurality of archives, wherein the subset of the plurality of shards is stored on the plurality of volumes such that the plurality of archives is represented in the determined order within the subset of the plurality of shards;
• store the plurality of shards on corresponding volumes of the plurality of volumes;
• detect a shard among the subset of the plurality of shards as unavailable;
• and
• use a second subset of the plurality of shards to regenerate the unavailable shard using the redundancy code.