A survey of distributed graph algorithms on massive graphs
Distributed processing of large-scale graph data has many practical applications and has
been widely studied. In recent years, a lot of distributed graph processing frameworks and …
been widely studied. In recent years, a lot of distributed graph processing frameworks and …
Dimmining: pruning-efficient and parallel graph mining on near-memory-computing
Graph mining, which finds specific patterns in the graph, is becoming increasingly important
in various domains. We point out that accelerating graph mining suffers from the following …
in various domains. We point out that accelerating graph mining suffers from the following …
Hypergraf: Hyperdimensional graph-based reasoning acceleration on fpga
The latest hardware accelerators proposed for graph applications primarily focus on graph
neural networks (GNNs) and graph mining. High-level graph reasoning tasks, such as graph …
neural networks (GNNs) and graph mining. High-level graph reasoning tasks, such as graph …
Ndminer: accelerating graph pattern mining using near data processing
Graph Pattern Mining (GPM) algorithms mine structural patterns in graphs. The performance
of GPM workloads is bottlenecked by control flow and memory stalls. This is because of data …
of GPM workloads is bottlenecked by control flow and memory stalls. This is because of data …
Fingers: Exploiting fine-grained parallelism in graph mining accelerators
Graph mining is an emerging application of high importance and also with high complexity,
thus requiring efficient hardware acceleration. Current accelerator designs only utilize …
thus requiring efficient hardware acceleration. Current accelerator designs only utilize …
Sgcn: Exploiting compressed-sparse features in deep graph convolutional network accelerators
Graph convolutional networks (GCNs) are becoming increasingly popular as they overcome
the limited applicability of prior neural networks. One recent trend in GCNs is the use of deep …
the limited applicability of prior neural networks. One recent trend in GCNs is the use of deep …
Trapezoid: A Versatile Accelerator for Dense and Sparse Matrix Multiplications
Accelerating matrix multiplication is crucial to achieve high performance in many application
domains, including neural networks, graph analytics, and scientific computing. These …
domains, including neural networks, graph analytics, and scientific computing. These …
GraphINC: Graph Pattern Mining at Network Speed
Graph Pattern Mining (GPM) is a class of algorithms that identifies given shapes within a
graph, eg, cliques of a certain size. Any area of a graph can contain a shape of interest, but …
graph, eg, cliques of a certain size. Any area of a graph can contain a shape of interest, but …
Seizing the bandwidth scaling of on-package interconnect in a post-Moore's law world
The slowing and forecasted end of Moore's Law have forced designers to look beyond
simply adding transistors, encouraging them to employ other unused resources as a manner …
simply adding transistors, encouraging them to employ other unused resources as a manner …
: Large-Scale Graph Triangle Counting on a Single Machine Using GPUs
In this paper, we build a-, a high-performance graph processing system specific for a triangle
counting algorithm on graph data with up to tens of billions of edges, which significantly …
counting algorithm on graph data with up to tens of billions of edges, which significantly …