首页> 外文会议>IEEE International Conference on Software Engineering and Service Science >An adaptive DNN Partition Algorithm Greedy Algorithm (ADPA)
【24h】

An adaptive DNN Partition Algorithm Greedy Algorithm (ADPA)

机译:自适应DNN分区算法贪婪算法(ADPA)

获取原文

摘要

To solve the problem of DNN running too slowly on mobile terminals. The traditional approach is to use the edge server to cooperate with deep reasoning. However, this approach cannot be adapted to the partition according to the characteristics of each layer of the network and DNN, and can not achieve satisfactory reasoning acceleration effect. In this paper, an adaptive DNN partition algorithm is proposed to reduce the running time of DNN by considering the characteristics of each DNN layer and adaptively selecting the computing devices that should be divided and deployed in each layer. Experimental results show that the algorithm can effectively reduce the running time of DNN in different network environments and meet the delay requirements.
机译:解决移动终端上运行太慢的DNN的问题。 传统的方法是使用边缘服务器与深度推理合作。 然而,这种方法不能根据网络和DNN的每层的特征适应分区,并且不能实现令人满意的推理加速度效果。 在本文中,提出了一种自适应DNN分区算法通过考虑每个DNN层的特性来减少DNN的运行时间,并自适应地选择应该划分和部署在每层中的计算设备。 实验结果表明,该算法可以有效地减少不同网络环境中DNN的运行时间,并满足延迟要求。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号