SAPCo Sort: Optimizing Degree-Ordering for Power-Law Graphs

被引：0
|
作者：
Esfahani, Mohsen Koohi [1 ]
Kilpatrick, Peter [1 ]
Vandierendonck, Hans [1 ]
机构：
[1] Queens Univ Belfast, Belfast, North Ireland
来源：
2022 IEEE INTERNATIONAL SYMPOSIUM ON PERFORMANCE ANALYSIS OF SYSTEMS AND SOFTWARE (ISPASS 2022) | 2022年
基金：
英国工程与自然科学研究理事会;
关键词：
High Performance Computing; Graph Algorithms; Degree-Ordering; Sorting Algorithms; Real-World Graphs; Structure-Aware Algorithms;
D O I：
10.1109/ISPASS55109.2022.00015
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：138 / 140
页数：3
相关论文
共 50 条
  • [1] Uniform generation of random graphs with power-law degree sequences
    Gao, Pu
    Wormald, Nicholas
    [J]. SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 1741 - 1758
  • [2] On the Bias of Traceroute Sampling: or, Power-Law Degree Distributions in Regular Graphs
    Achlioptas, Dimitris
    Clauset, Aaron
    Kempe, David
    Moore, Cristopher
    [J]. JOURNAL OF THE ACM, 2009, 56 (04)
  • [3] Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence
    Allendorf, Daniel
    Meyer, Ulrich
    Penschuck, Manuel
    Tran, Hung
    Wormald, Nick
    [J]. 2022 PROCEEDINGS OF THE SYMPOSIUM ON ALGORITHM ENGINEERING AND EXPERIMENTS, ALENEX, 2022, : 27 - 40
  • [4] Asynchronous binary byzantine consensus over graphs with power-law degree sequence
    Weldehawaryat, Goitom
    Wolthusen, Stephen
    [J]. IFIP Advances in Information and Communication Technology, 2014, 441 : 263 - 276
  • [5] Construction of Growing Graphs with Given Power-Law Asymptotics of Vertex Degree Distributions
    Zadorozhnyi, V. N.
    Yudin, E. B.
    [J]. 2018 12TH INTERNATIONAL IEEE SCIENTIFIC AND TECHNICAL CONFERENCE ON DYNAMICS OF SYSTEMS, MECHANISMS AND MACHINES (DYNAMICS), 2018,
  • [6] ASYNCHRONOUS BINARY BYZANTINE CONSENSUS OVER GRAPHS WITH POWER-LAW DEGREE SEQUENCE
    Weldehawaryat, Goitom
    Wolthusen, Stephen
    [J]. CRITICAL INFRASTRUCTURE PROTECTION VIII, 2014, 441 : 263 - 276
  • [7] Remarks on power-law random graphs
    Yin, Mei
    [J]. STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 2022, 153 : 183 - 197
  • [8] Compact Routing in Power-Law Graphs
    Chen, Wei
    Sommer, Christian
    Teng, Shang-Hua
    Wang, Yajun
    [J]. DISTRIBUTED COMPUTING, PROCEEDINGS, 2009, 5805 : 379 - +
  • [9] On the hardness of optimization in power-law graphs
    Ferrante, Alessandro
    Pandurangan, Gopal
    Park, Kihong
    [J]. THEORETICAL COMPUTER SCIENCE, 2008, 393 (1-3) : 220 - 230
  • [10] A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence
    Cooper, Colin
    Radzik, Tomasz
    Siantos, Yiannis
    [J]. INTERNET MATHEMATICS, 2014, 10 (1-2) : 137 - 161
12345