@MASTERSTHESIS\{IMM2013-06642,
    author       = "A. L. V. Nicolaisen",
    title        = "Algorithms for Compression on GPUs",
    year         = "2013",
    school       = "Technical University of Denmark, Department of Applied Mathematics and Computer Science / {DTU} Co",
    address      = "Matematiktorvet, Building 303B, {DK-}2800 Kgs. Lyngby, Denmark, compute@compute.dtu.dk",
    type         = "",
    note         = "{DTU} supervisors: Inge Li G{\o}rtz, inge@dtu.dk, {DTU} Compute, and Philip Bille, phbi@dtu.dk, {DTU} Compute",
    url          = "http://www.compute.dtu.dk/English.aspx",
    abstract     = "This project seeks to produce an algorithm for fast lossless compression of data. This is attempted by utilisation of the highly parallel graphic processor units (GPU), which has been made easier to use in the last decade through simpler access. Especially nVidia has accomplished to provide simpler programming of GPUs with their {CUDA} architecture.
I present 4 techniques, each of which can be used to improve on existing algorithms for compression. I select the best of these through testing, and combine them into one final solution, that utilises {CUDA} to highly reduce the time needed to compress a file or stream of data.
Lastly I compare the final solution to a simpler sequential version of the same algorithm for {CPU} along with another solution for the {GPU}. Results show an 60 time increase of throughput for some files in comparison with the sequential algorithm, and as much as a 7 time increase compared to the other {GPU} solution."
}