DeepAI AI Chat
Log In Sign Up

Parallel Minimum Spanning Forest Computation using Sparse Matrix Kernels

by   Tim Baer, et al.
University of Illinois at Urbana-Champaign

Formulations of graph algorithms using sparse linear algebra have yielded highly scalable distributed algorithms for problems such as connectivity and shortest path computation. We develop the first formulation of the Awerbuch-Shiloach parallel minimum spanning forest (MSF) algorithm using linear algebra primitives. We introduce a multilinear kernel that operates on an adjacency matrix and two vectors. This kernel updates graph vertices by simultaneously using information from both adjacent edges and vertices. In addition, we explore optimizations to accelerate the shortcutting step in the Awerbuch-Shiloach algorithm. We implement this MSF algorithm with Cyclops, a distributed-memory library for generalized sparse tensor algebra. We analyze the parallel scalability of our implementation on the Stampede2 supercomputer.


page 1

page 2

page 3

page 4


Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model

We study dynamic graph algorithms in the Massively Parallel Computation ...

Engineering Massively Parallel MST Algorithms

We develop and extensively evaluate highly scalable distributed-memory a...

The Sparse Abstract Machine

We propose the Sparse Abstract Machine (SAM), an intermediate representa...

Audience Creation for Consumables – Simple and Scalable Precision Merchandising for a Growing Marketplace

Consumable categories, such as grocery and fast-moving consumer goods, a...

Kokkos Kernels: Performance Portable Sparse/Dense Linear Algebra and Graph Kernels

As hardware architectures are evolving in the push towards exascale, dev...

Delta-stepping SSSP: from Vertices and Edges to GraphBLAS Implementations

GraphBLAS is an interface for implementing graph algorithms. Algorithms ...

Linear Algebra and Number of Spanning Trees

A network-theoretic approach for determining the complexity of a graph i...