Jerasure: A Library in C Facilitating Erasure Coding for Storage Applications

Version 2.0

James S. Plank and Kevin M. Greenan (Box).

January, 2014

Technical Report UT-EECS-14-721
EECS Department
University of Tennessee
Knoxville, TN 37996


This technical report contains the description and user's guide of the library in UT-EECS-14-721.pdf. The source code for jerasure is at https://bitbucket.org/jimplank/jerasure. The source code for GF-Complete is at https://bitbucket.org/jimplank/gf-complete.

Abstract

This paper descibes version 2.0 of jerasure, a library in C that supports erasure coding in storage applications. In this paper, we describe both the techniques and algorithms, plus the interface to the code. Thus, this serves as a quasi-tutorial and a programmer's guide.

Version 2.0 does not change the interface of jerasure 1.2. What it does is change the software for doing the Galois Field back-end. It now uses GF-Complete, which is much more flexible and powerful than the previous Galois Field arithmetic library. In particular, it leverages Intel SIMD instructions so that Reed-Solomon coding may be blazingly fast.

In order to use jerasure, you must first download and install GF-Complete. Both libraries are posted and maintained at bitbucket.com.


Citation Information