Pradeepkumar.org

It is an Optimal dynamic Priority Scheduling Algorithm
Priorities are assigned based on the absolute deadlines of the task, earlier the deadline, higher the priority.
It is also called as Deadline Monotonic Scheduling (DM).
If two tasks have the same deadline, then EDF randomly select  one to execute next.
The Schedulability condition for EDF is [...]

Continue reading Earliest Deadline First (EDF) Algorithm

Rate Monotonic Scheduling is the optimal static priority algorithm. Shortly it is referred as RM or RMA or RMS. To solve for the RM schedule, the following are the assumptions.
Assumptions:

All the tasks are assumed to be periodic
The relative deadline of the tasks are equal to its period.
No tasks has a non pre-emptible section.
The cost of [...]

Continue reading Rate Monotonic Scheduling (RM)

Valid ScheduleA scheduler is responsible for managing the resource allocation to the tasks and it is based on the scheduling algorithms. A scheduler produces a valid schedules should obey these rules

Every process is assigned to atmost one job at a time
Every job is assigned to atmost one processor at a time
No job is scheduled before [...]

Continue reading Scheduling Hierarchies

System Set of one or more inputs entering the black box and a set of outputs exiting the black box is called a system.
Response Time The time between the presentation of set of inputs and the appearance of the associated outputs.
Real time System A System that [...]

Continue reading Introduction to Real Time Systems