Jim Plank's Software

Erasure Coding and Galois Field Arithmetic

Jerasure: A Library in C/C++ Facilitating Erasure Coding for Storage Applications. Original: September, 2007. Version 1.2: August, 2008. This includes Reed-Solomon coding, Cauchy Reed-Solomon coding, general bit-matrix coding, Reed-Solomon coding optimized for RAID-6, Liberation coding, Blaum-Roth coding and Liber8tion coding. The documentation provides some tutorial material on matrix and bit-matrix based erasure coding.
Fast Galois Field Arithmetic Library in C/C++. April, 2007. This is a library for doing fast Galois Field arithmetic operations for GF(2^w)), for any w from 1 to 32. It changes its algorithms for different values of w to optimize for speed and memory.
GFLIB. June, 2003. This is an older library that contains Galois Arithmetic code for w=8 and w=16 only. The performance of w=8 is lacking as compared to the 2007 code. It does, however, implement Vandermonde-matrix based Reed-Solomon coding and decoding.

To make best use of these codes, please read the following tutorial and accompanying note:

James S. Plank, ``A Tutorial on Reed-Solomon Coding for Fault-Tolerance in RAID-like Systems,'' Software -- Practice & Experience, 27(9), September, 1997, pp. 995-1012.

James S. Plank and Ying Ding, ``Note: Correction to the 1997 Tutorial on Reed-Solomon Coding,'' Software -- Practice & Experience, 35(2), February, 2005, pp. 189-194.

IBP/Lors/LoCI

All the LoCI software may be found at the LoCI web site.

Jgraph is a program that takes the description of a graph or graphs as input, and produces a postscript file on the standard output. Jgraph is ideal for plotting any mixture of scatter point graphs, line graphs, and/or bar graphs, and embedding the output into LaTeX, or any other text processing system that can read postscript.

Ickp

Ickp is a library that enables users of the Intel iPSC/860 to checkpoint the execution state of their programs to disk. The major use for ickp is to provide fault-tolerance and/or coarse-grained job swapping to iPSC/860 users.

Libckpt

Libckpt is a portable checkpointing tool for Unix. It provides a mechanism for enabling fault-tolerance for long-running programs. Libckpt implements most optimizations that have been proposed to improve the performance of checkpointing. Additionally, it implements ``user-directed'' checkpointing, a new optimization unique to Libckpt.

Applications

This page contains pointers to various application programs that I have used for checkpointing.

Libfdr

This is a library that contains the red-black tree, doubly-linked list and fields code below. It was updated in 1999, and is easier to use than the previous code that I had. The old code may be obtained from the links below, but I recommend that you use this code.

Red-Black Tree Code

This contains code for using generic red-black trees. Red-black trees are a dynamic data structure in which all operations are guaranteed to perform in log time. The code is ansi or non-ansi C, and is very easy to use.

Dlist: Code for Doubly-Linked Lists

This contains C code for using generic doubly-linked lists.

Fields: Code for fields processing

This makes input processing in C easier, and is used in CS360/CS460.