A Dynamic Priority Task Scheduling Algorithm for Mpsoc

摘要

Now the task scheduling method based on the priority, some algorithms are based on task value and deadline constraints as scheduling criteria. Some algorithms use time and performance as scheduling criteria, but most are for static homogeneous multi-core or static heterogeneous multi-core environment, there are no better research results in the field of dynamic priority task scheduling for Many-core Processor System-on-Chip (MPSoC). In this paper, we propose a dynamic priority task scheduling algorithm DPS-UCS. First, based on the task's virtual core granularity and task run time, at the some time, considering the two factors, which are the unrealized value of the task and the time urgency, we give the dynamic priority assignment strategy. Finally, we use the DPS-UCS algorithm to compare with the mainstream algorithm in static multi-core and static heterogeneous multi-core environment, experimental results show that DPS-UCS has some advantages in terms of the success rate and the completion time.