scholarly journals An Improved Rate Monotonic Schedulability Test Algorithm

2005 ◽  
Vol 16 (1) ◽  
pp. 89 ◽  
Author(s):  
Jun-Xiang LIU
Keyword(s):  
Rate Monotonic ◽  
Schedulability Test ◽  
Test Algorithm

scholarly journals Schedulability of Rate Monotonic Algorithm using Improved Time Demand Analysis for Multiprocessor Environment

2018 ◽  
Vol 8 (1) ◽  
pp. 429
Author(s):  
Leena Das ◽  
Sourav Mohapatra ◽  
Durga Prasad Mohapatra
Keyword(s):  
Real Time ◽  
Scheduling Algorithm ◽  
Demand Analysis ◽  
Priority Scheduling ◽  
Task Set ◽  
Rate Monotonic ◽  
Test Algorithm ◽  
Task Sets ◽  
Number Of Iterations ◽  
Better Than

<p>Real-Time Monotonic algorithm (RMA) is a widely used static priority scheduling algorithm. For application of RMA at various systems, it is essential to determine the system’s feasibility first. The various existing algorithms perform the analysis by reducing the scheduling points in a given task set. In this paper we propose a schedubility test algorithm, which reduces the number of tasks to be analyzed instead of reducing the scheduling points of a given task. This significantly reduces the number of iterations taken to compute feasibility. This algorithm can be used along with the existing algorithms to effectively reduce the high complexities encountered in processing large task sets. We also extend our algorithm to multiprocessor environment and compare number of iterations with different number of processors. This paper then compares the proposed algorithm with existing algorithm. The expected results show that the proposed algorithm performs better than the existing algorithms.</p>

scholarly journals Utilization Bound Scheduling Analysis for Nonpreemptive Uniprocessor Architecture Using UML-RT

2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
S. Ewins Pon Pushpa ◽  
Manamalli Devasigamani
Keyword(s):  
Release Time ◽  
Periodic Tasks ◽  
Task Set ◽  
Processor Utilization ◽  
Window Analysis ◽  
Rate Monotonic ◽  
Utilization Bound ◽  
Priority Scheme ◽  
Schedulability Test ◽  
Necessary And Sufficient

The key for adopting the utilization-based schedulability test is to derive the utilization bound. Given the computation times, this paper proposes two utilization bound algorithms to derive interrelease times for nonpreemptive periodic tasks, using a new priority scheme, “Rate Monotonic Algorithm-Shortest Job First.” The obtained task set possesses the advantage of Rate Monotonic Algorithm and Shortest Job First priority scheme. Further, the task set is tested for schedulability, by first deriving a general schedulability condition from “problem window” analysis and, a necessary and sufficient schedulability condition for a task to be scheduled, at any release time are also derived. As a technical contribution, success ratio and effective processor utilization are analyzed for our proposed utilization bound algorithms on a uniprocessor architecture modeled using UML-RT.

Schedulability Test for Multiprocessor Scheduling Based on Hyperbolic Bound

2012 ◽  
Vol 23 (8) ◽  
pp. 2223-2234
Author(s):  
Hong-Ya WANG ◽  
Wei YIN ◽  
Hui SONG ◽  
Lih-Chyun SHU ◽  
Mei WANG
Keyword(s):  
Multiprocessor Scheduling ◽  
Schedulability Test
Sign in / Sign up

Export Citation Format

Share Document