Lessons Learned on the Path to Guaranteeing the Error Bound in Lossy Quantizers
Alex Fallin, Martin Burtscher
TL;DR
The paper tackles why error-bounded lossy compressors sometimes violate bounds and presents LC’s approach to guarantee $ABS$, $REL$, and $NOA$ bounds across CPU and GPU. It identifies floating-point rounding, FMA-induced discrepancies, and library differences as primary sources of parity loss, and proposes double-check quantization, inline lossless outliers, and parity-preserving log2/pow2 implementations to close these gaps. The results show that LC preserves the error bound for all tested values with only a modest average reduction in compression ratio (about $5\%$ for REL) while maintaining throughputs comparable to non-guaranteed configurations. By exhaustively validating across billions of 32-bit values and delivering bit-for-bit identical cross-device outputs, LC provides a practical, open-source path toward robust, cross-architecture lossy compression in HPC workflows.
Abstract
Rapidly increasing data sizes in scientific computing are the driving force behind the need for lossy compression. The main drawback of lossy data compression is the introduction of error. This paper explains why many error-bounded compressors occasionally violate the error bound and presents the solutions we use in LC, a CPU/GPU compatible lossy compression framework, to guarantee the error bound for all supported types of quantizers. We show that our solutions maintain high compression ratios and cause no appreciable change in throughput.
