Thanos: High-Performance CPU-GPU Based Balanced Graph Partitioning Using Cross-Decomposition

Dae Hee Kim, Rakesh Nagi, Deming Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

As graphs become larger and more complex, it is becoming nearly impossible to process them without graph partitioning. Graph partitioning creates many subgraphs which can be processed in parallel thus delivering high-speed computation results. However, graph partitioning is a difficult task. In this work, we introduce Thanos, a fast graph partitioning tool which uses the cross-decomposition algorithm that iteratively partitions a graph. It also produces balanced loads of partitions. The algorithm is well suited for parallel GPU programming which leads to fast and high-quality graph partitioning solutions. Experimental results show that we have achieved 30x speedup and 35% better edge cut reduction compared to the CPU version of the popular graph partitioner, METIS, on average.

Original languageEnglish (US)
Title of host publicationASP-DAC 2020 - 25th Asia and South Pacific Design Automation Conference, Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages91-96
Number of pages6
ISBN (Electronic)9781728141237
DOIs
StatePublished - Jan 2020
Event25th Asia and South Pacific Design Automation Conference, ASP-DAC 2020 - Beijing, China
Duration: Jan 13 2020Jan 16 2020

Publication series

NameProceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC
Volume2020-January

Conference

Conference25th Asia and South Pacific Design Automation Conference, ASP-DAC 2020
Country/TerritoryChina
CityBeijing
Period1/13/201/16/20

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design

Fingerprint

Dive into the research topics of 'Thanos: High-Performance CPU-GPU Based Balanced Graph Partitioning Using Cross-Decomposition'. Together they form a unique fingerprint.

Cite this