Pangolin: An efficient and flexible graph mining system on cpu and gpu

X Chen, R Dathathri, G Gill, K Pingali - Proceedings of the VLDB …, 2020 - dl.acm.org
There is growing interest in graph pattern mining (GPM) problems such as motif counting.
GPM systems have been developed to provide unified interfaces for programming …

Single machine graph analytics on massive datasets using intel optane dc persistent memory

G Gill, R Dathathri, L Hoang, R Peri… - arXiv preprint arXiv …, 2019 - arxiv.org
Intel Optane DC Persistent Memory (Optane PMM) is a new kind of byte-addressable
memory with higher density and lower cost than DRAM. This enables the design of …

Subway: Minimizing data transfer during out-of-GPU-memory graph processing

AHN Sabet, Z Zhao, R Gupta - … of the Fifteenth European Conference on …, 2020 - dl.acm.org
In many graph-based applications, the graphs tend to grow, imposing a great challenge for
GPU-based graph processing. When the graph size exceeds the device memory capacity …

Evaluation of graph analytics frameworks using the gap benchmark suite

A Azad, MM Aznaveh, S Beamer… - 2020 IEEE …, 2020 - ieeexplore.ieee.org
Graphs play a key role in data analytics. Graphs and the software systems used to work with
them are highly diverse. Algorithms interact with hardware in different ways and which graph …

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 …

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

Z Peng, M Zhang, K Li, R Jin, 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 …

Egraph: efficient concurrent GPU-based dynamic graph processing

Y Zhang, Y Liang, J Zhao, F Mao, L Gu… - … on Knowledge and …, 2022 - ieeexplore.ieee.org
In many applications of the analysis of dynamic graph, many Timing iterative Graph
Processing (TGP) jobs usually need to be generated for the processing of the corresponding …

A study of graph analytics for massive datasets on distributed multi-gpus

V Jatala, R Dathathri, G Gill, L Hoang… - 2020 IEEE …, 2020 - ieeexplore.ieee.org
There are relatively few studies of distributed GPU graph analytics systems in the literature
and they are limited in scope since they deal with small data-sets, consider only a few …

Asynchronous Distributed-Memory Parallel Algorithms for Influence Maximization

SP Singhal, S Hati, J Young, V Sarkar… - … Conference for High …, 2024 - ieeexplore.ieee.org
Influence maximization (IM) is the problem of finding the k most influential nodes in a graph.
We propose distributed-memory parallel algorithms for the two main kernels of a state-of-the …

LargeGraph: An efficient dependency-aware GPU-accelerated large-scale graph processing

Y Zhang, D Peng, X Liao, H Jin, H Liu, L Gu… - ACM Transactions on …, 2021 - dl.acm.org
Many out-of-GPU-memory systems are recently designed to support iterative processing of
large-scale graphs. However, these systems still suffer from long time to converge because …