SAPCo Sort: Optimizing Degree-Ordering for Power-Law Graphs
Mohsen Koohi Esfahani, Peter Kilpatrick, Hans Vandierendonck · 2022
We introduce the Structure-Aware Parallel Counting (SAPCo) Sort algorithm that optimizes performance of degree-ordering, a key operation in graph analytics. SAPCo leverages the skewed degree distribution to accelerate sorting. The evaluation for graphs of up to 3.6 billion vertices shows that SAPCo sort is, on average, 1.7-33.5 times faster than state-of-the-art sorting algorithms such as counting sort, radix sort, and sample sort.