Skip to content

Commit 96c177c

Browse files
committed
Add mention of coding loops choices and benchmark.
1 parent 34f2e84 commit 96c177c

File tree

1 file changed

+9
-0
lines changed

1 file changed

+9
-0
lines changed

README.md

Lines changed: 9 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -16,6 +16,15 @@ the shards and reconstruct the original file.
1616
There is a Gradle build file to make a jar and run the tests. Running
1717
it is simple. Just type: `gradle build`
1818

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+
1928
We would like to send out a special thanks to James Plank at the
2029
University of Tennessee at Knoxville for his useful papers on erasure
2130
coding. If you'd like an intro into how it all works, take a look at

0 commit comments

Comments
 (0)