Accelerate Model Parallel Training by Using Efficient Graph Traversal Order in Device Placement
Modern neural networks require long training to reach decent performance on massive datasets. One common approach to speed up training is model parallelization, where large neural networks are split across multiple devices. However, different device placements of the same neural network lead to different training times. Most of the existing device placement solutions treat the problem as sequential decision-making by traversing neural network graphs and assigning their neurons to different devices. This work studies the impact of graph traversal order on device placement. In particular, we empirically study how different graph traversal order leads to different device placement, which in turn affects the training execution time. Our experiment results show that the best graph traversal order depends on the type of neural networks and their computation graphs features. In this work, we also provide recommendations on choosing graph traversal order in device placement for various neural network families to improve the training time in model parallelization.
Code (1)
Tasks
Decision MakingSequential Decision MakingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
FeatGraph: A Flexible and Efficient Backend for Graph Neural Network Systems
Graph neural networks (GNNs) are gaining increasing popularity as a promising approach to machine learning on graphs. Unlike traditional graph workloads where each vertex/edge is associated with a scalar, GNNs attach a f…
CPUGPUGraph Neural NetworkGPU-accelerated Multi-relational Parallel Graph Retrieval for Web-scale Recommendations
Web recommendations provide personalized items from massive catalogs for users, which rely heavily on retrieval stages to trade off the effectiveness and efficiency of selecting a small relevant set from billion-scale ca…
GPUMetric LearningRetrievalRoboPARA: Dual-Arm Robot Planning with Parallel Allocation and Recomposition Across Tasks
Dual-arm robots play a crucial role in improving efficiency and flexibility in complex multitasking scenarios. While existing methods have achieved promising results in task planning, they often fail to fully optimize ta…
Large Language ModelTask PlanningLearning World Graph Decompositions To Accelerate Reinforcement Learning
Efficiently learning to solve tasks in complex environments is a key challenge for reinforcement learning (RL) agents. We propose to decompose a complex environment using a task-agnostic world graphs, an abstraction tha…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)Skyline-First Traversal as a Control Mechanism for Multi-Criteria Graph Search
In multi-criteria graph traversal, paths are compared via Pareto dominance, an ordering that identifies which paths are non-dominated, but says nothing about which path to expand next or when the search may stop. As a re…