ZFP: A compressed array representation for numerical computations

HPC trends favor algorithms and implementations that reduce data motion relative to FLOPS. We investigate the use of lossy compressed data arrays in place of traditional IEEE floating point arrays to store the primary data of calculations. Simulation is fundamentally an exercise in controlled approximation, and error introduced by finite-precision arithmetic (or lossy compression) is just one of several sources of error that need to be managed to ensure sufficient accuracy in a computed result. We describe ZFP, a compressed numerical format designed for in-memory storage of multidimensional arrays, and summarize theoretical results that demonstrate that the error of repeated lossy compression can be bounded and controlled. Furthermore, we establish a relationship between grid resolution and compression-induced errors and show that, contrary to conventional floating point, ZFP reduces finite-difference errors with finer grids. We present example calculations that demonstrate data reduction by 4x or more with negligible impact on solution accuracy. Our results further demonstrate several orders-of-magnitude increase in accuracy using ZFP over IEEE floating point and Posits for the same storage budget.

Authors

Institutions

Publication Details

Journal
The International Journal of High Performance Computing Applications
Published
2024-10-23
DOI
https://doi.org/10.1177/10943420241284023
Citations
13
Primary Topic
Advanced Data Storage Technologies
Type
article
Field-Weighted Citation Impact
4.54

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

ZFP: A compressed array representation for numerical computations

Jeffrey W. Banks, Alyson Fox, J. Hittinger, Daniel Osei-Kuffuor et al.
13 citations
The International Journal of High Performance Computing Applications
Advanced Data Storage Technologies
4.54
article

ZFP: A compressed array representation for numerical computations

Jeffrey W. Banks, Alyson Fox, J. Hittinger, Daniel Osei-Kuffuor, James Diffenderfer, Peter Lindström
article en
13 citations

Abstract

HPC trends favor algorithms and implementations that reduce data motion relative to FLOPS. We investigate the use of lossy compressed data arrays in place of traditional IEEE floating point arrays to store the primary data of calculations. Simulation is fundamentally an exercise in controlled approximation, and error introduced by finite-precision arithmetic (or lossy compression) is just one of several sources of error that need to be managed to ensure sufficient accuracy in a computed result. We describe ZFP, a compressed numerical format designed for in-memory storage of multidimensional arrays, and summarize theoretical results that demonstrate that the error of repeated lossy compression can be bounded and controlled. Furthermore, we establish a relationship between grid resolution and compression-induced errors and show that, contrary to conventional floating point, ZFP reduces finite-difference errors with finer grids. We present example calculations that demonstrate data reduction by 4x or more with negligible impact on solution accuracy. Our results further demonstrate several orders-of-magnitude increase in accuracy using ZFP over IEEE floating point and Posits for the same storage budget.

The International Journal of High Performance Computing ApplicationsVol. 39(1)
Lawrence Livermore National Laboratory (US), Rensselaer Polytechnic Institute (US)
Advanced Scientific Computing Research, Lawrence Livermore National Laboratory
Openalex Percentile: Top 5%
Advanced Data Storage Technologies
4.54
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.