Of the papers presented, three won or placed in a group of HPEC conference challenges, also referred to as the GraphChallenge.

The GraphChallenge seeks to develop tests from diverse research communities and groundbreaking efforts such as the Graph500 and GraphAnalysis, both of which CSE Chair David Bader is a committee member. 

Fast Triangle Counting Using Cilk by CSE Professor Ümit Çatalyürek and Ph.D. Student Abdurrahman Yasar, as well as researchers form Sandia National Laboratory, was one of four submissions to win the title of 2018 GraphChallenge champions. 

"Triangle counting is a representative graph analysis algorithm with several applications and one of three benchmarks used in the IEEE HPEC GraphChallenge,” said Yasar. “This paper improves upon the work that is implemented in Kokkoskernels library, one of the fastest implementations for the triangle counting problem in last year’s GraphChallenge.”

“In addition to fast implementation, this work also provides a significantly improved analysis of the results, showing better agreement between theory and experiment,” Yasar said.

Of the three winning submissions, Fast and Adaptive List Intersections on the GPUplaced as a GraphChallenge Finalist Paper and Logarithmic Radix Binning and Vectorized Triangle Counting received an innovation award. 

"HPEC GraphChallenge provides a standard set of key graph problems that the larger community can work on. One of the difficulties is achieving good parallel performance across a wide variety of datasets,” said CSE Ph.D. Student James Fox, lead investigator of the GraphChallenge finalist paper submission. 

“This paper contributes an input-adaptive approach to load-balancing and improving the performance of list intersections, important in triangle counting and other applications that involve finding common neighbors." 

The conference takes place Sept. 25 through 27 in Waltham, Massachusetts.

Below are the titles of Georgia Tech’s research being presented this week.

• Fast and Adaptive List Intersections on the GPU - James Fox, Oded Green, Kasimir Gabert, Xiaojing An, David Bader 
• Fast Triangle Counting Using Cilk - Abdurrahman Yasar, Sivasankaran Rajamanickam, Michael Wolf, Jonathan Berry, Ümit Çatalyürek
•  Logarithmic Radix Binning and Vectorized Triangle Counting - Oded Green, James Fox, Alex Watkins, Alok Tripathy, Kasimir Gabert, Euna Kim, An Xiaojing, Kumar Aatish, David Bader 
• Performance Effects of Backing Data Stores in Community Detection Algorithms - Rohit Thankachan, Brian Swenson, James Fairbanks
• Scaling Betweenness Centrality in Dynamic Graphs - Alok Tripathy, Oded Green
• Hornet: An Efficient Data Structure for Dynamic Sparse Graphs and Matrices on GPUs - Federico Busato, Oded Green, Nicola Bombieri, David Bader