Minimizing cache related preemption delay in preemptive scheduler

Real-time system depends upon the temporal attributes, therefore scheduler should schedule the tasks properly so that the system is reliable. Scheduling real time task, involves parameters such as job´s priority, computing resource availability, estimated execution time, etc…, but out of this cache management is very important issue which may have serious impact on execution time of the task. Cache interferences consist of warm-up delay and cache related preemption delay. During preemption, the preempting task can evict the blocks of preempted task. When the preempted task resumes, it has to reload the evicted blocks. Reloading the evicted blocks results in cache related preemption delay which increases the worst case execution time of the tasks. In this paper, we have proposed the job sequencing approach combined with simulated annealing algorithm using hash table which will help in minimizing the CRPD.