Conflict-free parallel radix sorting device, system and method
US12197734B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jan 13, 2023 |
| Grant date | Jan 14, 2025 |
| Priority date | — |
| Expiry date | Apr 23, 2043 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F3/0673
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A conflict-free parallel radix sorting algorithm, and devices and systems implementing this algorithm, schedules memory copies of data elements of a large dataset so that there is always a single copy to each target memory each cycle of operation for the system implementing the algorithm. The conflict-free parallel radix sorting algorithm eliminates memory copying conflicts in copying data elements from different source memories to the same target memory and in this way maintains maximum throughput for the copying of data elements from source memories to target memories, reducing the time required to sort the data elements of the large dataset.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.