Concentrated regular data streams on grids: sorting and routing near to the bisection bound
- 9 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Constant queue routing on a meshPublished by Springer Nature ,2005
- Reducing communication costs for sorting on mesh-connected and linearly connected parallel computersJournal of Parallel and Distributed Computing, 1990
- A 2 n -2 step algorithm for routing in an nxn array with constant size queuesPublished by Association for Computing Machinery (ACM) ,1989
- Packet routing on grids of processorsPublished by Springer Nature ,1989
- Bounds for l-selection and related problems on grids of processorsPublished by Springer Nature ,1989
- Routing and sorting on mesh-connected arraysPublished by Springer Nature ,1988
- Lower bounds for sorting on mesh-connected architecturesActa Informatica, 1987
- The distance bound for sorting on mesh-connected processor arrays is tightPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- An optimal sorting algorithm for mesh connected computersPublished by Association for Computing Machinery (ACM) ,1986
- Sorting on a mesh-connected parallel computerCommunications of the ACM, 1977