Scheduling algorithm considering response time for mixed tasks on multiprocessor systems

The purpose of this paper is to study the scheduling problem of mixed task sets on multiprocessor systems. We propose a scheduling framework to improve the average response time of aperiodic jobs in mixed tasks. Our proposed scheduling framework consists of two phases: In the first phase, we considers how to assign each periodic task to a proper processor by different task allocation heuristics. Then, on a processor the unused capacity left by periodic tasks is set as the size of the Total Bandwidth (TB) Server. In the second phase, at run time when an aperiodic job arrives in the system, it will be assigned to a proper TB Server with the minimal virtual deadline and scheduled with periodic jobs on the same processor under Earliest Deadline First (EDF). A series of experiments were conducted to evaluate the proposed framework.