Energy-Aware Scenario-Based Mapping of Deep Learning Applications Onto Heterogeneous Processors Under Real-Time Constraints

被引:8
作者
Kim, Jangryul [1 ]
Ha, Soonhoi [1 ]
机构
[1] Seoul Natl Univ, Dept Comp Sci & Engn, Seoul 08826, South Korea
关键词
Energy consumption; Task analysis; Real-time systems; Deep learning; Graphics processing units; Embedded systems; Schedules; Deep learning applications; scenario-based design methodology; application mapping; schedulability test;
D O I
10.1109/TC.2022.3218991
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
To cope with the increasing demand for deep learning applications in embedded systems, emerging embedded devices tend to equip multiple heterogeneous processors, including GPU and deep learning hardware accelerator, called neural processing unit (NPU). It becomes popular to run multiple deep learning (DL) applications simultaneously to provide several functionalities. In this work, we assume that applications have real-time constraints that may vary at run time. While extensive studies have been conducted recently to find an efficient mapping of multiple DL applications on various hardware platforms, they do not consider the constraints imposed by the NPU and the associated software development kit (SDK) in a real embedded platform. In this paper, we propose a novel energy-aware mapping methodology of multiple DL applications onto a real embedded system that has multiple heterogeneous processors. The objective is to minimize energy consumption while satisfying the real-time constraints of all applications. In the proposed scheme, we first select Pareto-optimal mapping solutions for each application. Then mapping combination is explored, considering the scenario that indicates the dynamism of applications while satisfying the constraints. Also, we reduce energy consumption by tuning the frequency of processors. We could satisfy up to 40% higher deadline constraints and reduce the energy consumption by 22% similar to 31% compared to the static mapping methods with real-life applications and different scenarios on a real platform.
引用
收藏
页码:1666 / 1680
页数:15
相关论文
共 36 条
[1]   GPU Scheduling on the NVIDIA TX2: Hidden Details Revealed [J].
Amert, Tanya ;
Otterness, Nathan ;
Yang, Ming ;
Anderson, James H. ;
Smith, F. Donelson .
2017 IEEE REAL-TIME SYSTEMS SYMPOSIUM (RTSS), 2017, :104-115
[2]  
[Anonymous], 2022, Nvidia tensorrt
[3]  
[Anonymous], 2022, NVIDIA JETS DEV GUID
[4]  
APOLLO, 2018, OP AUT DRIV PLATF
[5]  
Donyanavard B., 2016, Proceedings of the Eleventh IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis - CODES '16, P1
[6]   Static-priority Real-time Scheduling: Response Time Computation is NP-hard [J].
Eisenbrand, Friedrich ;
Rothvoss, Thomas .
RTSS: 2008 REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 2008, :397-406
[7]   NestDNN: Resource-Aware Multi-Tenant On-Device Deep Learning for Continuous Mobile Vision [J].
Fang, Biyi ;
Zeng, Xiao ;
Zhang, Mi .
MOBICOM'18: PROCEEDINGS OF THE 24TH ANNUAL INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND NETWORKING, 2018, :115-127
[8]  
Fortin FA, 2012, J MACH LEARN RES, V13, P2171
[9]  
Garey M. R., 1979, Computers and intractability. A guide to the theory of NP-completeness
[10]   System-Scenario-Based Design of Dynamic Embedded Systems [J].
Gheorghita, Stefan Valentin ;
Palkovic, Martin ;
Hamers, Juan ;
Vandecappelle, Arnout ;
Mamagkakis, Stelios ;
Basten, Twan ;
Eeckhout, Lieven ;
Corporaal, Henk ;
Catthoor, Francky ;
Vandeputte, Frederik ;
De Bosschere, Koen .
ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 2009, 14 (01)