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

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-S...

Full description

Saved in:
Bibliographic Details
Main Authors: S. Ewins Pon Pushpa, Manamalli Devasigamani
Format: Article
Language:English
Published: Wiley 2014-01-01
Series:Modelling and Simulation in Engineering
Online Access:http://dx.doi.org/10.1155/2014/705929
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849691755524390912
author S. Ewins Pon Pushpa
Manamalli Devasigamani
author_facet S. Ewins Pon Pushpa
Manamalli Devasigamani
author_sort S. Ewins Pon Pushpa
collection DOAJ
description 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.
format Article
id doaj-art-b61fa961985e49f3a4e834b47a64f4ae
institution DOAJ
issn 1687-5591
1687-5605
language English
publishDate 2014-01-01
publisher Wiley
record_format Article
series Modelling and Simulation in Engineering
spelling doaj-art-b61fa961985e49f3a4e834b47a64f4ae2025-08-20T03:20:55ZengWileyModelling and Simulation in Engineering1687-55911687-56052014-01-01201410.1155/2014/705929705929Utilization Bound Scheduling Analysis for Nonpreemptive Uniprocessor Architecture Using UML-RTS. Ewins Pon Pushpa0Manamalli Devasigamani1Department of Electronics Engineering, Madras Institute of Technology, Anna University, Chennai 600 044, IndiaDepartment of Instrumentation Engineering, Madras Institute of Technology, Anna University, Chennai 600 044, IndiaThe 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.http://dx.doi.org/10.1155/2014/705929
spellingShingle S. Ewins Pon Pushpa
Manamalli Devasigamani
Utilization Bound Scheduling Analysis for Nonpreemptive Uniprocessor Architecture Using UML-RT
Modelling and Simulation in Engineering
title Utilization Bound Scheduling Analysis for Nonpreemptive Uniprocessor Architecture Using UML-RT
title_full Utilization Bound Scheduling Analysis for Nonpreemptive Uniprocessor Architecture Using UML-RT
title_fullStr Utilization Bound Scheduling Analysis for Nonpreemptive Uniprocessor Architecture Using UML-RT
title_full_unstemmed Utilization Bound Scheduling Analysis for Nonpreemptive Uniprocessor Architecture Using UML-RT
title_short Utilization Bound Scheduling Analysis for Nonpreemptive Uniprocessor Architecture Using UML-RT
title_sort utilization bound scheduling analysis for nonpreemptive uniprocessor architecture using uml rt
url http://dx.doi.org/10.1155/2014/705929
work_keys_str_mv AT sewinsponpushpa utilizationboundschedulinganalysisfornonpreemptiveuniprocessorarchitectureusingumlrt
AT manamallidevasigamani utilizationboundschedulinganalysisfornonpreemptiveuniprocessorarchitectureusingumlrt