Tech blog

The use of Priority inheritance allows to avoid the priority inversion problem.

  Under this scheme, if a high priority task T1 is blocked by a lower priority task T2 (because T2 is currently executing a critical section needed by T1), the lower priority task temporarily inherits the priority of T1. When the blocking stops, T2 resumes its original priority.

  If a task T1 is blocked by T2…

Next fit Algorithm for RM Scheduling

This algorithm uses the same assumptions used in the Rate Monotonic Scheduling

This algorithm is based on the RM Scheduling algorithm for each processors

The multi processor is assumed to consists of identical processors.

The tasks are assumed to require no resources other than the CPU Time

  The tasks are allocated to processors according to the classes in which they belong.…

Main Algorithms of a kernel…

Timer Interrupts

There is one hardware timer that generates interrupts every 10ms and all the software timer synchronizes with it.

Usually the timer stored in the variable jiffies.

unsigned long volatile jiffies;

The variable jiffies is modified by the timer interrupt every 10ms and hence it is declared as volatile.

volatile struct timeval xtime:

This is the actual time which again modified…