Task Classification and Scheduling Based on K-Means Clustering for Edge Computing

The rapid evolution of Internet of Things and cloud computing have endorsed a novel computing paradigm called edge computing. Here tasks are processed by edge devices before sent to the cloud to reduce the computational latency and overhead of cloud server. In edge computing efficient classification and distribution of the tasks among the constituent nodes is a challenging issue because of their resource limitedness and heterogeneity. In this paper a novel scheme named KTCS (K-means Clustering-based Task Classification and Scheduling) is proposed which classifies the task based on the type of resource requirement in terms of CPU, I/O, or COMM before distributed to the edge node. Using the K-means algorithm modeled with the M / M / c queuing theory, the proposed scheme efficiently schedules and assigns the task so that the utilization of the edge devices can be increased. The simulation result reveals that the proposed scheme significantly improves the performance of edge nodes in terms of task execution time and resource utilization.