Distributed erasure coded virtual file system
A plurality of computing devices are communicatively coupled to each other via a network, and each of the plurality of computing devices comprises one or more of a plurality of storage devices. A plurality of failure resilient address spaces are distributed across the plurality of storage devices such that each of the plurality of failure resilient address spaces spans a plurality of the storage devices. Each one of the plurality of failure resilient address spaces is organized into a plurality of stripes. Each one or more stripes of the plurality of stripes is part of a respective one of a plurality of forward error correction (FEC) protection domains. Each of the plurality of stripes may comprise a plurality of storage blocks. Each block of a particular one of the plurality of stripes may reside on a different one of the plurality of storage devices.
1. A system comprising:
a computing device of a plurality of computing devices, wherein:
each of the plurality of computing devices is associated with one or more of a plurality of storage devices;
each stripe of a plurality of stripes spans a unique group of two or more storage devices of the plurality of storage devices;
the computing device is operable to:
select a stripe of the plurality of stripes;
write data to a first portion of the selected stripe; and
write error protection information to a second portion of the selected stripe.
2. The system of claim 1 , wherein the stripe selection is based on how many storage blocks are currently in each of the plurality of stripes.
3. The system of claim 1 , wherein the stripe selection is based on a bitmap stored on the plurality of storage devices.
4. The system of claim 1 , wherein the stripe selection is based on how many storage blocks are currently storing data in each of the plurality of stripes.
5. The system of claim 1 , wherein the stripe selection is based on read and write overhead for each of the plurality of stripes.
6. The system of claim 1 , wherein each of the plurality of stripes spans a plurality of failure domains.
7. The system of claim 1 , wherein the computing device is operable to reconstruct a particular stripe upon the failure of one or more storage devices of the unique group of two or more storage devices spanned by the particular stripe.
8. The system of claim 1 , wherein the computing device is operable to prioritize a reconstruction of multiple stripes.
9. The system of claim 1 , wherein the computing device is operable to prioritize a reconstruction of multiple stripes according to a number of failed storage devices in each of the multiple stripes.
10. The system of claim 1 , wherein the computing device is operable to reconstruct a stripe with more failed storage devices faster than a stripe with fewer failed storage devices.
11. The system of claim 1 , wherein the computing device is operable to write data to the selected stripe until a criterion is met.
12. The system of claim 11 , wherein the criterion is based on how many blocks are available for new data to be written to.
13. The system of claim 1 , wherein each stripe comprises one or more storage blocks on each of the two or more spanned storage devices.
14. A system comprising a non-transitory computer readable medium storing a sequence of instructions, wherein:
the sequence of instructions, when executed by a computing device, are operable to cause the computing device to:
select a stripe of a plurality of stripes;
write data to a first portion of the selected stripe; and
write error protection information to a second portion of the selected stripe, wherein:
the computing device is one of a plurality of computing devices;
the plurality of computing devices are operably coupled together via a communication network;
each of the plurality of computing devices is associated with one or more of a plurality of storage devices; and
each stripe of the plurality of stripes spans a unique group of two or more storage devices of the plurality of storage devices.
15. The system of claim 14 , wherein the stripe selection is based on how many storage blocks are currently in each of the plurality of stripes.
16. The system of claim 14 , wherein the stripe selection is based on a bitmap stored on the plurality of storage devices.
17. The system of claim 14 , wherein the stripe selection is based on how many storage blocks are currently storing data in each of the plurality of stripes.
18. The system of claim 14 , wherein the stripe selection is based on read and write overhead for each of the plurality of stripes.
19. The system of claim 14 , wherein each of the plurality of stripes spans a plurality of failure domains.
20. The system of claim 14 , wherein the computing device is operable to reconstruct a particular stripe upon the failure of one or more storage devices of the unique group of two or more storage devices spanned by the particular stripe.
21. The system of claim 14 , wherein the computing device is operable to prioritize a reconstruction of multiple stripes.
22. The system of claim 14 , wherein the computing device is operable to prioritize a reconstruction of multiple stripes according to a number of failed storage devices in each of the multiple stripes.
23. The system of claim 14 , wherein the computing device is operable to reconstruct a stripe with more failed storage devices faster than a stripe with fewer failed storage devices.
24. The system of claim 14 , wherein the computing device is operable to write data to the selected stripe until a criterion is met.
25. The system of claim 24 , wherein the criterion is based on how many blocks are available for new data to be written to.
26. The system of claim 14 , wherein each stripe comprises one or more storage blocks on each of the two or more spanned storage devices.