Beyond straightforward vectorization of lightweight data compression algorithms for larger vector sizes
Research output: Contribution to book/Conference proceedings/Anthology/Report › Conference contribution › Contributed › peer-review
Contributors
Abstract
Data as well as hardware characteristics are two key aspects for efficient data management. This holds in particular for the field of in-memory data processing. Aside from increasing main memory capacities, efficient in-memory processing benefits from novel processing concepts based on lightweight compressed data. Thus, an active research field deals with the adaptation of new hardware features such as vectorization using SIMD instructions to speeduplightweight data compression algorithms. Most of the vectorized. implementations have been proposed for 128-bit vector registers. A straightforward transformation to wider vector sizes is possible. However, this straightforward way does not exploit the capabilities of newer SIMD extensions to the maximum extent as we will show in this paper. On the one hand, we present a novel implementation concept for run-length encoding using conflict-detection operations which have been introduced in Intel's AVX-512 SIMD extension. On the other hand, we investigate different data layouts for vectorization and their impact on wider vector sizes. Copyright is held by the author/owner(s).
Details
Original language | English |
---|---|
Title of host publication | Grundlagen von Datenbanken |
Editors | Gerhard Klassen, Stefan Conrad |
Pages | 71-76 |
Number of pages | 6 |
Publication status | Published - 2018 |
Peer-reviewed | Yes |
Publication series
Series | CEUR Workshop Proceedings |
---|---|
Volume | 2126 |
ISSN | 1613-0073 |
Conference
Title | 30th GI-Workshop Grundlagen von Datenbanken, GvDB 2018 - 30th GI-Workshop on the Foundations of Databases, GvDB 2018 |
---|---|
Duration | 22 - 25 May 2018 |
City | Wuppertal |
Country | Germany |
External IDs
Scopus | 85049774436 |
---|---|
ORCID | /0000-0001-8107-2775/work/142253475 |