A message combining approach for efficient array redistribution in non-all-to-all communication networks

DOI10.1080/00207160701537873zbMath1178.68081OpenAlexW2036859348MaRDI QIDQ3543509

Stavros Souravlas, Manos Roumeliotis

Publication date: 4 December 2008

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160701537873

zbMATH Keywords

algorithmparallelarray redistributionHPFdata reorganization

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05) Distributed systems (68M14) General topics in the theory of algorithms (68W01) Numerical algorithms for specific classes of architectures (65Y10)

Cites Work

• Optimizations for efficient array redistribution on distributed memory multicomputers.
• A pipeline technique for dynamic data transfer on a multiprocessor grid
• A compressed diagonals remapping technique for dynamic data redistribution on banded sparse matrix
• A framework for efficient data redistribution on distributed memory multicomputers
• Unnamed Item

This page was built for publication: A message combining approach for efficient array redistribution in non-all-to-all communication networks