Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Trust: Triangle Counting Reloaded on GPUs

Journal Article · · IEEE Transactions on Parallel and Distributed Systems
 [1];  [2];  [2];  [2];  [3];  [4];  [5];  [5];  [6];  [7];  [1]
  1. Stevens Institute of Technology, Hoboken, NJ (United States)
  2. Nanjing Univ., Jiangsu (China)
  3. Huazhong Univ. of Science and Technology, Hubei (China)
  4. Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
  5. Brookhaven National Lab. (BNL), Upton, NY (United States)
  6. Univ. of Connecticut, Storrs, CT (United States)
  7. Univ. of California, Merced, CA (United States)
Triangle counting is a building block for a wide range of graph applications. Here, traditional wisdom suggests that i) hashing is not suitable for triangle counting, ii) edge-centric triangle counting beats vertex-centric design, and iii) communication-free and workload balanced graph partitioning is a grand challenge for triangle counting. On the contrary, we advocate that i) hashing can help the key operations for scalable triangle counting on Graphics Processing Units (GPUs), i.e., list intersection and graph partitioning, ii) vertex-centric option reduces both hash table construction cost and memory consumption, which is limited on GPUs. In addition, iii) we exploit graph and workload collaborative, and hash-based 2D partitioning to scale vertex-centric triangle counting over 1,000 GPUs with sustained scalability. In this work, we present TRUST, which performs triangle counting with the hash operation and vertex-centric paradigm. To the best of our knowledge, TRUST is the first work that achieves over one trillion Traversed Edges Per Second (TEPS) rate for triangle counting.
Research Organization:
Brookhaven National Laboratory (BNL), Upton, NY (United States)
Sponsoring Organization:
National Key R&D Program of China; National Natural Science Foundation of China; National Science Foundation; USDOE Office of Science (SC), Advanced Scientific Computing Research; USDOE Office of Science (SC), Basic Energy Sciences (BES). Scientific User Facilities Division
Grant/Contract Number:
AC05-00OR22725; SC0012704
OSTI ID:
1805277
Report Number(s):
BNL--221701-2021-JAAM
Journal Information:
IEEE Transactions on Parallel and Distributed Systems, Journal Name: IEEE Transactions on Parallel and Distributed Systems Journal Issue: 11 Vol. 32; ISSN 1045-9219
Publisher:
IEEECopyright Statement
Country of Publication:
United States
Language:
English

References (75)

Combining Data Duplication and Graph Reordering to Accelerate Parallel Graph Processing conference June 2019
PDTL: Parallel and distributed triangle listing for massive graphs report January 2015
Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks preprint January 2010
Beyond Triangles: A Distributed Framework for Estimating 3-profiles of Large Graphs preprint January 2015
Triangle counting in large networks: a review journal October 2017
Counting triangles in real-world networks using projections journal March 2010
Graph based anomaly detection and description: a survey journal July 2014
Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation journal August 2010
On parallel hashing and integer sorting journal December 1991
Colorful triangle counting and a MapReduce implementation journal March 2012
I/O-efficient join dependency testing, Loomis–Whitney join, and triangle enumeration journal December 2016
Social Network Analysis book January 1994
Collective dynamics of ‘small-world’ networks journal June 1998
LiteTE: Lightweight, Communication-Efficient Distributed-Memory Triangle Enumerating journal January 2019
Approximate triangle counting algorithms on multi-cores conference October 2013
A fast parallel algorithm for counting triangles in graphs using dynamic load balancing conference October 2015
Efficient triangle listing for billion-scale graphs conference December 2016
ApproxG: Fast Approximate Parallel Graphlet Counting Through Accuracy Control conference May 2018
Static graph challenge on GPU conference September 2017
TriX: Triangle counting at extreme scale conference September 2017
Collaborative (CPU + GPU) algorithms for triangle counting and truss decomposition on the Minsky architecture: Static graph challenge: Subgraph isomorphism conference September 2017
Fast linear algebra-based triangle counting with KokkosKernels
  • Wolf, Michael M.; Deveci, Mehmet; Berry, Jonathan W.
  • 2017 IEEE High-Performance Extreme Computing Conference (HPEC), 2017 IEEE High Performance Extreme Computing Conference (HPEC) https://doi.org/10.1109/HPEC.2017.8091043
conference September 2017
First look: Linear algebra-based triangle counting without matrix multiplication conference September 2017
Truss decomposition on shared-memory parallel systems conference September 2017
Triangle counting for scale-free graphs at scale in distributed memory conference September 2017
Update on Static Graph Challenge on GPU conference September 2018
Triangle Counting and Truss Decomposition using FPGA conference September 2018
High-Performance Triangle Counting on GPUs conference September 2018
Scalable Triangle Counting on Distributed-Memory Systems conference September 2019
DistTC: High Performance Distributed Triangle Counting conference September 2019
H-INDEX: Hash-Indexing for Parallel Triangle Counting on GPUs conference September 2019
Multicore triangle computations without tuning conference April 2015
REPT: A Streaming Algorithm of Approximating Global and Local Triangle Counts in Parallel conference April 2019
Triangle Counting on GPU Using Fine-Grained Task Distribution conference April 2019
PDTL: Parallel and Distributed Triangle Listing for Massive Graphs conference September 2015
Scaling Techniques for Massive Scale-Free Graphs in Distributed (External) Memory conference May 2013
Parallel Triangle Counting and Enumeration Using Matrix Algebra conference May 2015
Counting Triangles in Large Graphs on GPU conference May 2016
G-Store: High-Performance Graph Store for Trillion-Edge Processing conference November 2016
TriCore: Parallel Triangle Counting on GPUs conference November 2018
Counting Triangles in Large Graphs by Random Sampling journal August 2016
Efficient Detection of Overlapping Communities Using Asymmetric Triangle Cuts journal January 2018
On Efficient External-Memory Triangle Listing journal August 2019
High Performance Exact Triangle Counting on GPUs journal December 2017
Triadic Measures on Graphs: The Power of Wedge Sampling conference December 2013
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs journal January 1998
DOULION: counting triangles in massive graphs with a coin
  • Tsourakakis, Charalampos E.; Kang, U.; Miller, Gary L.
  • Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '09 https://doi.org/10.1145/1557019.1557111
conference January 2009
What is Twitter, a social network or a news media? conference January 2010
Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks conference January 2011
Counting triangles and the curse of the last reducer conference January 2011
Triangle listing in massive networks and its applications conference January 2011
Accelerating CUDA graph algorithms at maximum warp journal February 2011
Brief announcement: the problem based benchmark suite conference January 2012
Ligra: a lightweight graph processing framework for shared memory conference January 2013
Massive graph triangulation conference June 2013
Patric
  • Arifuzzaman, Shaikh; Khan, Maleq; Marathe, Madhav
  • Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM '13 https://doi.org/10.1145/2505515.2505545
conference January 2013
An efficient MapReduce algorithm for counting triangles in a very large graph conference January 2013
High quality, scalable and parallel community detection for large real graphs conference April 2014
BUbiNG conference April 2014
I/O-Efficient Algorithms on Triangle Listing and Counting journal December 2014
Put Three and Three Together
  • Prat-Pérez, Arnau; Dominguez-Sal, David; Brunat, Josep-M.
  • ACM Transactions on Knowledge Discovery from Data, Vol. 10, Issue 3 https://doi.org/10.1145/2775108
journal January 2016
Beyond Triangles
  • Elenberg, Ethan R.; Shanmugam, Karthikeyan; Borokhovich, Michael
  • Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining https://doi.org/10.1145/2783258.2783413
conference August 2015
Enterprise: breadth-first graph traversal on GPUs
  • Liu, Hang; Huang, H. Howie
  • SC15: The International Conference for High Performance Computing, Networking, Storage and Analysis, Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis https://doi.org/10.1145/2807591.2807594
conference November 2015
Efficient Subgraph Matching by Postponing Cartesian Products conference June 2016
SNAP: A General-Purpose Network Analysis and Graph-Mining Library journal July 2016
A Comparative Study on Exact Triangle Counting Algorithms on the GPU conference May 2016
Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions conference May 2018
Griffin journal February 2018
Accelerating All-Edge Common Neighbor Counting on Three Processors conference August 2019
Graph-based anomaly detection conference January 2003
The webgraph framework I: compression techniques conference January 2004
Truss decomposition in massive networks journal May 2012
Scalable subgraph enumeration in MapReduce journal June 2015
Approximately counting triangles in large graph streams including edge duplicates with a fixed memory usage journal October 2017
A distributed multi-GPU system for fast graph processing journal November 2017

Similar Records

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments
Technical Report · Thu Oct 01 00:00:00 EDT 2020 · OSTI ID:1669197

A Block-Based Triangle Counting Algorithm on Heterogeneous Environments
Journal Article · Mon Jan 31 19:00:00 EST 2022 · IEEE Transactions on Parallel and Distributed Systems · OSTI ID:1810367

GraphReduce: Processing Large-Scale Graphs on Accelerator-Based Systems
Conference · Sat Nov 14 23:00:00 EST 2015 · OSTI ID:1254609