Research Article
ISort: SSD Internal Sorting Algorithm for Big Data
Algorithm 2
Pseudo-code for run merge phase.
| (1) | Input: Partial sorted runs | | (2) | Output: Sorted data | | (3) | Read and | | (4) | while has not yet processed all pages do | | (5) | if there are pages in the memory then | | (6) | Sort | | (7) | Output minimum key into buffer | | (8) | if the output buffer is full then | | (9) | Flush the output buffer to flash chip | | (10) | end if | | (11) | end if | | (12) | end while = 0 |
|
