Performance Evaluation of Game Theory Based Efficient Task Scheduling For Edge Computing

Abstract

The edge paradigm that is intended as prominent computing due to its low computation latencies faces multiple issues and challenges due to the restrictions in the computing capabilities and its resource availability especially in the huge populace scenarios. To examine the problems faced during the task scheduling when the edge computing is called up by multiple users at time, the paper puts forward the game theory approach. Utilizing the game theory strategy the paper puts forth the a novel multi-tasking scheduling in the edge computing from the user perception developing an algorithm taking into consideration the consistency of the stable tasks. The analysis of the proposed algorithm used in the allocation of the tasks is done on terms of average time consumed for the execution of the task and the waiting time. The results acquired showed that the proposed method provides a maximized throughput, minimizing the waiting time compared to the conventional methods used in optimizing the parameters of scheduling.