Static Priority Schedulability Analysis of Graph-Based Real-TimeTask Models with Resource Sharing

The correctness  of real-time systems does not only depend on the validity of the output, but also the temporal validity. Tasks are typically designed with strict deadlines and they need to respond in time, which are the timing constraints of real-time systems. Schedulability analysis is one of the...

Full description

Bibliographic Details
Main Author: Zhuo, Yuzhen
Format: Others
Language:English
Published: Uppsala universitet, Institutionen för informationsteknologi 2014
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-225911
id ndltd-UPSALLA1-oai-DiVA.org-uu-225911
record_format oai_dc
spelling ndltd-UPSALLA1-oai-DiVA.org-uu-2259112014-08-22T04:55:49ZStatic Priority Schedulability Analysis of Graph-Based Real-TimeTask Models with Resource SharingengZhuo, YuzhenUppsala universitet, Institutionen för informationsteknologi2014The correctness  of real-time systems does not only depend on the validity of the output, but also the temporal validity. Tasks are typically designed with strict deadlines and they need to respond in time, which are the timing constraints of real-time systems. Schedulability analysis is one of the approaches to study the workload of the task system. DRTRS (Digraph Real-Time task model with resource  sharing) is introduced to describe the system task model, abstracting away most functional behaviour and focus on the timing properties. We have also developed an efficient schedulability analysis under different resource  access protocols. Student thesisinfo:eu-repo/semantics/bachelorThesistexthttp://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-225911IT ; 14 030application/pdfinfo:eu-repo/semantics/openAccess
collection NDLTD
language English
format Others
sources NDLTD
description The correctness  of real-time systems does not only depend on the validity of the output, but also the temporal validity. Tasks are typically designed with strict deadlines and they need to respond in time, which are the timing constraints of real-time systems. Schedulability analysis is one of the approaches to study the workload of the task system. DRTRS (Digraph Real-Time task model with resource  sharing) is introduced to describe the system task model, abstracting away most functional behaviour and focus on the timing properties. We have also developed an efficient schedulability analysis under different resource  access protocols.
author Zhuo, Yuzhen
spellingShingle Zhuo, Yuzhen
Static Priority Schedulability Analysis of Graph-Based Real-TimeTask Models with Resource Sharing
author_facet Zhuo, Yuzhen
author_sort Zhuo, Yuzhen
title Static Priority Schedulability Analysis of Graph-Based Real-TimeTask Models with Resource Sharing
title_short Static Priority Schedulability Analysis of Graph-Based Real-TimeTask Models with Resource Sharing
title_full Static Priority Schedulability Analysis of Graph-Based Real-TimeTask Models with Resource Sharing
title_fullStr Static Priority Schedulability Analysis of Graph-Based Real-TimeTask Models with Resource Sharing
title_full_unstemmed Static Priority Schedulability Analysis of Graph-Based Real-TimeTask Models with Resource Sharing
title_sort static priority schedulability analysis of graph-based real-timetask models with resource sharing
publisher Uppsala universitet, Institutionen för informationsteknologi
publishDate 2014
url http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-225911
work_keys_str_mv AT zhuoyuzhen staticpriorityschedulabilityanalysisofgraphbasedrealtimetaskmodelswithresourcesharing
_version_ 1716711258930020352