reedsolomon

Reed-Solomon Erasure Coding in Haskell http://github.com/NicolasT/reedsolomon

Version on this page:0.0.4.3
LTS Haskell 8.23:0.0.4.3
Stackage Nightly 2017-02-11:0.0.4.3
Latest on Hackage:0.0.4.3
MIT licensed by Nicolas Trangez
Maintained by ikke@nicolast.be

Module documentation for 0.0.4.3

Reed-Solomon

Travis CI Circle CI Appveyor

Reed-Solomon Erasure Coding in Haskell, with speeds exceeding multiple GB/s/cpu core implemented in pure Haskell (and some SIMD C/assembler).

This is a Haskell port of the GolangReedSolomon library released by Klaus Post, wich is a port of the JavaReedSolomon library released by Backblaze, with some additional optimizations.

For an introduction on erasure coding, see the post on the Backblaze blog.

Package home: https://github.com/NicolasT/reedsolomon

Performance

Performance depends mainly on the number of parity shards. In rough terms, doubling the number of parity shards will double the encoding time.

Here are the throughput numbers with some different selections of data and parity shards. For reference each shard is 1MB random data, and 1 CPU core is used for encoding.

Data Parity Parity SSSE3 MB/s AVX2 MB/s
5240%3641,663987,24
10220%3951,014444,44
10440%1821,161927,90
502040%398,09431,78

Example of performance on Intel(R) Core(TM) i7-4600U CPU @ 3.30GHz - 2 physical cores, 4 logical cores (note: /proc/cpuinfo mentions 2.10GHz only). The example uses 10 blocks with 16MB data each and 4 parity blocks.

Threads SSSE3 MB/s AVX2 MB/s Speed
11551,891588,88100%

Links

License

This code, as the original GolangReedSolomon and JavaReedSolomon is published under an MIT license. See LICENSE file for more information.

comments powered byDisqus