HoSZp: An Efficient Homomorphic Error-bounded Lossy Compressor for Scientific Data
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910573334102016 |
|---|---|
| author | Agarwal, Tripti Di, Sheng Huang, Jiajun Huang, Yafan Gopalakrishnan, Ganesh Underwood, Robert Zhao, Kai Liang, Xin Li, Guanpeng Cappello, Franck |
| author_facet | Agarwal, Tripti Di, Sheng Huang, Jiajun Huang, Yafan Gopalakrishnan, Ganesh Underwood, Robert Zhao, Kai Liang, Xin Li, Guanpeng Cappello, Franck |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_11971 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | HoSZp: An Efficient Homomorphic Error-bounded Lossy Compressor for Scientific Data Agarwal, Tripti Di, Sheng Huang, Jiajun Huang, Yafan Gopalakrishnan, Ganesh Underwood, Robert Zhao, Kai Liang, Xin Li, Guanpeng Cappello, Franck Distributed, Parallel, and Cluster Computing 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. |
| title | HoSZp: An Efficient Homomorphic Error-bounded Lossy Compressor for Scientific Data |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2408.11971 |