A New Dynamic Scheduling Algorithm for Real-Time Heterogeneous Multiprocessor Systems

In this paper, we investigate several potential processor selection policies for nonpreemptive scheduling of dynamically arriving real-time tasks (aperiodic task) in heterogeneous multiprocessor systems, and the P_IEFT policy among them is the best from the viewpoint of the schedule length. The P_IEFT policy selects the processor that minimizes the earliest finish time of a task. Simulation results show that the new algorithm using the P_IEFT policy outperforms the other algorithms that use the other processor selection policies.