Research on Conflict-Free Scheduling of Multi-Round Tasks in Multi-Level Computing Power Network Office Processes
In a multi-level computing network environment,the composition,constraints,and requirements of tasks are complex and variable,posing significant challenges to task scheduling.Traditional strategies based on fixed rules and algorithms for task allocation struggle to fully consider the dependencies and constraints between tasks,leading to uneven resource allocation and task execution conflicts.To address these issues,this paper proposes a conflict prevention scheduling method for multi-round tasks in multi-level computing network office processes.A triplet model for multi-round tasks is constructed from three perspectives:task composition,constraints,and requirements.During the scheduling process,a potential game mechanism is introduced to comprehensively consider the dependencies and constraints between tasks.By calculating utility function values,virtual machines that meet the task constraints and requirements are selected,achieving efficient utilization of multi-level computing resources and optimized task execution.Test results show that the proposed method significantly reduces conflict rates,demonstrating good stability and low-conflict characteristics even when the number of tasks increases significantly.
万方数据
