For a hard real-time multicore system, the two important issues that are required to be addressed are feasibility of a task set and balancing of load amongst the cores of the multicore systems. Most of the previous work done considers the scheduling of periodic tasks on a multicore system. This chapter deals with scheduling of aperiodic tasks on a multicore system in a hard real-time environment. In this regard, a multicore total bandwidth server (MTBS) is proposed which schedules the aperiodic tasks with already guaranteed periodic tasks amongst the cores of the multicore processor. The proposed MTBS algorithm works by computing a virtual deadline for every aperiodic task that is arriving to the system. Apart from schedulability of aperiodic tasks, the MTBS approach also focuses on reducing the response time of aperiodic tasks. The simulation studies of MTBS were carried out to find the effectiveness of the proposed approach, and it is also compared with the existing strategies.
Semi-Partitioned Hard-Real-Time Scheduling under Locked Cache Migration in Multicore Systems
