Genetic Algorithm-Based Online-Partitioning BranchyNet for Accelerating Edge Inference

8Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

In order to effectively apply BranchyNet, a DNN with multiple early-exit branches, in edge intelligent applications, one way is to divide and distribute the inference task of a BranchyNet into a group of robots, drones, vehicles, and other intelligent edge devices. Unlike most existing works trying to select a particular branch to partition and deploy, this paper proposes a genetic algorithm (GA)-based online partitioning approach that splits the whole BranchyNet with all its branches. For this purpose, it establishes a new calculation approach based on the weighted average for estimating total execution time of a given BranchyNet and a two-layer chromosome GA by distinguishing partitioning and deployment during the evolution in GA. The experiment results show that the proposed algorithm can not only result in shorter execution time and lower device-average energy cost but also needs less time to obtain an optimal deployment plan. Such short running time enables the proposed algorithm to generate an optimal deployment plan online, which dynamically meets the actual requirements in deploying an intelligent application in the edge.

Cite

CITATION STYLE

APA

Na, J., Zhang, H., Lian, J., & Zhang, B. (2023). Genetic Algorithm-Based Online-Partitioning BranchyNet for Accelerating Edge Inference. Sensors, 23(3). https://doi.org/10.3390/s23031500

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free