Performance Evaluation of New Joint EDF-RM Scheduling Algorithm for Real Time Distributed System

Abstract EN

In Real Time System, the achievement of deadline is the main target of every scheduling algorithm.

Earliest Deadline First (EDF), Rate Monotonic (RM), and least Laxity First are some renowned algorithms that work well in their own context.

As we know, there is a very common problem Domino's effect in EDF that is generated due to overloading condition (EDF is not working well in overloading situation).

Similarly, performance of RM is degraded in underloading condition.

We can say that both algorithms are complements of each other.

Deadline missing in both events happens because of their utilization bounding strategy.

Therefore, in this paper we are proposing a new scheduling algorithm that carries through the drawback of both existing algorithms.

Joint EDF-RM scheduling algorithm is implemented in global scheduler that permits task migration mechanism in between processors in the system.

In order to check the improved behavior of proposed algorithm we perform simulation.

Results are achieved and evaluated in terms of Success Ratio (SR), Average CPU Utilization (ECU), Failure Ratio (FR), and Maximum Tardiness parameters.

In the end, the results are compared with the existing (EDF, RM, and D_R_EDF) algorithms.

It has been shown that the proposed algorithm performs better during overloading condition as well in underloading condition.