A Hierarchical Model for Device Placement
We introduce a hierarchical model for efficient placement of computational graphs onto hardware devices, especially in heterogeneous environments with a mixture of CPUs, GPUs, and other computational devices. Our method learns to assign graph operations to groups and to allocate those groups to available devices. The grouping and device allocations are learned jointly. The proposed method is trained with policy gradient and requires no human intervention. Experiments with widely-used computer vision and natural language models show that our algorithm can find optimized, non-trivial placements for TensorFlow computational graphs with over 80,000 operations. In addition, our approach outperforms placements by human experts as well as a previous state-of-the-art placement method based on deep reinforcement learning. Our method achieves runtime reductions of up to 60.6% per training step when applied to models such as Neural Machine Translation.
Code (0)
등록된 구현이 없습니다.
Tasks
Deep Reinforcement LearningMachine TranslationmodelReinforcement LearningReinforcement Learning (RL)TranslationSimilar Papers 제목 키워드 기반
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 devic…
Decision MakingSequential Decision MakingLocation- and Orientation-aware Millimeter Wave Beam Selection for Multi-Panel Antenna Devices
While initial beam alignment (BA) in millimeter-wave networks has been thoroughly investigated, most research assumes a simplified terminal model based on uniform linear/planar arrays with isotropic antennas. Devices wit…
GiPH: Generalizable Placement Learning for Adaptive Heterogeneous Computing
Careful placement of a computational application within a target device cluster is critical for achieving low application completion time. The problem is challenging due to its NP-hardness and combinatorial nature. In re…
Edge-computingGraph Neural NetworkLearning Generalizable Device Placement Algorithms for Distributed Machine Learning
We present Placeto, a reinforcement learning (RL) approach to efficiently find device placements for distributed neural network training. Unlike prior approaches that only find a device placement for a specific computat…
BIG-bench Machine LearningReinforcement LearningReinforcement Learning (RL)Placeto: Learning Generalizable Device Placement Algorithms for Distributed Machine Learning
We present Placeto, a reinforcement learning (RL) approach to efficiently find device placements for distributed neural network training. Unlike prior approaches that only find a device placement for a specific computati…
BIG-bench Machine LearningReinforcement LearningReinforcement Learning (RL)