Efficient algorithms for parallel sorting on mesh multicomputers
- 1 April 1991
- journal article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 20 (2) , 95-131
- https://doi.org/10.1007/bf01407839
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Parallel Quicksort using fetch-and-addIEEE Transactions on Computers, 1990
- Routing and sorting on mesh-connected arraysPublished by Springer Nature ,1988
- Parallel depth first search. Part II. AnalysisInternational Journal of Parallel Programming, 1987
- A note on the height of binary search treesJournal of the ACM, 1986
- An optimal sorting algorithm for mesh connected computersPublished by Association for Computing Machinery (ACM) ,1986
- Systolic Sorting on a Mesh-Connected NetworkIEEE Transactions on Computers, 1985
- Research on Parallel Machine Architecture for Fifth-Generation Computer SystemsComputer, 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
- Bitonic Sort on a Mesh-Connected Parallel ComputerIEEE Transactions on Computers, 1979
- Sorting on a mesh-connected parallel computerCommunications of the ACM, 1977