Matching the bisection bound for routing and sorting on the mesh
- 1 June 1992
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Concentrated regular data streams on grids: sorting and routing near to the bisection boundPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On bit-serial packet routing for the mesh and the torusPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Reducing communication costs for sorting on mesh-connected and linearly connected parallel computersJournal of Parallel and Distributed Computing, 1990
- Multi-packet-routing on mesh connected arraysPublished by Association for Computing Machinery (ACM) ,1989
- A 2 n -2 step algorithm for routing in an nxn array with constant size queuesPublished by Association for Computing Machinery (ACM) ,1989
- Probabilistic Parallel Algorithms for Sorting and SelectionSIAM Journal on Computing, 1985
- Universal schemes for parallel communicationPublished by Association for Computing Machinery (ACM) ,1981
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- Sorting on a mesh-connected parallel computerCommunications of the ACM, 1977
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952