A distributed tridiagonal solver with a packed data structure and diagonal-dominance-based truncation sustains roughly 66% of peak memory bandwidth on large CPU and GPU clusters using only neighbor-neighbor message passing.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Distributed-memory Tridiagonal Solver Based on a Specialised Data Structure Optimised for CPU and GPU Architectures
A distributed tridiagonal solver with a packed data structure and diagonal-dominance-based truncation sustains roughly 66% of peak memory bandwidth on large CPU and GPU clusters using only neighbor-neighbor message passing.