-
Please consider this newer O(N Log N) time approach for future versions of ISA-L erasure codes, which supports up to 65536 symbols:
https://github.com/catid/leopard
catid updated
5 years ago
-
-
#### Problem
Sherds are propagated using 32:32 data:code erasure batches.
Despite that even at times that the delinquent stake is pretty low and the cluster is working fine, we still observe very sm…
-
What would be the possilibyt of doing this within ZFS?
http://www.networkcomputing.com/deduplication/229500204?pgno=2
If the data is erasure-coded into N shares distributed across at least H distinc…
-
-
Hello,
I have been considering migrating from GlusterFS to LizardFS for a variety of reasons. I digress, I already started migrating some of my company's high valid data to MooseFS CE since replic…
-
## *Repository Creation Request*
Use this to get your experiment repository created or updated on GitHub under Virtual Labs organization.
1. #### Coordinating Institute: IIIT Hyderabad
2. #### …
-
I figured we should put a reading-list together to cover a lot of the concepts relevant to cluster. **LINKS ONLY PLEASE, don't add files.**
We'll want to touch on:
- erasure coding/FEC
- ree…
-
I found a new paper about this FFT based Reed-Solomon Codes. They present erasure-and-error decoding of an (n, k) RS code. The decoding complexity is with only O(n log n + (n − k) log2 (n − k)). As re…
-
We've discussed using erasure codes in https://github.com/paritytech/parity-signer/issues/457 and https://github.com/paritytech/parity-signer/issues/320#issuecomment-546734733 probably a rateless code…