Shared-memory Graph Truss Decomposition

被引:27
|
作者
Kabir, Humayun [1 ]
Madduri, Kamesh [1 ]
机构
[1] Penn State Univ, Comp Sci & Engn, University Pk, PA 16802 USA
基金
美国国家科学基金会;
关键词
k-truss; k-core; multicore; graph analysis;
D O I
10.1109/HiPC.2017.00012
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We present PKT, a new shared-memory parallel algorithm and OpenMP implementation for the truss decomposition of large sparse graphs. A k-truss is a dense subgraph definition that can be considered a relaxation of a clique. Truss decomposition refers to a partitioning of all the edges in the graph based on their k-truss membership. The truss decomposition of a graph has many applications. We show that our new approach PKT consistently outperforms other truss decomposition approaches for a collection of large sparse graphs and on a 24-core shared-memory server. PKT is based on a recently proposed algorithm for k-core decomposition.
引用
收藏
页码:13 / 22
页数:10
相关论文
共 50 条
  • [21] Slicing Shared-Memory Concurrent Programs The Threaded System Dependence Graph Revisited
    Galindo, Carlos
    Llorens, Marisa
    Perez, Sergio
    Silva, Josep
    2023 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE MAINTENANCE AND EVOLUTION, ICSME, 2023, : 73 - 83
  • [22] Understanding Priority-Based Scheduling of Graph Algorithms on a Shared-Memory Platform
    Yesil, Serif
    Heidarshenas, Azin
    Morrison, Adam
    Torrellas, Josep
    PROCEEDINGS OF SC19: THE INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS, 2019,
  • [23] Fast Parallel Graph Triad Census and Triangle Counting on Shared-memory Platforms
    Parimalarangan, Sindhuja
    Slota, George M.
    Madduri, Kamesh
    2017 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2017, : 1500 - 1509
  • [24] MEMORY ACCESS DEPENDENCIES IN SHARED-MEMORY MULTIPROCESSORS
    DUBOIS, M
    SCHEURICH, C
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1990, 16 (06) : 660 - 673
  • [25] Memory latency in distributed shared-memory multiprocessors
    Motlagh, BS
    DeMara, RF
    PROCEEDINGS IEEE SOUTHEASTCON '98: ENGINEERING FOR A NEW ERA, 1998, : 134 - 137
  • [26] MEMORY MANAGEMENT FOR PARALLEL TASKS IN SHARED-MEMORY
    LANGENDOEN, KG
    MULLER, HL
    VREE, WG
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 637 : 165 - 178
  • [27] BOUNDS ON SHARED-MEMORY FOR MUTUAL EXCLUSION
    BURNS, JE
    LYNCH, NA
    INFORMATION AND COMPUTATION, 1993, 107 (02) : 171 - 184
  • [28] Processor Assisted Worklist Scheduling for FPGA Accelerated Graph Processing on a Shared-Memory Platform
    Wang, Yu
    Hoe, James C.
    Nurvitadhi, Eriko
    2019 27TH IEEE ANNUAL INTERNATIONAL SYMPOSIUM ON FIELD-PROGRAMMABLE CUSTOM COMPUTING MACHINES (FCCM), 2019, : 136 - 144
  • [29] SHARED-MEMORY CONTROLLERS LINK PROCESSORS
    AOUIZERAT, R
    MINI-MICRO SYSTEMS, 1983, 16 (11): : 272 - 274
  • [30] APPLICATIVE PARALLELISM ON A SHARED-MEMORY MULTIPROCESSOR
    OLDEHOEFT, RR
    CANN, DC
    IEEE SOFTWARE, 1988, 5 (01) : 62 - 70