Parallel k-truss decomposition on multicore systems

Humayun Kabir, Kamesh Madduri

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

14 Scopus citations

Abstract

We discuss our submission to the HPEC 2017 Static Graph Challenge on k-truss decomposition and triangle counting. Our results use an algorithm called PKT (Parallel k-truss) designed for multicore systems. We are able to process almost all Graph Challenge datasets in under a minute on a 24-core server with 128 GB memory. For a synthetic Graph500 graph with 17 million vertices and 523 million edges, triangle counting takes 16 seconds and truss decomposition takes 29 minutes on the 24-core server.

Original languageEnglish (US)
Title of host publication2017 IEEE High Performance Extreme Computing Conference, HPEC 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538634721
DOIs
StatePublished - Oct 30 2017
Event2017 IEEE High Performance Extreme Computing Conference, HPEC 2017 - Waltham, United States
Duration: Sep 12 2017Sep 14 2017

Publication series

Name2017 IEEE High Performance Extreme Computing Conference, HPEC 2017

Other

Other2017 IEEE High Performance Extreme Computing Conference, HPEC 2017
CountryUnited States
CityWaltham
Period9/12/179/14/17

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Parallel k-truss decomposition on multicore systems'. Together they form a unique fingerprint.

  • Cite this

    Kabir, H., & Madduri, K. (2017). Parallel k-truss decomposition on multicore systems. In 2017 IEEE High Performance Extreme Computing Conference, HPEC 2017 [8091052] (2017 IEEE High Performance Extreme Computing Conference, HPEC 2017). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/HPEC.2017.8091052