Junqi Wang

Dr. Junqi Wang


Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 January 2010 in Journal of High Energy Physics
Verified
Journal Article
Closed access
PDF file
BFBo Feng
Bo Feng
JWJunqi Wang
Junqi Wang
YWYihong Wang
Yihong Wang
ZZZhibai Zhang
Zhibai Zhang

20 July 2023 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
YLYida Li
Yida Li
HLHuizhang Luo
Huizhang Luo
FLFenfang Li
Fenfang Li
JWJunqi Wang
Junqi Wang
KLKenli Li
Kenli Li
Data compression can efficiently reduce the memory and persistence storage cost, which is highly desirable in modern computing systems, such as enterprise, cloud, and High-Performance Computing (HPC) environments. However, the main challenges of existing data compressors are the insufficient compression ratio and low throughput. This paper focuses on improving the compression ratio of state-of-the-art lossy compression algorithms from the view of applications. Besides, we also use the characteristics of the applications to reduce the runtime overhead. To this end, we explore the idea with Adaptive Mesh Refinement (AMR), which is widely adopted as a computational technique to reduce the amount of computation and memory required in scientific simulations. We propose Level Associated Mapping-based Preconditioning (LAMP) to improve the storage efficiency of AMR applications. The main idea is twofold. First, we utilize the high similarities among the adjacent AMR levels to precondition the data prior to compression. Second, AMR has a unique characteristic of grid structures. We utilize grid structures to rebuild a level associated mapping table, which significantly reduces the runtime overhead of LAMP. Thanks to the optimization techniques of General Matrix Multiplication (GEMM), we further accelerate the process of rebuilding AMR hierarchy for LAMP. Besides, we also block multiple adjacent coordinates within a box and further improve cache locality. The experimental results show that the compression ratios of LAMP are improved up to 63.8% compared to directly compressing the data.

20 January 2026 in Information Processing & Management
Verified
Journal Article
Closed access
HYHui Ye
Hui Ye
XGXuri Ge
Xuri Ge
JWJunqi Wang
Junqi Wang
JFJunchen Fu
Junchen Fu
XXXin Xin
Xin Xin
ZCZhumin Chen
Zhumin Chen

1 December 2022 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
HLHuizhang Luo
Huizhang Luo
JWJunqi Wang
Junqi Wang
ZQZhenlu Qin
Zhenlu Qin
DHDan Huang
Dan Huang
QLQing Liu
Qing Liu
HJHong Jiang
Hong Jiang
In this paper, we propose and evaluate the idea that data need to be preconditioned prior to compression, such that they can better match the design philosophies of lossy compressors for HPC scientific data. In particular, we aim to identify a reduced model that can be utilized to transform the original data into a more compressible form. We begin with two PDE applications as a proof of concept, in which we demonstrate that a reduced model can indeed reside in the full model output, and can be utilized to improve compression ratios. A mathematical proof is also presented to show how the compression ratio is improved by the reduced model. We further explore more general dimension reduction techniques to extract the reduced model, including principal component analysis, singular value decomposition, and discrete wavelet transform. After preconditioning, the reduced model in conjunction with difference between the reduced model and full model is stored, which results in higher compression ratios. We evaluate the reduced models on ten scientific datasets, and the results show the effectiveness of our approaches. Given that there is no single method that consistently achieves the best performance, we further propose a selection strategy that guides users to select the best reduced model prior to data reduction.

11 September 2024 in ACM Transactions on Embedded Computing Systems
Verified
Journal Article
Open access
FLFenfang Li
Fenfang Li
HLHuizhang Luo
Huizhang Luo
JWJunqi Wang
Junqi Wang
YLYida Li
Yida Li
ZTZhuo Tang
Zhuo Tang
KLKenli Li
Kenli Li
With the increasing scale of cloud computing applications of next-generation embedded systems, a major challenge that domain scientists are facing is how to efficiently store and analyze the vast volume of output data. Compression can reduce the amount of data that needs to be transferred and stored. However, most of the large datasets are in floating-point format, which exhibits high entropy. As a result, existing lossless compressors cannot provide enough performance for such applications. To address this problem, we propose a total variation reduction method for improving the compression ratio of lossless compressors (namely, FPC + and FPZIP + ), which employs a median-based hyperplane to precondition the data. In particular, we first try to exploit the space-filling curve (SFC), a well-known technique to preserve data locality for a multi-dimensional dataset. We show and explain why a raw SFC, such as Hilbert and Z-order curves, cannot improve the compression ratio. Then, we explore the opportunity and theoretical feasibility of the proposed total variation reduction-based algorithm. The experiment results show the effectiveness of the proposed method. The compression ratios are improved up to 48.2% (20.6% on average) for FPZIP and 42.4% (18.4% on average) for FPC. Moreover, through observing the time composition of the proposed method, it is found that the median finding holds a high percentage of the execution time. Hence, we further introduce an approximate median finding algorithm, providing a linear-time overhead reduction scheme. The experiment results clearly demonstrate that this algorithm reduces execution time by an average of 56.7% and 40.7% compared to FPC + and FPZIP + , respectively.