Time lower bounds for parallel sorting on a mesh-connected processor array
From MaRDI portal
Publication:1112618
DOI10.1007/BF00288975zbMath0659.68087MaRDI QIDQ1112618
Publication date: 1989
Published in: Acta Informatica (Search for Journal in Brave)
sorting; parallel algorithm; indexing schemes; chain argument; mesh-connected processor array; time lower bound
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds for sorting on mesh-connected architectures
- Indexing functions and time lower bounds for sorting on a mesh-connected computer
- The VLSI Complexity of Sorting
- Tight Bounds on the Complexity of Parallel Sorting
- Systolic Sorting on a Mesh-Connected Network
- Sorting in Average Time $o(\log \,n)$
- Sorting on a mesh-connected parallel computer
- Bitonic Sort on a Mesh-Connected Parallel Computer