Multiprocessor Scheduling with Cache Related Preemption Delays

With the advent of multicore processors, multiprocessor scheduling analysis for hard real-time systems has become an important problem. In such an analysis, consideration of overheads like Cache Related Preemption Delay (CRPD) is very much desired but not handled by most of the existing techniques. In this paper, we propose task partitioning methods that consider CRPD costs while allocating tasks to processors, to achieve a schedulable system. We also present a novel technique to calculate utilization of each task considering the CRPD cost. This is done in such a way that the task utilizations are not overestimated and CRPD costs on a particular processor are exactly accounted. Experimentation results show that the proposed methods can schedule high utilization task sets on a multiprocessor system.