paper-with-me

Papers

COIN: Communication-Aware In-Memory Acceleration for Graph Convolutional Networks

2022-05-15 · Sumit K. Mandal, Gokul Krishnan, A. Alper Goksoy, Gopikrishnan Ravindran Nair, Yu Cao, Umit Y. Ogras

Graph convolutional networks (GCNs) have shown remarkable learning capabilities when processing graph-structured data found inherently in many application areas. GCNs distribute the outputs of neural networks embedded in each vertex over multiple iterations to take advantage of the relations captured by the underlying graphs. Consequently, they incur a significant amount of computation and irregular communication overheads, which call for GCN-specific hardware accelerators. To this end, this paper presents a communication-aware in-memory computing architecture (COIN) for GCN hardware acceleration. Besides accelerating the computation using custom compute elements (CE) and in-memory computing, COIN aims at minimizing the intra- and inter-CE communication in GCN operations to optimize the performance and energy efficiency. Experimental evaluations with widely used datasets show up to 105x improvement in energy consumption compared to state-of-the-art GCN accelerator.

📄 PDF Abstract BibTeX arXiv:2205.07311

Code (0)

등록된 구현이 없습니다.

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…

Similar Papers 제목 키워드 기반

Dataflow-Aware PIM-Enabled Manycore Architecture for Deep Learning Workloads

2024-03-28 · Harsh Sharma, Gaurav Narang, Janardhan Rao Doppa, Umit Ogras 외

Processing-in-memory (PIM) has emerged as an enabler for the energy-efficient and high-performance acceleration of deep learning (DL) workloads. Resistive random-access memory (ReRAM) is one of the most promising technol…

Deep Learning

An Efficient Memory Module for Graph Few-Shot Class-Incremental Learning

2024-11-11 · Dong Li, Aijia Zhang, Junqi Gao, Biqing Qi

Incremental graph learning has gained significant attention for its ability to address the catastrophic forgetting problem in graph representation learning. However, traditional methods often rely on a large number of la…

class-incremental learningClass Incremental LearningFew-Shot Class-Incremental LearningGraph Learning+6

Proxy Experience Replay: Federated Distillation for Distributed Reinforcement Learning

2020-05-13 · Han Cha, Jihong Park, Hyesung Kim, Mehdi Bennis 외

Traditional distributed deep reinforcement learning (RL) commonly relies on exchanging the experience replay memory (RM) of each agent. Since the RM contains all state observations and action policy history, it may incur…

ClusteringData AugmentationDeep Reinforcement LearningPrivacy Preserving+3

Purine: A bi-graph based deep learning framework

2014-12-19 · Min Lin, Shuo Li, Xuan Luo, Shuicheng Yan

In this paper, we introduce a novel deep learning framework, termed Purine. In Purine, a deep network is expressed as a bipartite graph (bi-graph), which is composed of interconnected operators and data tensors. With the…

Deep Learning

PrivQuant: Communication-Efficient Private Inference with Quantized Network/Protocol Co-Optimization

2024-10-12 · Tianshi Xu, Shuzhang Zhong, Wenxuan Zeng, Runsheng Wang 외

Private deep neural network (DNN) inference based on secure two-party computation (2PC) enables secure privacy protection for both the server and the client. However, existing secure 2PC frameworks suffer from a high inf…

Quantization