Analysis of Hardware Sorting Units in Processor Design
Sorting is often computationally intensive and can cause the application in which it is used to run slowly. To date, the quickest software sorting implementations for an N element sorting problem runs at O(nlogn). Current techniques, beyond developing better algorithms, used to accelerate sorting in...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
DigitalCommons@CalPoly
2019
|
| Subjects: | |
| Online Access: | https://digitalcommons.calpoly.edu/theses/2020 https://digitalcommons.calpoly.edu/cgi/viewcontent.cgi?article=3417&context=theses |