File tree Expand file tree Collapse file tree 1 file changed +9
-0
lines changed Expand file tree Collapse file tree 1 file changed +9
-0
lines changed Original file line number Diff line number Diff line change @@ -16,6 +16,15 @@ the shards and reconstruct the original file.
16
16
There is a Gradle build file to make a jar and run the tests. Running
17
17
it is simple. Just type: ` gradle build `
18
18
19
+ The performance of the inner loop depends on the specefic processor
20
+ you're running on. There are twelve different permutations of the
21
+ loop in this library, and the ReedSolomonBenchmark class will tell
22
+ you which one is faster for your particular application. The number
23
+ of parity and data shards in the benchmark, as well as the buffer
24
+ sizes, match the usage at Backblaze. You can set the parameters of
25
+ the benchmark to match your specific use before choosing a loop
26
+ implementation.
27
+
19
28
We would like to send out a special thanks to James Plank at the
20
29
University of Tennessee at Knoxville for his useful papers on erasure
21
30
coding. If you'd like an intro into how it all works, take a look at
You can’t perform that action at this time.
0 commit comments