Performance Evaluation of New Joint EDF-RM Scheduling Algorithm for Real Time Distributed System
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 eff...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Journal of Engineering |
| Online Access: | http://dx.doi.org/10.1155/2014/485361 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832545688681971712 |
|---|---|
| author | Rashmi Sharma Nitin |
| author_facet | Rashmi Sharma Nitin |
| author_sort | Rashmi Sharma |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-00c0a27b3df749aa941769f9b2297f42 |
| institution | Kabale University |
| issn | 2314-4904 2314-4912 |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Engineering |
| spelling | doaj-art-00c0a27b3df749aa941769f9b2297f422025-02-03T07:24:57ZengWileyJournal of Engineering2314-49042314-49122014-01-01201410.1155/2014/485361485361Performance Evaluation of New Joint EDF-RM Scheduling Algorithm for Real Time Distributed SystemRashmi Sharma0Nitin1Department of Computer Science & Engineering and Information & Communication Technology, Jaypee University of Information Technology, Waknaghat, Solan, Himachal Pradesh 173234, IndiaDepartment of Computer Science & Engineering and Information & Communication Technology, Jaypee University of Information Technology, Waknaghat, Solan, Himachal Pradesh 173234, IndiaIn 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.http://dx.doi.org/10.1155/2014/485361 |
| spellingShingle | Rashmi Sharma Nitin Performance Evaluation of New Joint EDF-RM Scheduling Algorithm for Real Time Distributed System Journal of Engineering |
| title | Performance Evaluation of New Joint EDF-RM Scheduling Algorithm for Real Time Distributed System |
| title_full | Performance Evaluation of New Joint EDF-RM Scheduling Algorithm for Real Time Distributed System |
| title_fullStr | Performance Evaluation of New Joint EDF-RM Scheduling Algorithm for Real Time Distributed System |
| title_full_unstemmed | Performance Evaluation of New Joint EDF-RM Scheduling Algorithm for Real Time Distributed System |
| title_short | Performance Evaluation of New Joint EDF-RM Scheduling Algorithm for Real Time Distributed System |
| title_sort | performance evaluation of new joint edf rm scheduling algorithm for real time distributed system |
| url | http://dx.doi.org/10.1155/2014/485361 |
| work_keys_str_mv | AT rashmisharma performanceevaluationofnewjointedfrmschedulingalgorithmforrealtimedistributedsystem AT nitin performanceevaluationofnewjointedfrmschedulingalgorithmforrealtimedistributedsystem |