Logo image
HoSZp: An Efficient Homomorphic Error-bounded Lossy Compressor for Scientific Data
Preprint   Open access

HoSZp: An Efficient Homomorphic Error-bounded Lossy Compressor for Scientific Data

Tripti Agarwal, Sheng Di, Jiajun Huang, Yafan Huang, Ganesh Gopalakrishnan, Robert Underwood, Kai Zhao, Xin Liang, Guanpeng Li and Franck Cappello
arXiv.org
Cornell University
08/21/2024
DOI: 10.48550/arxiv.2408.11971
url
https://doi.org/10.48550/arxiv.2408.11971View
Preprint (Author's original)This preprint has not been evaluated by subject experts through peer review. Preprints may undergo extensive changes and/or become peer-reviewed journal articles. Open Access

Abstract

Error-bounded lossy compression has been a critical technique to significantly reduce the sheer amounts of simulation datasets for high-performance computing (HPC) scientific applications while effectively controlling the data distortion based on user-specified error bound. In many real-world use cases, users must perform computational operations on the compressed data (a.k.a. homomorphic compression). However, none of the existing error-bounded lossy compressors support the homomorphism, inevitably resulting in undesired decompression costs. In this paper, we propose a novel homomorphic error-bounded lossy compressor (called HoSZp), which supports not only error-bounding features but efficient computations (including negation, addition, multiplication, mean, variance, etc.) on the compressed data without the complete decompression step, which is the first attempt to the best of our knowledge. We develop several optimization strategies to maximize the overall compression ratio and execution performance. We evaluate HoSZp compared to other state-of-the-art lossy compressors based on multiple real-world scientific application datasets.
Computer Science - Distributed, Parallel, and Cluster Computing

Details

Metrics

8 Record Views
Logo image