Minyoung Jung

• Yonsei University

The JPEG format employs Huffman codes to compress the entropy data of an image. Huffman codewords are of variable length, which makes parallel entropy decoding a difficult problem. To determine the start position of a codeword in the bitstream, the previous codeword must be decoded first. We present JParEnt, a new approach to parallel entropy decod...

The JPEG format is the de facto image compression standard, with billions of views every day. Parallelizing the entropy decoding step of the JPEG decompression algorithm remains a challenging problem, because codewords are of variable length, and the start-position of a codeword in the bitstream is not known before the previous codeword has been de...

In this paper, we propose several optimizations for the SFA construction algorithm, which greatly reduce the in-memory footprint and the processing steps required to construct an SFA. We introduce fingerprints as a space- and time-efficient way to represent SFA states. To compute fingerprints, we apply the Barrett reduction algorithm and accelerate...

We present techniques to parallelize membership tests for Deterministic Finite Automata (DFAs). Our method searches arbitrary regular expressions by matching multiple bytes in parallel using speculation. We partition the input string into chunks, match chunks in parallel, and combine the matching results. Our parallel matching algorithm exploits st...

Pattern matching is often implemented on the CPU today using deterministic finite automata (DFAs). We present methods to efficiently parallelize the DFA membership test on general-purpose graphics processing units (GPGPUs). Our partitioning scheme builds on the work of Holub and Stekr. Our implementations utilize the OpenCL programming model, in wh...

We present a technique to parallelize DFA membership tests that builds on a result by Holub an Stekr. The main contributions of our work are a novel partitioning scheme for improved loadbalancing, a par-allel matching algorithm that exploits structural properties of DFAs, and an efficient binary reduction scheme. We analyze the complexity of our al...