Improving Structured Grid-Based Sparse Matrix-Vector Multiplication and Gauss–Seidel Iteration on GPDSP
Applied Sciences · 03.08.2023 · 13 (15) · 8952
DOI: 10.3390/app13158952 ↗Kurz gefasst
Fachartikel in der Zeitschrift Applied Sciences, online erschienen am 03.08.2023. Verfasst von Yang Wang und 5 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 22 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Key Research and Development Program of China, National Natural Science Foundation of China, National University of Defense Technology Foundation.
Abstract (Originalsprache)
Structured grid-based sparse matrix-vector multiplication and Gauss–Seidel iterations are very important kernel functions in scientific and engineering computations, both of which are memory intensive and bandwidth-limited. GPDSP is a general purpose digital signal processor, which is a very significant embedded processor that has been introduced into high-performance computing. In this paper, we designed various optimization methods, which included a blocking method to improve data locality and increase memory access efficiency, a multicolor reordering method to develop Gauss–Seidel fine-grained parallelism, a data partitioning method designed for GPDSP memory structures, and a double buffering method to overlap computation and access memory on structured grid-based SpMV and Gauss–Seidel iterations for GPDSP. At last, we combined the above optimization methods to design a multicore vectorization algorithm. We tested the matrices generated with structured grids of different sizes on the GPDSP platform and obtained speedups of up to 41× and 47× compared to the unoptimized SpMV and Gauss–Seidel iterations, with maximum bandwidth efficiencies of 72% and 81%, respectively. The experiment results show that our algorithms could fully utilize the external memory bandwidth. We also implemented the commonly used mixed precision algorithm on the GPDSP and obtained speedups of 1.60× and 1.45× for the SpMV and Gauss–Seidel iterations, respectively.
Förderung
- National Key Research and Development Program of China
- National Natural Science Foundation of China
- National University of Defense Technology Foundation
Zitieren
APA
Wang, Y., Liu, J., Zhu, X., Zhang, Q., Li, S., & Wang, Q. (2023). Improving Structured Grid-Based Sparse Matrix-Vector Multiplication and Gauss–Seidel Iteration on GPDSP. Applied Sciences, 13(15), 8952. https://doi.org/10.3390/app13158952
Vancouver
Wang Y, Liu J, Zhu X, Zhang Q, Li S, Wang Q. Improving Structured Grid-Based Sparse Matrix-Vector Multiplication and Gauss–Seidel Iteration on GPDSP. Applied Sciences. 2023;13(15):8952. doi:10.3390/app13158952
BibTeX
@article{Wang2023,
author = {Wang, Yang and Liu, Jie and Zhu, Xiaoxiong and Zhang, Qingyang and Li, Shengguo and Wang, Qinglin},
title = {Improving Structured Grid-Based Sparse Matrix-Vector Multiplication and Gauss–Seidel Iteration on GPDSP},
journal = {Applied Sciences},
year = {2023},
volume = {13},
number = {15},
pages = {8952},
doi = {10.3390/app13158952}
}
EUVIMED