Q-GMRES: Quantized Data Transmission Optimization for Distributed GMRES Algorithm

The generalized minimal residual (GMRES) algorithm is one of the key iterative algorithms for solving large-scale sparse linear systems, which finds extensive application in scientific and engineering computations. Although distributed GMRES can handle large-scale problems, data transmission between multiple nodes emerges as a primary bottleneck. Given the inefficient utilization of finite bits in the IEEE 754 format and the potential impact of low-precision floating-point representations on the convergence of iterative algorithms, this paper proposes a quantization-based method (Q-GMRES) to compress the data transmitted between nodes. Our approach not only reduces the amount of data transmission, but also uses the limited bit-width representation to achieve high accuracy. In this paper, we explore uniform and non-uniform quantization techniques and propose inner-outer mixed-precision and vector segmentation methods to improve residual accuracy. Experimental results demonstrate that the proposed communication compression method, which combines INT16 quantization with vector segmentation, achieves speedups of up to 2.19x and 2.49x on four and eight processes, respectively, while maintaining convergence accuracy comparable to GMRES-FP64.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Architecture and Code Optimization
Published
2026-10-14
DOI
https://doi.org/10.1145/3857806
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Q-GMRES: Quantized Data Transmission Optimization for Distributed GMRES Algorithm

Hua Huang, Weixing Ji, Jianhua Gao, Yuxiang Zhang et al.
ACM Transactions on Architecture and Code Optimization
Matrix Theory and Algorithms
article

Q-GMRES: Quantized Data Transmission Optimization for Distributed GMRES Algorithm

Hua Huang, Weixing Ji, Jianhua Gao, Yuxiang Zhang, Danying Ge, Bingxin Liu
article en

Abstract

The generalized minimal residual (GMRES) algorithm is one of the key iterative algorithms for solving large-scale sparse linear systems, which finds extensive application in scientific and engineering computations. Although distributed GMRES can handle large-scale problems, data transmission between multiple nodes emerges as a primary bottleneck. Given the inefficient utilization of finite bits in the IEEE 754 format and the potential impact of low-precision floating-point representations on the convergence of iterative algorithms, this paper proposes a quantization-based method (Q-GMRES) to compress the data transmitted between nodes. Our approach not only reduces the amount of data transmission, but also uses the limited bit-width representation to achieve high accuracy. In this paper, we explore uniform and non-uniform quantization techniques and propose inner-outer mixed-precision and vector segmentation methods to improve residual accuracy. Experimental results demonstrate that the proposed communication compression method, which combines INT16 quantization with vector segmentation, achieves speedups of up to 2.19x and 2.49x on four and eight processes, respectively, while maintaining convergence accuracy comparable to GMRES-FP64.

ACM Transactions on Architecture and Code Optimization
Beijing Normal University (CN), Beijing Academy of Artificial Intelligence (CN), Intelligent Health (United Kingdom) (GB)
National Natural Science Foundation of China
Openalex Percentile: Top 14%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.