PERMUTATION ROUTING AND SORTING ON THE RECONFIGURABLE MESH
From MaRDI portal
Publication:5248975
DOI10.1142/S0129054198000143zbMath1319.68250MaRDI QIDQ5248975
Theodore McKendall, Sanguthevar Rajasekaran
Publication date: 29 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Searching and sorting (68P10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20)
Cites Work
- Constant time sorting on a processor array with a reconfigurable bus system
- Optimal routing algorithms for mesh-connected processor arrays
- A randomized algorithm for multipacket routing on the mesh
- Probabilistic Parallel Algorithms for Sorting and Selection
- Mesh connected computers with fixed and reconfigurable buses: packet routing and sorting
- k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh