Communication algorithms for isotropic tasks in hypercubes and wraparound meshes
From MaRDI portal
Publication:1195708
DOI10.1016/0167-8191(92)90068-IzbMath0756.68017MaRDI QIDQ1195708
Dimitri P. Bertsekas, Emmanouel A. Varvarigos
Publication date: 19 January 1993
Published in: Parallel Computing (Search for Journal in Brave)
hypercubecommunication algorithmoptimal completion time algorithmsymmetric routing algorithmstotal exchange problem
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Related Items (5)
Methods and problems of communication in usual networks ⋮ Spanning subgraphs with applications to communication of a subclass of the Cayley-graph-based networks ⋮ Optimal communication algorithms for Manhattan Street networks ⋮ THE VECTOR MULTIPROCESSOR ⋮ Bandwidth efficient all-to-all broadcast on switched clusters
This page was built for publication: Communication algorithms for isotropic tasks in hypercubes and wraparound meshes
