Cover Image

A scheduling analysis framework for predicting the weakly hard real-time systems

For real-time systems, hard real-time and soft real-time systems are based on “miss restriction” and “miss tolerance”, respectively. However, a weakly hard real-time system integrates both these requirements. The problem with these systems is the limitation of the scheduling analysis method which on...

Full description

Saved in:
Bibliographic Details
Main Author: Ismail, Habibah
Format: Thesis
Language:English
Published: 2013
Subjects:
QA75 Electronic computers. Computer science
Online Access:http://eprints.utm.my/id/eprint/35890/5/HabibahIsmailMFSKSM2013.pdf
http://eprints.utm.my/id/eprint/35890/
http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:70027?site_name=Restricted Repository
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.35890
record_format eprints
spelling my.utm.358902017-07-16T04:27:06Z http://eprints.utm.my/id/eprint/35890/ A scheduling analysis framework for predicting the weakly hard real-time systems Ismail, Habibah QA75 Electronic computers. Computer science For real-time systems, hard real-time and soft real-time systems are based on “miss restriction” and “miss tolerance”, respectively. However, a weakly hard real-time system integrates both these requirements. The problem with these systems is the limitation of the scheduling analysis method which only uses the traditional scheduling approach. Besides that, the current framework has problems with the complexity and predictability of the systems. This study proposed a scheduling analysis framework based on the suitability of scheduling algorithms, weakly hard real-time modelling and the combination of the deterministic and probabilistic schedulability analyses for predicting the weakly hard real-time tasks. Initially, the best fitting specification of a weakly hard real-time system was integrated into the proposed framework and tested in the Modeling and Analysis of Real-Time Embedded systems (MARTE) profile. The profile was enhanced because the current MARTE timing constraint restricted to the hard and soft real time timing requirement, thus some modifications were made to model the weakly hard real-time requirements. For complex systems, rather than only using scheduling algorithms to schedule the tasks, the algorithms were used with Unified Modeling Language (UML) modelling. Sequence diagram complexity factor metrics were used to measure the behavioural complexity. The proposed combination approach was applied on case studies and then evaluated with reference to the existing approaches. The results of the evaluations showed that the proposed framework is more predictable compared to the other frameworks and has addressed the problem posed in this research. In conclusion, the proposed scheduling analysis framework provides a less complex design through the behavioural complexity measurements, as well as increases the predictability of the systems. 2013-06 Thesis NonPeerReviewed application/pdf en http://eprints.utm.my/id/eprint/35890/5/HabibahIsmailMFSKSM2013.pdf Ismail, Habibah (2013) A scheduling analysis framework for predicting the weakly hard real-time systems. Masters thesis, Universiti Teknologi Malaysia, Faculty of Computing. http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:70027?site_name=Restricted Repository
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
language English
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Ismail, Habibah
A scheduling analysis framework for predicting the weakly hard real-time systems
description For real-time systems, hard real-time and soft real-time systems are based on “miss restriction” and “miss tolerance”, respectively. However, a weakly hard real-time system integrates both these requirements. The problem with these systems is the limitation of the scheduling analysis method which only uses the traditional scheduling approach. Besides that, the current framework has problems with the complexity and predictability of the systems. This study proposed a scheduling analysis framework based on the suitability of scheduling algorithms, weakly hard real-time modelling and the combination of the deterministic and probabilistic schedulability analyses for predicting the weakly hard real-time tasks. Initially, the best fitting specification of a weakly hard real-time system was integrated into the proposed framework and tested in the Modeling and Analysis of Real-Time Embedded systems (MARTE) profile. The profile was enhanced because the current MARTE timing constraint restricted to the hard and soft real time timing requirement, thus some modifications were made to model the weakly hard real-time requirements. For complex systems, rather than only using scheduling algorithms to schedule the tasks, the algorithms were used with Unified Modeling Language (UML) modelling. Sequence diagram complexity factor metrics were used to measure the behavioural complexity. The proposed combination approach was applied on case studies and then evaluated with reference to the existing approaches. The results of the evaluations showed that the proposed framework is more predictable compared to the other frameworks and has addressed the problem posed in this research. In conclusion, the proposed scheduling analysis framework provides a less complex design through the behavioural complexity measurements, as well as increases the predictability of the systems.
format Thesis
author Ismail, Habibah
author_facet Ismail, Habibah
author_sort Ismail, Habibah
title A scheduling analysis framework for predicting the weakly hard real-time systems
title_short A scheduling analysis framework for predicting the weakly hard real-time systems
title_full A scheduling analysis framework for predicting the weakly hard real-time systems
title_fullStr A scheduling analysis framework for predicting the weakly hard real-time systems
title_full_unstemmed A scheduling analysis framework for predicting the weakly hard real-time systems
title_sort scheduling analysis framework for predicting the weakly hard real-time systems
publishDate 2013
url http://eprints.utm.my/id/eprint/35890/5/HabibahIsmailMFSKSM2013.pdf
http://eprints.utm.my/id/eprint/35890/
http://dms.library.utm.my:8080/vital/access/manager/Repository/vital:70027?site_name=Restricted Repository
_version_ 1643649870879260672
score 13.211869

Similar Items