To provide access without cookies would require the site to create a new session for every page you visit, which slows the system down to an unacceptable level.
This site stores nothing other than an automatically generated session ID in the cookie; no other information is captured.
We are also able to reevaluate the fastest GPU suffix array construction algorithm, which is needed to compute the LZ factorization.
We are able to find speedups of up to 5x over the fastest CPU implementations.
If your browser does not accept cookies, you cannot view this site.
General purpose computing on graphic processing units (GPGPUs) allows us to take advantage of the massively parallel nature of GPUs for computations other that their original purpose of rendering graphics.
Our work targets the use of GPUs for general lossless data compression.
Specifically, we developed and ported an algorithm that constructs the Lempel-Ziv factorization directly on the GPU.
Our implementation bypasses the sequential nature of the LZ factorization and attempts to compute the factorization in parallel.
By breaking down the LZ factorization into what we call the PLZ, we are able to outperform the fastest serial CPU implementations by up to 24x and perform comparatively to a parallel multicore CPU implementation.
Search for lempel dating:
To achieve these speeds, our implementation outputted LZ factorizations that were on average only 0.01 percent greater than the optimal solution that what could be computed sequentially.