CUDPP release 2.1 is a feature release that adds many new parallel primitives. We have added cudppCompress, a lossless data compression algorithm. This compression utilizes efficient parallel Burrows-Wheeler and Move-to-Front transforms which are also exposed through the API. In addition, the library now contains two new sorting algorithms, cudppMergeSort and cudppStringSort, adding to the existing radix sort. Minor code refactoring and build time fixes were completed.
CUDPP 2.1 is the first release to mark our transition from Google Code to Github. We hope this transition will facilitate more community involvement and easier project management in the future.
A full list of changes can be viewed in the change log.
Papers Cited: - Ritesh A. Patel, Yao Zhang, Jason Mak, Andrew Davidson, John D. Owens. “Parallel Lossless Data Compression on the GPU”. In Proceedings of Innovative Parallel Computing (InPar ‘12), May 2012. http - Andrew Davidson, David Tarjan, Michael Garland, and John D. Owens. “Efficient Parallel Merge Sort for Fixed and Variable Length Keys”. In Proceedings of Innovative Parallel Computing (InPar ‘12) May 2012. http