June 2026

Conference Paper

HP-MDR: High-performance and Portable Data Refactoring and Progressive Retrieval with Advanced GPUs

By:
Li, Yanliang; Li, Wenbo; Gong, Qian ; Liu, Qing; Podhorszki, Norbert ; Klasky, Scott A; Liang, Xin; Chen, Jieyang
Page Number:
2076-2093
Book Title:
SC '25: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis
Publication Date:
June 10, 2026
Conference Name:
The International Conference for High Performance Computing, Networking, Storage, and Analysis 2025 (SC '25)
Conference Location:
St. Louis, Missouri, United States of America
Conference Sponsor:
ACM, smighpc, IEEE Computer Society, TCHPC
View DOI Listing:
https://doi.org/10.1145/3712285.3759845

Abstract

Scientific applications produce vast amounts of data, posing grand challenges in the underlying data management and analytic tasks. Progressive compression is a promising way to address this problem, as it allows for on-demand data retrieval with significantly reduced data movement cost. However, most existing progressive methods are designed for CPUs, leaving a gap for them to unleash the power of today’s heterogeneous computing systems with GPUs.In this work, we propose HP-MDR, a high-performance and portable data refactoring and progressive retrieval framework for GPUs. Our contributions are four-fold: (1) We carefully optimize the bitplane encoding and lossless encoding, two key stages in progressive methods, to achieve high performance on GPUs; (2) We propose pipeline optimization and incorporate it with data refactoring and progressive retrieval workflows to further enhance the performance for large data process; (3) We leverage our framework to enable high-performance data retrieval with guaranteed error control for common Quantities of Interest; (4) We evaluate HP-MDR and compare it with state of the arts using five real-world datasets. Experimental results demonstrate that HP-MDR delivers an average 13.68 × and 6.31 × throughput in data refactoring and progressive retrieval tasks, respectively. It also leads to 11.22 × throughput for recomposing required data representations under Quantity-of-Interest error control and 6.04 × performance for the corresponding end-to-end data retrieval, when compared with state-of-the-art solutions.