Real-Time Scheduling for Periodic Tasks in Homogeneous Multi-core System with Minimum Execution Time

Scheduling of tasks in multicore parallel architectures is challenging due to the execution time being a nondeterministic value. We propose a task-affinity real-time scheduling heuristics algorithm (TARTSH) for periodic and independent tasks in a homogeneous multicore system based on a Parallel Execution Time Graph (PETG) to minimize the execution time. The main contributions of the paper include: construction of a Task Affinity Sequence through real experiment, finding the best parallel execution pairs and scheduling sequence based on task affinity, providing an efficient method to distinguish memoryintensive and memory-unintensive task. For experimental evaluation of our algorithm, a homogeneous multicore platform called NewBeehive with private L1 Cache and sharable L2 Cache has been designed. Theoretical and experimental analysis indicates that it is better to allocate the memory-intensive task and memory-unintensive task for execution in parallel. The experimental results demonstrate that our algorithm can find the optimal solution among all the possible combinations. The Maximum improvement of our algorithm is 15.6%).