arrow
Return

Distributed-memory lattice H-matrix factorization

delete2019-08-01
delete12
delete
OA
AI
I
Ichitaro Yamazaki *
A
Akihiro Ida
R
Rio Yokota
J
Jack Dongarra
DOI:10.1177/1094342019861139delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
We parallelize the LU factorization of a hierarchical low-rank matrix (H-matrix) on a distributed-memory computer. This is much more difficult than the H-matrix-vector multiplication due to the dataflow of the factorization, and it is much harder than the parallelization of a dense matrix factorization due to the irregular hierarchical block structure of the matrix. Block low-rank (BLR) format gets rid of the hierarchy and simplifies the parallelization, often increasing concurrency. However, this comes at a price of losing the near-linear complexity of the H-matrix factorization. In this work, we propose to factorize the matrix using a lattice H-matrix format that generalizes the BLR format by storing each of the blocks (both diagonals and off-diagonals) in the H-matrix format. These blocks stored in the H-matrix format are referred to as lattices. Thus, this lattice format aims to combine the parallel scalability of BLR factorization with the near-linear complexity of H-matrix factorization. We first compare factorization performances using the H-matrix, BLR, and lattice H-matrix formats under various conditions on a shared-memory computer. Our performance results show that the lattice format has storage and computational complexities similar to those of the H-matrix format, and hence a much lower cost of factorization than BLR. We then compare the BLR and lattice H-matrix factorization on distributed-memory computers. Our performance results demonstrate that compared with BLR, the lattice format with the lower cost of factorization may lead to faster factorization on the distributed-memory computer.
Keywords:
boundary element method
LU factorization
distributed memory
hierarchical matrix
task programming
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

International Journal of High Performance Computing Applications cover
International Journal of High Performance Computing Applications
IF:
2.5
Papers:
1.1K
Citations:
1.3K

Organization

U
University of Tokyo
Scholars:
7.1W
Papers: 6.5W
Citations: 2.2K
I
Institute of Science Tokyo
Scholars:
3.2W
Papers: 2.7W
Citations: 117
U
united states department of energy (doe)
Scholars:
11.3W
Papers: 9.6W
Citations: 246
S
Sandia National Laboratories
Scholars:
5.4K
Papers: 3.7K
Citations: 6.4K
researcher View more organizations