LCP: Enhancing Scientific Data Management with <u>L</u> ossy <u>C</u> ompression for <u>P</u> articles
Many scientific applications opt for particles instead of meshes as their basic primitives to model complex systems composed of billions of discrete entities. Such applications span a diverse array of scientific domains, including molecular dynamics, cosmology, computational fluid dynamics, and geology. The scale of the particles in those scientific applications increases substantially thanks to the ever-increasing computational power in high-performance computing (HPC) platforms. However, the actual gains from such increases are often undercut by obstacles in data management systems related to data storage, transfer, and processing. Lossy compression has been widely recognized as a promising solution to enhance scientific data management systems regarding such challenges, although most existing compression solutions are tailored for Cartesian grids and thus have sub-optimal results on discrete particle data. In this paper, we introduce LCP, an innovative lossy compressor designed for particle datasets, offering superior compression quality and higher speed than existing compression solutions. Specifically, our contribution is threefold. (1) We propose LCP-S, an error-bound aware block-wise spatial compressor to efficiently reduce particle data size while satisfying the pre-defined error criteria. This approach is universally applicable to particle data across various domains, eliminating the need for reliance on specific application domain characteristics. (2) We develop LCP, a hybrid compression solution for multi-frame particle data, featuring dynamic method selection and parameter optimization. It aims to maximize compression effectiveness while preserving data quality as much as possible by utilizing both spatial and temporal domains. (3) We evaluate our solution alongside eight state-of-the-art alternatives on eight real-world particle datasets from seven distinct domains. The results demonstrate that our solution achieves up to 104% improvement in compression ratios and up to 593% increase in speed compared to the second-best option, under the same error criteria.
Authors
- Congrong Ren (ORCID: https://orcid.org/0009-0006-6285-7271)
- Franck Cappello (ORCID: https://orcid.org/0000-0002-7890-3934)
- Lihong Zhang (ORCID: https://orcid.org/0009-0005-3318-8059)
- Ruoyu Li (ORCID: https://orcid.org/0009-0006-5141-9815)
- Hanqi Guo (ORCID: https://orcid.org/0000-0001-7776-1834)
- Robert Underwood (ORCID: https://orcid.org/0000-0002-1464-729X)
- Dingwen Tao (ORCID: https://orcid.org/0000-0001-5422-4497)
- Sheng Di (ORCID: https://orcid.org/0000-0002-7339-5256)
- Pascal Grosset (ORCID: https://orcid.org/0000-0003-2192-3843)
- Kai Zhao (ORCID: https://orcid.org/0000-0001-5328-3962)
- Jinyang Liu (ORCID: https://orcid.org/0000-0003-0177-502X)
- Jiajun Huang (ORCID: https://orcid.org/0000-0001-5092-3987)
- Xin Liang (ORCID: https://orcid.org/0000-0002-0630-1600)
Institutions
- Florida State University (US)
- University of California, Riverside (US)
- Argonne National Laboratory (US)
- Los Alamos National Laboratory (US)
- University of Kentucky (US)
- University of Chicago (US)
- Indiana University Bloomington (US)
- University of Houston (US)
- The Ohio State University (US)
Publication Details
- Journal
- Proceedings of the ACM on Management of Data
- Published
- 2025-02-10
- DOI
- https://doi.org/10.1145/3709700
- Citations
- 3
- Primary Topic
- Algorithms and Data Compression
- Type
- article
- Field-Weighted Citation Impact
- 7.44