PERMUTATION ROUTING AND SORTING ON THE RECONFIGURABLE MESH
From MaRDI portal
Recommendations
- Permutation routing on reconfigurable meshes
- Deterministic Permutation Routing on Meshes
- Fast permutation routing in a class of interconnection networks
- Shorter queues for permutation routing on meshes
- Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus
- Mesh permutation routing with locality
- A fast parallel algorithm for routing in permutation networks
- Randomized multipacket routing and sorting on meshes
Cites work
- A randomized algorithm for multipacket routing on the mesh
- Constant time sorting on a processor array with a reconfigurable bus system
- k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh
- Mesh connected computers with fixed and reconfigurable buses: packet routing and sorting
- Optimal routing algorithms for mesh-connected processor arrays
- Probabilistic Parallel Algorithms for Sorting and Selection
Cited in
(9)- Don't be too clever: Routing BMMC permutations on the MasPar MP-2
- Adaptive AT\(^2\) optimal algorithms on reconfigurable meshes
- Integer sorting and routing in arrays with reconfigurable optical buses
- Deterministic Permutation Routing on Meshes
- Mesh connected computers with fixed and reconfigurable buses: packet routing and sorting
- Constant time sorting on reconfigurable meshes
- Fast permutation routing in a class of interconnection networks
- Permutation routing on reconfigurable meshes
- Using bus linearization to scale the reconfigurable mesh
This page was built for publication: PERMUTATION ROUTING AND SORTING ON THE RECONFIGURABLE MESH
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248975)
