The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Significantly Improving Lossy Compression for Scientific Data Sets Based on Multidimensional Prediction and Error-Controlled Quantization
Open accessAbstract
Today's HPC applications are producing extremely large amounts of data, such that data storage and analysis are becoming more challenging for scientific research. In this work, we design a new error-controlled lossy compression algorithm for large-scale scientific data. Our key contribution is significantly improving the prediction hitting rate (or prediction accuracy) for each data point based on its nearby data values along multiple dimensions. We derive a series of multilayer prediction formulas and their unified formula in the context of data compression. One serious challenge is that the data prediction has to be performed based on the preceding decompressed values during the compression in order to guarantee the error bounds, which may degrade the prediction accuracy in turn. We explore the best layer for the prediction by considering the impact of compression errors on the prediction accuracy. Moreover, we propose an adaptive error-controlled quantization encoder, which can further improve the prediction hitting rate considerably. The data size can be reduced significantly after performing the variable-length encoding because of the uneven distribution produced by our quantization encoder. We evaluate the new compressor on production scientific data sets and compare it with many other state-of-the-art compressors: GZIP, FPZIP, ZFP, SZ-1.1, and ISABELA. Experiments show that our compressor is the best in class, especially with regard to compression factors (or bit-rates) and compression errors (including RMSE, NRMSE, and PSNR). Our solution is better than the second-best solution by more than a 2x increase in the compression factor and 3.8x reduction in the normalized root mean squared error on average, with reasonable error bounds and user-desired bit-rates.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A universal algorithm for sequential data compression
Ziv, J., & Lempel, A. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055714 · Cited by 5,456
The Mathematical Theory of Finite Element Methods
Brenner, S. C., & Scott, L. R. (2008) · Texts in Applied Mathematics · doi:10.1007/978-0-387-75934-0 · Cited by 3,955
Fixed-Rate Compressed Floating-Point Arrays
Lindstrom, P. (2014) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2014.2346458 · Cited by 676
Fast and Efficient Compression of Floating-Point Data
Lindstrom, P., & Isenburg, M. (2006) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2006.143 · Cited by 442
Industrial-era global ocean heat uptake doubles in recent decades
Gleckler, P. J., Durack, P. J., Stouffer, R. J., Johnson, G. C., & Forest, C. E. (2016) · Nature Climate Change · doi:10.1038/nclimate2915 · Cited by 172
Fast Lossless Compression of Scientific Floating-Point Data
Ratanaworabhan, P., Ke, J., & Burtscher, M. (2006) · Data Compression Conference (DCC'06) · doi:10.1109/dcc.2006.35 · Cited by 159
Exploration of Lossy Compression for Application-Level Checkpoint/Restart
Sasaki, N., Sato, K., Endo, T., & Matsuoka, S. (2015) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2015.67 · Cited by 95
A methodology for evaluating the impact of data compression on climate simulation data
Baker, A. H., Xu, H., Dennis, J. M., et al. (2014) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1145/2600212.2600217 · Cited by 95
NUMARCK: Machine Learning Algorithm for Resiliency and Checkpointing
Chen, Z., Son, S. W., Hendrix, W., et al. (2014) · 2012 International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1109/sc.2014.65 · Cited by 60
Self-citation
Cited by
IF-CNN: Image-Aware Inference Framework for CNN With the Collaboration of Mobile Devices and Cloud
Shu, G., Liu, W., Zheng, X., & Li, J. (2018) · IEEE Access · doi:10.1109/access.2018.2880196 · Cited by 30
Metadata
- Authors
- Tao, D., Di, S., Chen, Z., & Cappello, F.
- Venue
- 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
- Publisher
- IEEE
- Published
- 2017-05
- Pages
- 1129-1139
- ISSN
- 1530-2075 (ISSN-L)
- OpenAlex
- W2625759119
- Cited by
- 292
- References
- 9
- FWCI
- 6.47
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.