Abstract
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.
Highlights
Tasks in a real-time system must be executed within its deadline to produce functionally correct results in a timely manner
This paper contributes an object-oriented platformbased design, for uniprocessor architecture using Unified Modeling Language (UML)-RT to analyze the schedulability for the proposed utilization bound algorithms based on a new priority scheme “Rate MonotonicShortest Job First” (RM-SJ)
This paper proposes two utilization bound algorithms to derive a task set which satisfies both Rate Monotonic Algorithm (RMA)-shortest job first (SJF) priority scheme; that is, higher priority tasks will have lesser computation time and lesser interrelease time
Summary
Tasks in a real-time system must be executed within its deadline to produce functionally correct results in a timely manner. One of the most widely used uniprocessor scheduling algorithm for periodic real-time tasks is the Rate Monotonic Algorithm (RMA), proposed by Lehoczky et al in [2]. According to [4], set of “m” independent preemptive periodic tasks are schedulable using RMA if and only if the system load U(τ) is given by the following:. This paper contributes an object-oriented platformbased design, for uniprocessor architecture using UML-RT to analyze the schedulability for the proposed utilization bound algorithms based on a new priority scheme “Rate MonotonicShortest Job First” (RM-SJ).
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
