Jul 2026· IEEE International Symposium on High-Performance Parallel Distributed Computing· pp. 58-70· 2 citations· 57 references
Computer Science
TL;DR
The OPAL universal framework is the OPAL universal framework, an adaptive architecture that endows generic lossy compressors with on-demand retrieval capabilities, enabling flexible and progressive access across multiple spatial regions, resolutions, and precisions.
Abstract
Scientific applications generate massive amounts of data, necessitating effective data reduction techniques like error-bounded lossy compression. While state-of-the-art error-bounded lossy compressors effectively reduce storage footprint, they typically treat the compressed data as monolithic blobs, forcing analysts to decompress large volumes just to access specific data modalities. Conversely, existing storage solutions designed for flexible access lack the efficiency of modern compression. To bridge this gap between efficient compression and flexible data retrieval, we propose OPAL, a unified system that harmonizes high-performance compression with flexible, on-demand data access. Our first contribution is the OPAL universal framework, an adaptive architecture that endows generic lossy compressors with on-demand retrieval capabilities, enabling flexible and progressive access across multiple spatial regions, resolutions, and precisions. Our second contribution is OPALI, a customized compression algorithm designed natively with flexible data access in mind. By leveraging novel mechanisms such as shadow anchors, hybrid storage, and grouped bit-plane coding, OPALI eliminates the overhead inherent in generic wrappers. Extensive evaluations on real-world scientific datasets demonstrate that OPAL transforms standard compressors into flexible retrieval engines, while OPALI achieves superior compression ratios and retrieval performance, significantly accelerating scientific discovery.
This work presents an adaptive progressive compression framework that improves retrieval efficiency for two common targets, namely error-bound and peak Signal-to-Noise ratios and proposes coefficient decomposition, a novel method that exploits the commonly overlooked spatial correlations among decorrelated data.
Cortado is compared with state-of-the-art approaches and it is found that it is the only progressive compressor that guarantees the evaluated error bounds on all tested inputs while achieving the highest throughputs, comparable reconstruction quality, and on-par compression ratios.
It is argued that replacing autoregressive LLMs with DLMs within the same compression framework could overcome the throughput bottleneck caused by their one-symbol-per-step limitation, and the newly proposed DLM-based framework advances the state of the art in lossless text compression.
This first comprehensive study of data heterogeneity and lossless general-purpose compression performance for representative datasets from the PETRA III synchrotron radiation source provides a quantitative basis for future archival and storage decisions at PETRA III, its future successor, PETRA IV, and other large-scal...
M. Buschmann, Yannis Schumann, Christian Voss et al.· 0 citations
BlockMGARD is proposed, an adaptive, Region-of-Interest (ROI)-supported GPU lossy compressor, with four contributions: an In-cache Block decomposition leveraging GPU on-chip memory and constant lookup tables to accelerate decomposition; a hybrid hierarchy combining In-cache Block and global decomposition to balance spe...
Yan-Liang Li, Qian Gong, Qing Liu et al.· 0 citations
FaCTz is presented, the first GPU-based error-bounded lossy compressor that guarantees critical-point preservation and provides a block-wise mode optimized for throughput and a speculative per-point mode optimized for compression ratio.
Mingze Xia, Yu-Xiao Li, Sheng Di et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.