Tuesday, 4 August 2009

Optimizing the Burrows-Wheeler Transform

The F#.NET Journal just published an article about data compression:

"The Burrows-Wheeler Transform (BWT) is one of the few preconditioners used in data compression and, in particular, is the core of the popular bzip2 compression utility. This article describes a simple 12-line implementation of the BWT in F# and progressively optimizes the implementation to use a customized quicksort then shared-memory parallelism. On 8 cores, the final optimized implementation is over 1,000× faster than the original..."

To read this article and more, subscribe to The F#.NET Journal today!

No comments: