Intensive hypercube communication. Prearranged communication in link-bound machines
Journal of Parallel and Distributed Computing
Improved bounds for routing and sorting on multi-dimensional meshes
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
ROMM routing on mesh and torus networks
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Don't be too clever: routing BMMC permutations on the MasPar MP-2
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Derandomizing algorithms for routing and sorting on meshes
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
An optimal routing algorithm for mesh-connected Parallel computers
Journal of the ACM (JACM)
Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Desnakification of Mesh Sorting Algorithms
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
| Hi-index | 0.00 |
Matrix transpose is a fundamental communication operation which is not dealt with optimally by general purpose routing schemes. For two dimensional meshes, the first optimal routing schedule is given. The strategy is simple enough to be implemented, but details of the available hardware are not favorable. However, alternative algorithms, designed along the same lines, give an improvement on the Intel Paragon.