Scalability of parallel sorting on mesh multicomputers
- 9 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- On the scalability of FFT on parallel computersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Parallel Quicksort using fetch-and-addIEEE Transactions on Computers, 1990
- A hypercube algorithm for the 0/1 Knapsack problemJournal of Parallel and Distributed Computing, 1988
- Routing and sorting on mesh-connected arraysPublished by Springer Nature ,1988
- Parallel depth first search. Part II. AnalysisInternational Journal of Parallel Programming, 1987
- Data parallel algorithmsCommunications of the ACM, 1986
- A note on the height of binary search treesJournal of the ACM, 1986
- MULTILISP: a language for concurrent symbolic computationACM Transactions on Programming Languages and Systems, 1985
- Systolic Sorting on a Mesh-Connected NetworkIEEE Transactions on Computers, 1985
- Solving some graph problems with optimal or near-optimal speedup on mesh-of-trees networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985