Efficient algorithms for parallel sorting on mesh multicomputers
From MaRDI portal
Publication:1193763
DOI10.1007/BF01407839zbMath0761.68043MaRDI QIDQ1193763
Publication date: 27 September 1992
Published in: International Journal of Parallel Programming (Search for Journal in Brave)
scalability; resource consumption; mesh multicomputer; quicksort; parallel sorting algorithms; isoefficiency metric
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel depth first search. II: Analysis
- Towards a complexity theory of synchronous parallel computation
- Systolic Sorting on a Mesh-Connected Network
- MULTILISP: a language for concurrent symbolic computation
- Development of Parallel Methods for a $1024$-Processor Hypercube
- A note on the height of binary search trees
- Sorting on a mesh-connected parallel computer
- Optimal Sorting Algorithms for Parallel Computers
- Bitonic Sort on a Mesh-Connected Parallel Computer