Adaptive partitioning of DNNs for resource-efficient inference on edge clusters
摘要
With each passing year, the compelling need to bring deep learning computational models to the edge grows, as does the disparity in resource demand between these models and the Internet of Things (IoT). Understanding the structural complexities of deep models helps in realizing possible partitioning scenarios to limit the under-utilization of the edge device pool. It is also crucial to leverage the existing compression techniques to apprehend the limited processing power of edge devices. This paper proposes a well-partitioned inference model for bringing deep convolutional networks to the edge. The kernels of the entire model are compressed using Hashing Trick, and an n-ball is used to regenerate neighbourhood pixels at runtime, eliminating memory and computational bottlenecks. The proposed method uses vertical partitioning to fuse convolutional layers and horizontal partitioning for fully connected layers, modelled as a graph to optimize task scheduling across devices. This approach achieves a 40% reduction in communication overhead and