Random walks on huge graphs at cache efficiency

K Yang, X Ma, S Thirumuruganathan, K Chen… - Proceedings of the ACM …, 2021 - dl.acm.org
Data-intensive applications dominated by random accesses to large working sets fail to
utilize the computing power of modern processors. Graph random walk, an indispensable …

Distributed graph embedding with information-oriented random walks

P Fang, A Khan, S Luo, F Wang, D Feng, Z Li… - arXiv preprint arXiv …, 2023 - arxiv.org
Graph embedding maps graph nodes to low-dimensional vectors, and is widely adopted in
machine learning tasks. The increasing availability of billion-edge graphs underscores the …

Noswalker: A decoupled architecture for out-of-core random walk processing

S Wang, M Zhang, K Yang, K Chen, S Ma… - Proceedings of the 28th …, 2023 - dl.acm.org
Out-of-core random walk system has recently attracted a lot of attention as an economical
way to run billions of walkers over large graphs. However, existing out-of-core random walk …

HUGE: Huge Unsupervised Graph Embeddings with TPUs

BA Mayer, A Tsitsulin, H Fichtenberger… - Proceedings of the 29th …, 2023 - dl.acm.org
Graphs are a representation of structured data that captures the relationships between sets
of objects. With the ubiquity of available network data, there is increasing industrial and …

Information-Oriented Random Walks and Pipeline Optimization for Distributed Graph Embedding

P Fang, Z Li, A Khan, S Luo, F Wang… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Graph embedding maps graph nodes to low-dimensional vectors and is widely used in
machine learning tasks. The increasing availability of billion-edge graphs underscores the …

QUINT: Node Embedding Using Network Hashing

D Bera, R Pratap, BD Verma, B Sen… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
Representation learning using network embedding has received tremendous attention due
to its efficacy to solve downstream tasks. Popular embedding methods (such as deepwalk …

LightTraffic: On Optimizing CPU-GPU Data Traffic for Efficient Large-scale Random Walks

Y Xing, Y Li, Z Wang, Y Xu… - 2023 IEEE 39th …, 2023 - ieeexplore.ieee.org
As a fundamental tool for graph analysis, random walk receives extensive attention in both
industry and academia. For computing massive random walks, recent works show that GPUs …

Gpu overdrive fault attacks on neural networks

M Sabbagh, Y Fei, D Kaeli - 2021 IEEE/ACM International …, 2021 - ieeexplore.ieee.org
Graphics processing units (GPUs) are commonly used to accelerate training and inference
of deep neural networks (DNNs). Modern cloud nodes are shared by multiple users to …

Efficient and scalable techniques for pagerank-based graph analytics

R Yang - 2020 - dr.ntu.edu.sg
Graphs are ubiquitous today and are a fundamental data structure to represent objects and
their relations in various domains, eg, social science, citation analysis, weblink analysis, and …

[PDF][PDF] ADGRAPH: ACCURATE, DISTRIBUTED TRAINING ON LARGE GRAPHS

L Zhang, Z Lai, F Liu, Z Ran - academia.edu
Graph neural networks (GNNs) have been emerging as powerful learning tools for
recommendation systems, social networks and knowledge graphs. In these domains, the …