An Overview of Medusa: Simplified Graph Processing on GPUs

被引:6
|
作者
Zhong, Jianlong [1 ]
He, Bingsheng [1 ]
机构
[1] Nanyang Technol Univ, Singapore 639798, Singapore
关键词
Algorithms; Performance; GPGPU; GPU Programming; Graph Processing; Runtime Framework; ALGORITHMS;
D O I
10.1145/2370036.2145855
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Graphs are the de facto data structures for many applications, and efficient graph processing is a must for the application performance. GPUs have an order of magnitude higher computational power and memory bandwidth compared to CPUs and have been adopted to accelerate several common graph algorithms. However, it is difficult to write correct and efficient GPU programs and even more difficult for graph processing due to the irregularities of graph structures. To address those difficulties, we propose a programming framework named Medusa to simplify graph processing on GPUs. Medusa offers a small set of APIs, based on which developers can define their application logics by writing sequential code without awareness of GPU architectures. The Medusa runtime system automatically executes the developer defined APIs in parallel on the GPU, with a series of graph-centric optimizations. This poster gives an overview of Medusa, and presents some preliminary results.
引用
收藏
页码:283 / 284
页数:2
相关论文
共 50 条
  • [21] Graph Signal Processing: Overview, Challenges, and Applications
    Ortega, Antonio
    Frossard, Pascal
    Kovacevic, Jelena
    Moura, Jose M. F.
    Vandergheynst, Pierre
    PROCEEDINGS OF THE IEEE, 2018, 106 (05) : 808 - 828
  • [22] G3: When Graph Neural Networks Meet Parallel Graph Processing Systems on GPUs
    Liu, Husong
    Lu, Shengliang
    Chen, Xinyu
    He, Bingsheng
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2020, 13 (12): : 2813 - 2816
  • [23] GStream: A Graph Streaming Processing Method for Large-Scale Graphs on GPUs
    Seo, Hyunseok
    Kim, Jinwook
    Kim, Min-Soo
    ACM SIGPLAN NOTICES, 2015, 50 (08) : 253 - 254
  • [24] GTS: A Fast and Scalable Graph Processing Method based on Streaming Topology to GPUs
    Kim, Min-Soo
    An, Kyuhyeon
    Park, Himchan
    Seo, Hyunseok
    Kim, Jinwook
    SIGMOD'16: PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2016, : 447 - 461
  • [25] Scalable Graph Sampling on GPUs with Compressed Graph
    Yin, Hongbo
    Shao, Yingxia
    Miao, Xupeng
    Li, Yawen
    Cui, Bin
    PROCEEDINGS OF THE 31ST ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, CIKM 2022, 2022, : 2383 - 2392
  • [26] Turning Digital Signal Processing into Graph Signal Processing: Overview and Applications
    Dantas, Pierre, V
    Carvalho, Celso B.
    Junior, Waldir S. S.
    2020 IEEE INTERNATIONAL CONFERENCE ON CONSUMER ELECTRONICS - TAIWAN (ICCE-TAIWAN), 2020,
  • [27] Graph Coloring Using GPUs
    Sistla, Meghana Aparna
    Nandivada, V. Krishna
    EURO-PAR 2019: PARALLEL PROCESSING, 2019, 11725 : 377 - 390
  • [28] Evaluating Graph Coloring on GPUs
    Grosset, A. V. Pascal
    Zhu, Peihong
    Liu, Shusen
    Venkatasubramanian, Suresh
    Hall, Mary
    ACM SIGPLAN NOTICES, 2011, 46 (08) : 297 - 298
  • [29] Efficient and Simplified Parallel Graph Processing over CPU and MIC
    Chen, Linchuan
    Huo, Xin
    Ren, Bin
    Jain, Surabhi
    Agrawal, Gagan
    2015 IEEE 29TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2015, : 819 - 828
  • [30] Medusa: a simple tool for interaction graph analysis
    Hooper, SD
    Bork, P
    BIOINFORMATICS, 2005, 21 (24) : 4432 - 4433