paper-with-me

홈 › Papers

Cached Operator Reordering: A Unified View for Fast GNN Training

2023-08-23 · Julia Bazinska, Andrei Ivanov, Tal Ben-Nun, Nikoli Dryden, Maciej Besta, Siyuan Shen, Torsten Hoefler

Graph Neural Networks (GNNs) are a powerful tool for handling structured graph data and addressing tasks such as node classification, graph classification, and clustering. However, the sparse nature of GNN computation poses new challenges for performance optimization compared to traditional deep neural networks. We address these challenges by providing a unified view of GNN computation, I/O, and memory. By analyzing the computational graphs of the Graph Convolutional Network (GCN) and Graph Attention (GAT) layers -- two widely used GNN layers -- we propose alternative computation strategies. We present adaptive operator reordering with caching, which achieves a speedup of up to 2.43x for GCN compared to the current state-of-the-art. Furthermore, an exploration of different caching schemes for GAT yields a speedup of up to 1.94x. The proposed optimizations save memory, are easily implemented across various hardware platforms, and have the potential to alleviate performance bottlenecks in training large-scale GNN models.

📄 PDF Abstract BibTeX arXiv:2308.12093

Code (0)

등록된 구현이 없습니다.

Tasks

Graph AttentionGraph ClassificationNode Classification

Methods 이 논문이 사용한 방법론

GCN A Graph Convolutional Network, or GCN, is an approach for semi-supervised learning on graph-structured data. It is based on an efficient variant of [convolutional neural…
GAT A Graph Attention Network (GAT) is a neural network architecture that operates on graph-structured data, leveraging masked self-attentional layers to address the shortcomings…

Similar Papers 제목 키워드 기반

Fast and Accurate Reordering with ITG Transition RNN

2018-08-01 · COLING 2018 8 · Hao Zhang, Axel Ng, Richard Sproat

Attention-based sequence-to-sequence neural network models learn to jointly align and translate. The quadratic-time attention mechanism is powerful as it is capable of handling arbitrary long-distance reordering, but com…

DecoderFeature EngineeringMachine TranslationMorphological Inflection+3

Phrase-based Machine Translation using Multiple Preordering Candidates

2016-12-01 · COLING 2016 12 · Yusuke Oda, Taku Kudo, Tetsuji Nakagawa, Taro Watanabe

In this paper, we propose a new decoding method for phrase-based statistical machine translation which directly uses multiple preordering candidates as a graph structure. Compared with previous phrase-based decoding meth…

DecoderMachine TranslationTranslation

Grounded Cache Routing for Retrieval-Augmented Generation: When Is It Safe to Reuse an Answer?

2026-05-26 · Syed Huma Shah arxiv

Modern retrieval-augmented generation(RAG) deployments increasingly rely on caching to reduce token cost and time-to-first-token(TTFT). Prefix-level KV reuse is now standard in serving stacks such as vLLM, and chunk-leve…

Neural networks on microcontrollers: saving memory at inference via operator reordering

2019-10-02 · Edgar Liberis, Nicholas D. Lane

Designing deep learning models for highly-constrained hardware would allow imbuing many edge devices with intelligence. Microcontrollers (MCUs) are an attractive platform for building smart devices due to their low cost,…

FastUSP: A Multi-Level Collaborative Acceleration Framework for Distributed Diffusion Model Inference

2026-02-11 · Guandong Li arxiv

Large-scale diffusion models such as FLUX (12B parameters) and Stable Diffusion 3 (8B parameters) require multi-GPU parallelism for efficient inference. Unified Sequence Parallelism (USP), which combines Ulysses and Ring…