Periodic data mostly comes from sensors, servo control, and real-time monitoring systems.

In real time operating systems, these periodic tasks utilize most of the processor computation power.

A real-time control system consists of many concurrent periodic tasks having individual timing constraints.

Real time embedded systems have time constraints linked with the output of the system.

The scheduling algorithms are used to determine which task is going to execute when more than one task is available in the ready queue.

The operating system must guarantee that each task is activated at its proper rate and meets its deadline.

For example, if we have three tasks Ta, Tb and Tc then Ta will always execute first, then Tb and after that Tc respectively.

They are more flexible because they can change the priority of tasks on run time according to the utilization factor of tasks.

More formally, if job J(1,K) of task T1 has higher priority than J(2,K) of task T2 then J(1,K1) will always has higher priority than of J(2,K1).

One example of a dynamic priority algorithm is the earliest deadline first algorithm.

Similarly, for the task set of n periodic tasks processor utilization is greater than one then that task set will not be schedulable by any algorithm.

Processor utilization factor tells about the processor load on a single processor.

Following scheduling algorithms will be discussed in details in next articles.

Out of these, the cookies that are categorized as necessary are stored on your browser as they are essential for the working of basic functionalities of the website.

These cookies will be stored in your browser only with your consent.

But opting out of some of these cookies may affect your browsing experience.

This category only includes cookies that ensures basic functionalities and security features of the website.

Scheduling Algorithms Os