A compressed diagonals remapping technique for dynamic data redistribution on banded sparse matrix

DOI10.1023/B:SUPE.0000026846.74050.18zbMath1069.68647MaRDI QIDQ704661

Ching-Hsien Hsu, Kun-Ming Yu

Publication date: 19 January 2005

Published in: The Journal of Supercomputing (Search for Journal in Brave)

zbMATH Keywords

sparse matrixparallel algorithmbanded matrixCompressed diagonals remappingdata redistributionruntime support

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Distributed systems (68M14)

Related Items (2)

A message combining approach for efficient array redistribution in non-all-to-all communication networks ⋮ On further reducing the cost of parallel pipelined message broadcasts

This page was built for publication: A compressed diagonals remapping technique for dynamic data redistribution on banded sparse matrix