Latency‐aware adaptive micro‐batching techniques for streamed data compression on graphics processing units

Summary Stream processing is a parallel paradigm used in many application domains. With the advance of graphics processing units (GPUs), their usage in stream processing applications has increased as well. The efficient utilization of GPU accelerators in streaming scenarios requires to batch input e...

Full description

Saved in:
Bibliographic Details
Published in:Concurrency and computation 2021-06, Vol.33 (11), p.n/a
Main Authors: Stein, Charles M., Rockenbach, Dinei A., Griebler, Dalvan, Torquati, Massimo, Mencagli, Gabriele, Danelutto, Marco, Fernandes, Luiz G.
Format: Article
Language:English
Subjects:
Accelerators
Adaptive algorithms
Algorithms
Compression tests
Data compression
data compression algorithms
dynamic reconfiguration
Graphics processing units
parallel programming
service level objective
stream parallelism
stream processing
Workload
Workloads
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Summary Stream processing is a parallel paradigm used in many application domains. With the advance of graphics processing units (GPUs), their usage in stream processing applications has increased as well. The efficient utilization of GPU accelerators in streaming scenarios requires to batch input elements in microbatches, whose computation is offloaded on the GPU leveraging data parallelism within the same batch of data. Since data elements are continuously received based on the input speed, the bigger the microbatch size the higher the latency to completely buffer it and to start the processing on the device. Unfortunately, stream processing applications often have strict latency requirements that need to find the best size of the microbatches and to adapt it dynamically based on the workload conditions as well as according to the characteristics of the underlying device and network. In this work, we aim at implementing latency‐aware adaptive microbatching techniques and algorithms for streaming compression applications targeting GPUs. The evaluation is conducted using the Lempel‐Ziv‐Storer‐Szymanski compression application considering different input workloads. As a general result of our work, we noticed that algorithms with elastic adaptation factors respond better for stable workloads, while algorithms with narrower targets respond better for highly unbalanced workloads.
ISSN:1532-0626
1532-0634
DOI:10.1002/cpe.5786