Transposition of banded matrices in hypercubes: A nearly isotropic task

DOI10.1016/0167-8191(94)00031-5MaRDI QIDQ1907153zbMATH OpenOpenAlexFDO

Authors Emmanouel Varvarigos, Dimitri P. Bertsekas

Publication date 29 April 1996

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/3285

zbMATH Keywords

banded matrixcommunication algorithmhypercube networkisotropic communication taskminimum completion time algorithmssparse matrixtransposition

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Network design and communication in computer systems (68M10)

Recommendations

• Communication algorithms for isotropic tasks in hypercubes and wraparound meshes
• Algorithms for Matrix Transposition on Boolean N-Cube Configured Ensemble Architectures
• Matrix transpose on meshes with buses
• Transposing arrays on multicomputers using de Bruijn sequences
• Hypercube matrix multiplication

Cited in

(4)

• Communication algorithms for isotropic tasks in hypercubes and wraparound meshes
• Transposing arrays on multicomputers using de Bruijn sequences
• Matrix transpose on meshes with buses
• Fibonacci hypercube

This page was built for publication: Transposition of banded matrices in hypercubes: A nearly isotropic task

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