Graphit: A high-performance graph dsl
The performance bottlenecks of graph applications depend not only on the algorithm and
the underlying hardware, but also on the size and structure of the input graph. As a result …
the underlying hardware, but also on the size and structure of the input graph. As a result …
A comprehensive exploration of languages for parallel computing
Software-intensive systems in most domains, from autonomous vehicles to health, are
becoming predominantly parallel to efficiently manage large amount of data in short (even …
becoming predominantly parallel to efficiently manage large amount of data in short (even …
Practical parallel hypergraph algorithms
J Shun - Proceedings of the 25th ACM SIGPLAN Symposium on …, 2020 - dl.acm.org
While there has been significant work on parallel graph processing, there has been very
surprisingly little work on high-performance hypergraph processing. This paper presents a …
surprisingly little work on high-performance hypergraph processing. This paper presents a …
ReGraph: Scaling graph processing on HBM-enabled FPGAs with heterogeneous pipelines
The use of FPGAs for efficient graph processing has attracted significant interest. Recent
memory subsystem upgrades including the introduction of HBM in FPGAs promise to further …
memory subsystem upgrades including the introduction of HBM in FPGAs promise to further …
Sage: Parallel semi-asymmetric graph algorithms for NVRAMs
Non-volatile main memory (NVRAM) technologies provide an attractive set of features for
large-scale graph analytics, including byte-addressability, low idle power, and improved …
large-scale graph analytics, including byte-addressability, low idle power, and improved …
Depgraph: A dependency-driven accelerator for efficient iterative graph processing
Many graph processing systems have been recently developed for many-core processors.
However, for iterative graph processing, due to the dependencies between vertices' states …
However, for iterative graph processing, due to the dependencies between vertices' states …
XBFS: eXploring runtime optimizations for breadth-first search on GPUs
Attracted by the enormous potentials of Graphics Processing Units (GPUs), an array of
efforts has surged to deploy Breadth-First Search (BFS) on GPUs, which, however, often …
efforts has surged to deploy Breadth-First Search (BFS) on GPUs, which, however, often …
Scaling graph traversal to 281 trillion edges with 40 million cores
Graph processing, especially high-performance graph traversal, plays a more and more
important role in data analytics. The successor of Sunway TaihuLight, New Sunway, is …
important role in data analytics. The successor of Sunway TaihuLight, New Sunway, is …
DiGraph: An efficient path-based iterative directed graph processing system on multiple GPUs
Many systems are recently proposed for large-scale iterative graph analytics on a single
machine with GPU accelerators. Despite of many research efforts, for iterative directed graph …
machine with GPU accelerators. Despite of many research efforts, for iterative directed graph …
Scalable graph convolutional network training on distributed-memory systems
Graph Convolutional Networks (GCNs) are extensively utilized for deep learning on graphs.
The large data sizes of graphs and their vertex features make scalable training algorithms …
The large data sizes of graphs and their vertex features make scalable training algorithms …