Dynamic Scheduling of Real-Time Tasks in Heterogeneous Multicore Systems
What is it about?
The shift from homogeneous multi-core to heterogeneous multi-core introduces challenges in scheduling the tasks to the appropriate cores maintaining the time deadline. This paper studies the existing scheduling schemes in heterogeneous multi-core system and finds an approach to enhance the homogeneous system model to heterogeneous scheduling architecture. The proposed model increases the overall system utilization by accommodating almost all the tasks (low power task and high power task) into appropriate cores (big high power and small low power). It further enhances the system performance by allocating rejected jobs from small cores into the big cores through dispatcher.
Why is it important?
The main contributions of our proposed model are as follows: 1. An efficient scheduling approach is proposed in the heterogeneous multicore system to map the tasks into appropriate cores based on the type of cores (big high power and small low power) as well as type of tasks (low power and high power) by extending the homogeneous system model of the existing works. 2. A run-time dispatcher has been incorporated in our existing work to dispatch different jobs into small cores. 3. Task migration is used to migrate the rejected jobs from small cores into big cores through dispatcher.
The following have contributed to this page: Kalyan Baital