Data driven parallel sorting system and method
US9990412B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Apr 28, 2014 |
| Grant date | Jun 5, 2018 |
| Priority date | — |
| Expiry date | Jul 27, 2035 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/254
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A data driven parallel sorting method includes distributing input data records to n partitions one by one in a circular manner. Each partition corresponds to a parallel sorting process with an allocated memory chunk sized to store m data records. The method also includes sorting, in parallel, current data records in respective memory chunks in respective partitions. The method also includes in response to distribution of data records of └m/n┘ rounds, circularly controlling one of the n partitions, and writing data records that have been sorted in the memory chunk of the partition into a mass storage as an ordered data chunk, and emptying the memory chunk. The method also includes in response to all data records being distributed, writing data chunks that have been sorted in respective memory chunks into the mass storage, and performing a merge sort on all ordered data chunks in the mass storage.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.