A Job Scheduling Algorithm for Edge Computing Based on Modified Monte Carlo Tree Search

Job scheduling is a crucial and promising task for maximizing computing resources utilization, which significantly improves the efficiency of edge cloud. Nevertheless, the existing job scheduling algorithms mainly ignore the scarce computing resources, i.e., heterogeneous resources, in edge cloud. A novel job scheduling algorithm based on Modified Monte Carlo Tree Search is proposed to take full advantage of the computing resources. The experiment results manifest that the proposed algorithm is valid in job scheduling for edge computing.