JParEnt

Sodsong, Wasuwee; Jung, Minyoung; Park, Jin-Woo; Burgstaller, Bernd

doi:10.1145/2883404.2883423

Cited by 5 publications

(3 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The CPU‐based block boundary scan is the only remaining sequential task. Given this new constant for the nonparallelizable portion of JPEG decoding, we apply Amdahl's law to compute the maximum achievable speedup by T T o t a l / T S c a n , where T T o t a l denotes the execution time of the SeqEnt method, and T S c a n is the time to perform the block boundary scan (see Sodsong, Jung, et al for further details).…”

Section: Resultsmentioning

confidence: 99%

“…This paper extends work presented at the PMAM'16 workshop, to use integrated graphics processors (IGPs) for parallel entropy decoding. We introduce a novel, dynamic partitioning scheme for JPEG decoding which takes into account the considerably lower compute‐power of IGPs relative to the on‐chip CPU.…”

mentioning

confidence: 77%

“…We heuristically determine the best chunk size for a given architecture by offline profiling. Due to space constraints, we refer the reader to our previous work for the details on offline profiling of chunk sizes.…”

Section: Entropy Decodingmentioning

confidence: 99%

See 2 more Smart Citations

JParEnt: Parallel entropy decoding for JPEG decompression on heterogeneous multicore architectures

Sodsong

Jung

Park

et al. 2017

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

Summary 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 decoding for JPEG decompression on heterogeneous multicores. JParEnt conducts JPEG decompression in two steps: (1) an efficient sequential scan of the entropy data on the CPU to determine the start‐positions (boundaries) of coefficient blocks in the bitstream, followed by (2) a parallel entropy decoding step on the graphics processing unit (GPU). The block boundary scan constitutes a reinterpretation of the Huffman‐coded entropy data to determine codeword boundaries in the bitstream. We introduce a dynamic workload partitioning scheme to account for GPUs of low compute power relative to the CPU. This configuration has become common with the advent of SoCs with integrated graphics processors (IGPs). We leverage additional parallelism through pipelined execution across CPU and GPU. For systems providing a unified address space between CPU and GPU, we employ zero‐copy to completely eliminate the data transfer overhead. Our experimental evaluation of JParEnt was conducted on six heterogeneous multicore systems: one server and two desktops with dedicated GPUs, one desktop with an IGP, and two embedded systems. For a selection of more than 1000 JPEG images, JParEnt outperforms the SIMD–implementation of the libjpeg‐turbo library by up to a factor of 4.3×, and the previously fastest JPEG decompression method for heterogeneous multicores by up to a factor of 2.2×. JParEnt's entropy data scan consumes 45% of the entropy decoding time of libjpeg‐turbo on average. Given this new ratio for the sequential part of JPEG decompression, JParEnt achieves up to 97% of the maximum attainable speedup (95% on average). On the IGP‐based desktop platform, JParEnt achieves energy savings of up to 45% compared to libjpeg‐turbo's SIMD‐implementation.

show abstract

Section: Resultsmentioning

confidence: 99%

mentioning

confidence: 77%