Truss decomposition on shared-memory parallel systems

Citations Over TimeTop 10% of 2017 papers

Abstract

The scale of data used in graph analytics grows at an unprecedented rate. More than ever, domain experts require efficient and parallel algorithms for tasks in graph analytics. One such task is the truss decomposition, which is a hierarchical decomposition of the edges of a graph and is closely related to the task of triangle enumeration. As evidenced by the recent GraphChallenge, existing algorithms and implementations for truss decomposition are insufficient for the scale of modern datasets. In this work, we propose a parallel algorithm for computing the truss decomposition of massive graphs on a shared-memory system. Our algorithm breaks a computation-efficient serial algorithm into several bulk-synchronous parallel steps which do not rely on atomics or other fine-grained synchronization. We evaluate our algorithm across a variety of synthetic and real-world datasets on a 56-core Intel Xeon system. Our serial implementation achieves over 1400 × speedup over the provided GraphChallenge serial benchmark implementation and is up to 28 × faster than the state-of-the-art shared-memory parallel algorithm.

Related Papers

• → On extending Amdahl’s law to learn computer performance(2022)7 cited
• → Software based distributed shared memory (DSM) model using shared variables between multiprocessors(2015)6 cited
• → FastNBL: fast neighbor lists establishment for molecular dynamics simulation based on bitwise operations(2019)3 cited
• → Developments in water science—No 1—Computer systems and water resources(1975)
• → On Extending Amdahl's law to Learn Computer Performance(2021)