Transposition of banded matrices in hypercubes: A nearly isotropic task

From MaRDI portal

Revision as of 14:13, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1907153

Jump to:navigation, search

DOI10.1016/0167-8191(94)00031-5zbMath0836.65063OpenAlexW1999597732MaRDI QIDQ1907153

Dimitri P. Bertsekas, Emmanouel A. Varvarigos

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

sparse matrix transposition banded matrix hypercube network communication algorithm isotropic communication task minimum completion time algorithms

Mathematics Subject Classification ID

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

Related Items (1)

Fibonacci hypercube

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1907153&oldid=14323426"