paper-with-me

홈 › Papers

LayerPipe: Accelerating Deep Neural Network Training by Intra-Layer and Inter-Layer Gradient Pipelining and Multiprocessor Scheduling

2021-08-14 · Nanda K. Unnikrishnan, Keshab K. Parhi

The time required for training the neural networks increases with size, complexity, and depth. Training model parameters by backpropagation inherently creates feedback loops. These loops hinder efficient pipelining and scheduling of the tasks within the layer and between consecutive layers. Prior approaches, such as PipeDream, have exploited the use of delayed gradient to achieve inter-layer pipelining. However, these approaches treat the entire backpropagation as a single task; this leads to an increase in computation time and processor underutilization. This paper presents novel optimization approaches where the gradient computations with respect to the weights and the activation functions are considered independently; therefore, these can be computed in parallel. This is referred to as intra-layer optimization. Additionally, the gradient computation with respect to the activation function is further divided into two parts and distributed to two consecutive layers. This leads to balanced scheduling where the computation time of each layer is the same. This is referred to as inter-layer optimization. The proposed system, referred to as LayerPipe, reduces the number of clock cycles required for training while maximizing processor utilization with minimal inter-processor communication overhead. LayerPipe achieves an average speedup of 25% and upwards of 80% with 7 to 9 processors with less communication overhead when compared to PipeDream.

📄 PDF Abstract BibTeX arXiv:2108.06629

Code (0)

등록된 구현이 없습니다.

Tasks

Scheduling

Methods 이 논문이 사용한 방법론

PipeDream 설명 없음

Similar Papers 제목 키워드 기반

LayerPipe2: Multistage Pipelining and Weight Recompute via Improved Exponential Moving Average for Training Neural Networks

2025-12-09 · Nanda K. Unnikrishnan, Keshab K. Parhi arxiv

In our prior work, LayerPipe, we had introduced an approach to accelerate training of convolutional, fully connected, and spiking neural networks by overlapping forward and backward computation. However, despite empirica…

MGUP: A Momentum-Gradient Alignment Update Policy for Stochastic Optimization

2026-06-16 · Da Chang, Ganzhao Yuan arxiv

Efficient optimization is essential for training large language models. Although intra-layer selective updates have been explored, a general mechanism that enables fine-grained control while ensuring convergence guarante…

Stochastic Optimization

Accelerating HEVC Intra Partitioning via a CNN-Hierarchical Attention Transformer Hybrid

2026-05-27 · Krishna Kumar Sharma, Somdyuti Paul arxiv

The recursive quad-tree partitioning in High Efficiency Video Coding (HEVC) incurs considerable computational overhead, with exhaustive rate-distortion optimization for CTU partition prediction consuming the dominant sha…

Accelerate CNN via Recursive Bayesian Pruning

2018-12-02 · ICCV 2019 10 · Yuefu Zhou, Ya zhang, Yan-Feng Wang, Qi Tian

Channel Pruning, widely used for accelerating Convolutional Neural Networks, is an NP-hard problem due to the inter-layer dependency of channel redundancy. Existing methods generally ignored the above dependency for comp…

DeepLight: Deep Lightweight Feature Interactions for Accelerating CTR Predictions in Ad Serving

2020-02-17 · Wei Deng, Junwei Pan, Tian Zhou, Deguang Kong 외

Click-through rate (CTR) prediction is a crucial task in online display advertising. The embedding-based neural networks have been proposed to learn both explicit feature interactions through a shallow component and deep…

Click-Through Rate PredictionPrediction