English

TAC: Optimizing Error-Bounded Lossy Compression for Three-Dimensional Adaptive Mesh Refinement Simulations

Distributed, Parallel, and Cluster Computing 2022-05-09 v3

Abstract

Today's scientific simulations require a significant reduction of data volume because of extremely large amounts of data they produce and the limited I/O bandwidth and storage space. Error-bounded lossy compression has been considered one of the most effective solutions to the above problem. However, little work has been done to improve error-bounded lossy compression for Adaptive Mesh Refinement (AMR) simulation data. Unlike the previous work that only leverages 1D compression, in this work, we propose to leverage high-dimensional (e.g., 3D) compression for each refinement level of AMR data. To remove the data redundancy across different levels, we propose three pre-process strategies and adaptively use them based on the data characteristics. Experiments on seven AMR datasets from a real-world large-scale AMR simulation demonstrate that our proposed approach can improve the compression ratio by up to 3.3X under the same data distortion, compared to the state-of-the-art method. In addition, we leverage the flexibility of our approach to tune the error bound for each level, which achieves much lower data distortion on two application-specific metrics.

Keywords

Cite

@article{arxiv.2204.00711,
  title  = {TAC: Optimizing Error-Bounded Lossy Compression for Three-Dimensional Adaptive Mesh Refinement Simulations},
  author = {Daoce Wang and Jesus Pulido and Pascal Grosset and Sian Jin and Jiannan Tian and James Ahrens and Dingwen Tao},
  journal= {arXiv preprint arXiv:2204.00711},
  year   = {2022}
}

Comments

13 pages, 19 figures, 3 tables, published by ACM HPDC 2022

R2 v1 2026-06-24T10:35:15.548Z