Name
Abstract | ||
|---|---|---|
In order to solve many real problems, we have to sort array segments of data. This sorting task is called segmented sorting. Problems like image processing and suffix array construction usually have huge amount of data and their solutions make use the segmented sorting procedure. There are several techniques for solving the segmented sorting. A previous work showed that a strategy called fix sort had a good performance to sort segments of arrays. This strategy adjusts the input array to allow off-the-shelf general sorting algorithms to execute segmented sorting. Besides the extensive tests that were done in the previous work, the implemented fix sort solution did not explore in full the proposed parallel algorithm. In this work we revisit the sequential and parallel algorithms to the fix sort strategy creating new parallel and sequential implementations. We compared our results with the previous methods to sort multiple segments. The obtained results showed that our implementations of fix sort strategy achieved better execution times than the previous ones. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/HPCS48598.2019.9188196 | 2019 International Conference on High Performance Computing & Simulation (HPCS) |
Keywords | DocType | ISBN |
segmented sorting,fix sort,CUDA libraries,merge sort,radix sort | Conference | 978-1-7281-4485-6 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rafael F. Schmid | 1 | 0 | 0.34 |
| Edson Norberto Cáceres | 2 | 29 | 7.30 |