@inproceedings{
duan2024a,
title={A Structure-Aware Framework for Learning Device Placements on Computation Graphs},
author={Shukai Duan and Heng Ping and Nikos Kanakaris and Xiongye Xiao and Panagiotis Kyriakis and Nesreen K. Ahmed and Peiyu Zhang and Guixiang Ma and Mihai Capot{\u{a}} and Shahin Nazarian and Theodore L. Willke and Paul Bogdan},
booktitle={The Thirty-eighth Annual Conference on Neural Information Processing Systems},
year={2024},
url={https://openreview.net/forum?id=Kzno1r3Xef}
}
Computation graphs are Directed Acyclic Graphs (DAGs) where the nodes correspond to mathematical operations and are used widely as abstractions in optimizations of neural networks. The device placement problem aims to identify optimal allocations of those nodes to a set of (potentially heterogeneous) devices. Existing approaches rely on two types of architectures known as grouper-placer and encoder-placer, respectively. In this work, we bridge the gap between encoder-placer and grouper-placer techniques and propose a novel framework for the task of device placement, relying on smaller computation graphs extracted from the OpenVINO toolkit. The framework consists of five steps, including graph coarsening, node representation learning and policy optimization. It facilitates end-to-end training and takes into account the DAG nature of the computation graphs. We also propose a model variant, inspired by graph parsing networks and complex network analysis, enabling graph representation learning and jointed, personalized graph partitioning, using an unspecified number of groups. To train the entire framework, we use reinforcement learning using the execution time of the placement as a reward. We demonstrate the flexibility and effectiveness of our approach through multiple experiments with three benchmark models, namely Inception-V3, ResNet, and BERT. The robustness of the proposed framework is also highlighted through an ablation study. The suggested placements improve the inference speed for the benchmark models by up to $58.2\%$ over CPU execution and by up to $60.24\%$ compared to other commonly used baselines.
A Structure-Aware Framework for Learning Device Placements on Computation Graphs
Shukai Duan Heng Ping Nikos Kanakaris Xiongye Xiao Panagiotis Kyriakis Nesreen K. Ahmed Peiyu Zhang Guixiang Ma Mihai Capotă Shahin Nazarian Theodore L. Willke Paul Bogdan