SSF-EDZL Scheduling Algorithm on Heterogeneous Multiprocessors

With the increasing demand for high performance and low power consumption in embedded real-time systems, performance asymmetric multiprocessor architecture is beginning to be applied to embedded real-time systems, because this heterogeneous architecture allows the system to allocate computational resources as needed to satisfy the demands of each application and dynamic workloads. Most of the previous studies on EDZL scheduling algorithms have focused on task prioritization, and they simply assign the highest priority tasks to the fastest processors. In this paper, we choose to assign the highest priority tasks on the slowest processor and propose SSFEDZL (slowest speed fit for earliest deadline first until zero-laxity) scheduling algorithm. We compare SSF-EDZL scheduling algorithm with other scheduling algorithms and the experimental results show that SSF-EDZL is a better scheduling algorithm which has higher processor utilization and better scheduling performance.