A time-space optimal parallel sorting on a hypercube
From MaRDI portal
Publication:4229564
DOI10.1007/BF02900871zbMath0919.68021MaRDI QIDQ4229564
Publication date: 23 August 1999
Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- An efficient parallel sorting algorithm for shared memory multiprocessors
- Parallel sorting by regular sampling
- Linear sorting with O(log n) processors
- Optimal Sorting Algorithms for Parallel Computers
- Optimal VLSI sorting with reduced number of processors
- Time-space optimal parallel merging and sorting
This page was built for publication: A time-space optimal parallel sorting on a hypercube