Trust: Triangle Counting Reloaded on GPUs
Journal Article
·
· IEEE Transactions on Parallel and Distributed Systems
- Stevens Institute of Technology, Hoboken, NJ (United States)
- Nanjing Univ., Jiangsu (China)
- Huazhong Univ. of Science and Technology, Hubei (China)
- Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
- Brookhaven National Lab. (BNL), Upton, NY (United States)
- Univ. of Connecticut, Storrs, CT (United States)
- 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
Similar Records
A Block-Based Triangle Counting Algorithm on Heterogeneous Environments
A Block-Based Triangle Counting Algorithm on Heterogeneous Environments
GraphReduce: Processing Large-Scale Graphs on Accelerator-Based Systems
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