On the design of a high-performance, expandable, sorting engine
From MaRDI portal
Publication:4332001
DOI10.1016/0167-9260(94)90014-0zbMATH Open0875.68153OpenAlexW2094380363MaRDI QIDQ4332001FDOQ4332001
Nick Kanopoulos, George Alexiou Ph., Dimitri Stiliadis
Publication date: 27 February 1997
Published in: Integration (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-9260(94)90014-0
Recommendations
- Modular Design of High-Throughput, Low-Latency Sorting Units
- Engineering a cache-oblivious sorting algorithm
- An optimal hardware-algorithm for sorting using a fixed-size parallel sorting device
- scientific article; zbMATH DE number 1852169
- Engineering External Memory Induced Suffix Sorting
- Hardware Design of Low-Power High-Throughput Sorting Unit
- scientific article; zbMATH DE number 1156609
- An Architecture for Bitonic Sorting with Optimal VLSI Performnance
Cited In (1)
This page was built for publication: On the design of a high-performance, expandable, sorting engine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4332001)