Stability Analysis of Inline ZFP Compression for Floating-Point Data in Iterative Methods

Currently, the dominating constraint in many high performance computing applications is data capacity and bandwidth, in both inter-node communications and even more-so in on-node data motion. A new approach to address this limitation is to make use of data compression in the form of a compressed data array. Storing data in a compressed data array and converting to standard IEEE-754 types as needed during a computation can reduce the pressure on bandwidth and storage. However, repeated conversions (lossy compression and decompression) introduce additional approximation errors, which need to be shown to not significantly affect the simulation results. We extend recent work [J. Diffenderfer, et al., Error Analysis of ZFP Compression for Floating-Point Data, SIAM Journal on Scientific Computing, 2019] that analyzed the error of a single use of compression and decompression of the ZFP compressed data array representation [P. Lindstrom, Fixed-rate compressed floating-point arrays, IEEE Transactions on Visualization and Computer Graphics, 2014] to the case of time-stepping and iterative schemes, where an advancement operator is repeatedly applied in addition to the conversions. We show that the accumulated error for iterative methods involving fixed-point and time evolving iterations is bounded under standard constraints. An upper bound is established on the number of additional iterations required for the convergence of stationary fixed-point iterations. An additional analysis of traditional forward and backward error of stationary iterative methods using ZFP compressed arrays is also presented. The results of several 1D, 2D, and 3D test problems are provided to demonstrate the correctness of the theoretical bounds.

[1]  R. D. Richtmyer,et al.  Difference methods for initial-value problems , 1959 .

[2]  N. Higham,et al.  COMPONENTWISE ERROR ANALYSIS FOR STATIONARY ITERATIVE METHODS , 1993 .

[3]  J. Douglas Faires,et al.  Numerical Analysis , 1981 .

[4]  Nicholas J. Higham,et al.  Accuracy and stability of numerical algorithms, Second Edition , 2002 .

[5]  Franck Cappello,et al.  Significantly Improving Lossy Compression for Scientific Data Sets Based on Multidimensional Prediction and Error-Controlled Quantization , 2017, 2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS).

[6]  Martin Isenburg,et al.  Fast and Efficient Compression of Floating-Point Data , 2006, IEEE Transactions on Visualization and Computer Graphics.

[7]  Franck Cappello,et al.  Exploring the feasibility of lossy compression for PDE simulations , 2019, Int. J. High Perform. Comput. Appl..

[8]  Abhijit Mitra,et al.  On Finite Wordlength Properties of Block-Floating-Point Arithmetic , 2008 .

[9]  Donald Ervin Knuth,et al.  The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[10]  Franck Cappello,et al.  Fast Error-Bounded Lossy HPC Data Compression with SZ , 2016, 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS).

[11]  Samuel Williams,et al.  Roofline: an insightful visual performance model for multicore architectures , 2009, CACM.

[12]  James Demmel,et al.  IEEE Standard for Floating-Point Arithmetic , 2008 .

[13]  Xiaomei Yang.  Rounding Errors in Algebraic Processes , 1964, Nature.

[14]  Nicholas J. Higham,et al.  INVERSE PROBLEMS NEWSLETTER , 1991 .

[15]  Franck Cappello,et al.  Error-Controlled Lossy Compression Optimized for High Compression Ratios of Scientific Datasets , 2018, 2018 IEEE International Conference on Big Data (Big Data).

[16]  Gideon Zwas,et al.  On two step Lax-Wendroff methods in several dimensions , 1972 .

[17]  Franck Cappello,et al.  Improving performance of iterative methods by lossy checkponting , 2018, HPDC.

[18]  Peter Lindstrom,et al.  Error Analysis of ZFP Compression for Floating-Point Data , 2018, SIAM J. Sci. Comput..

[19]  Peter Lindstrom,et al.  Fixed-Rate Compressed Floating-Point Arrays , 2014, IEEE Transactions on Visualization and Computer Graphics.

[20]  Alexander S. Szalay,et al.  Extreme Event Analysis in Next Generation Simulation Architectures , 2017, ISC.

[21]  B. A. Wade,et al.  A survey of the Kreiss matrix theorem for power bounded families of matrices and its extensions , 1997 .

[22]  J. Miller.  Numerical Analysis , 1966, Nature.

[23]  Martin Burtscher,et al.  SPDP: An Automatically Synthesized Lossless Compression Algorithm for Floating-Point Data , 2018, 2018 Data Compression Conference.

[24]  Peter Lindstrom,et al.  Assessing the effects of data compression in simulations using physically motivated metrics , 2013, SC.

[25]  Martin Burtscher,et al.  Fast lossless compression of scientific floating-point data , 2006, Data Compression Conference (DCC'06).

[26]  David Thomas,et al.  The Art in Computer Programming , 2001 .