reedsolomon: Reed-Solomon Erasure Coding in Haskell

[ data, library, mit ] [ Propose Tags ]

Please see README.md


[Skip to Readme]

Modules

[Last Documentation]

  • Data
    • Data.ReedSolomon
      • Data.ReedSolomon.BuildInfo
    • Vector
      • Storable
        • Data.Vector.Storable.ByteString

Flags

Manual Flags

NameDescriptionDefault
simd

Enable SIMD Galois field calculation routines

Enabled
llvm

Enable LLVM compilation

Enabled
examples

Build example binaries

Disabled

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.0.1.0, 0.0.1.1, 0.0.1.2, 0.0.2.0, 0.0.3.0, 0.0.4.0, 0.0.4.1, 0.0.4.2, 0.0.4.3 (info)
Dependencies base (>=4.7 && <4.10), bytestring (>=0.10 && <0.11), exceptions (>=0.8 && <0.9), gitrev (>=1.0 && <1.3), loop (>=0.2 && <0.4), mtl (>=2.1 && <2.3), primitive (>=0.6 && <0.7), profunctors (>=4.4 && <5.3), vector (>=0.10 && <0.12) [details]
License MIT
Copyright (c) 2015, 2016, Nicolas Trangez (c) 2015, Klaus Post (c) 2015, Backblaze
Author Nicolas Trangez
Maintainer ikke@nicolast.be
Category Data
Home page http://github.com/NicolasT/reedsolomon
Bug tracker http://github.com/NicolasT/reedsolomon/issues
Source repo head: git clone https://github.com/NicolasT/reedsolomon.git
Uploaded by NicolasTrangez at 2017-01-13T15:37:16Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Executables reedsolomon-profiling, reedsolomon-simple-bench, reedsolomon-simple-decoder, reedsolomon-simple-encoder
Downloads 4725 total (22 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2017-01-13 [all 3 reports]

Readme for reedsolomon-0.0.4.3

[back to package description]

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.