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

DOI10.1023/B:SUPE.0000026846.74050.18MaRDI QIDQ704661zbMATH OpenFDO

Authors Ching-Hsien Hsu, Kun-Ming Yu

Publication date 19 January 2005

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

Full work available at URL https://doi.org/10.1023/B:SUPE.0000026846.74050.18

zbMATH Keywords

banded matrixCompressed diagonals remappingdata redistributionparallel algorithmruntime supportsparse matrix

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2040813
• A pipeline technique for dynamic data transfer on a multiprocessor grid
• Efficient methods for multi-dimensional array redistribution
• Efficient algorithms for block-cyclic redistribution of arrays
• Dynamic data distribution and processor repartitioning for irregularly structured computations

Cited in

(4)

• On further reducing the cost of parallel pipelined message broadcasts
• A message combining approach for efficient array redistribution in non-all-to-all communication networks
• scientific article; zbMATH DE number 2040813 (Why is no real title available?)
• A pipeline technique for dynamic data transfer on a multiprocessor grid

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q704661)