Research on Fog Computing Task Scheduling Strategy with Deadline Constraints

The task scheduling problem in Fog Computing environments generally studies the scheduling strategy between tasks and computing resources, seeking a solution based on task scheduling execute time and performance optimization. There is little research on task scheduling strategies with deadline constraints. Based on the improved Apriori algorithm and utilizing the obtained task scheduling classification rules, this paper designs and proposes a task scheduling model and DLCM algorithm that meet time constraints in Fog Computing environment. The DLCM algorithm was validated through simulation experiments, and compared to similar algorithms, the algorithm showed significant improvements in task execution time and scheduling costs.