Automine: harmonizing high-level abstraction and high performance for graph mining

D Mawhirter, B Wu - Proceedings of the 27th ACM Symposium on …, 2019‏ - dl.acm.org
Graph mining algorithms that aim at identifying structural patterns of graphs are typically
more complex than graph computation algorithms such as breadth first search. Researchers …

MTM: Rethinking memory profiling and migration for multi-tiered large memory

J Ren, D Xu, J Ryu, K Shin, D Kim, D Li - Proceedings of the Nineteenth …, 2024‏ - dl.acm.org
Multi-terabyte large memory systems are often characterized by more than two memory tiers
with different latency and bandwidth. Multi-tiered large memory systems call for rethinking of …

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 …

Atmem: Adaptive data placement in graph applications on heterogeneous memories

Y Chen, IB Peng, Z Peng, X Liu, B Ren - Proceedings of the 18th ACM …, 2020‏ - dl.acm.org
Active development in new memory devices, such as non-volatile memories and high-
bandwidth memories, brings heterogeneous memory systems (HMS) as a promising …

iqan: Fast and accurate vector search with efficient intra-query parallelism on multi-core architectures

Z Peng, M Zhang, K Li, R **, B Ren - … of the 28th ACM SIGPLAN Annual …, 2023‏ - dl.acm.org
Vector search has drawn a rapid increase of interest in the research community due to its
application in novel AI applications. Maximizing its performance is essential for many tasks …

Taming the zoo: The unified graphit compiler framework for novel architectures

A Brahmakshatriya, E Furst, VA Ying… - 2021 ACM/IEEE 48th …, 2021‏ - ieeexplore.ieee.org
We live in a new Cambrian Explosion of hardware devices. The end of conventional
processor scaling has driven research and industry practice to explore a new generation of …

Scaph: Scalable {GPU-Accelerated} Graph Processing with {Value-Driven} Differential Scheduling

L Zheng, X Li, Y Zheng, Y Huang, X Liao, H **… - 2020 USENIX Annual …, 2020‏ - usenix.org
We introduce Scaph, a GPU-accelerated graph system that achieves scale-up graph
processing on large-scale graphs that are initially partitioned into subgraphs at the host to …

Compiling graph applications for GPU s with GraphIt

A Brahmakshatriya, Y Zhang, C Hong… - 2021 IEEE/ACM …, 2021‏ - ieeexplore.ieee.org
The performance of graph programs depends highly on the algorithm, the size and structure
of the input graphs, as well as the features of the underlying hardware. No single set of …

Feluca: A two-stage graph coloring algorithm with color-centric paradigm on GPU

Z Zheng, X Shi, L He, H **, S Wei… - IEEE Transactions on …, 2020‏ - ieeexplore.ieee.org
There are great challenges in performing graph coloring on GPU in general. First, the long-
tail problem exists in the recursion algorithm because the conflict (ie, different threads assign …

A deep dive into understanding the random walk-based temporal graph learning

N Talati, D **, H Ye, A Brahmakshatriya… - 2021 IEEE …, 2021‏ - ieeexplore.ieee.org
Machine learning on graph data has gained significant interest because of its applicability to
various domains ranging from product recommendations to drug discovery. While there is a …