Schedulability analysis of real-time systems with stochastic task execution times

Systems controlled by embedded computers become indispensable in our lives and can be found in avionics, automotive industry, home appliances, medicine, telecommunication industry, mecatronics, space industry, etc. Fast, accurate and flexible performance estimation tools giving feedback to the desig...

Full description

Bibliographic Details
Main Author: Manolache, Sorin
Format: Others
Language:English
Published: Linköpings universitet, ESLAB - Laboratoriet för inbyggda system 2002
Subjects:
Online Access:http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-5730
http://nbn-resolving.de/urn:isbn:9173734772
id ndltd-UPSALLA1-oai-DiVA.org-liu-5730
record_format oai_dc
spelling ndltd-UPSALLA1-oai-DiVA.org-liu-57302020-05-30T03:46:12ZSchedulability analysis of real-time systems with stochastic task execution timesengManolache, SorinLinköpings universitet, ESLAB - Laboratoriet för inbyggda systemLinköpings universitet, Tekniska högskolanInstitutionen för datavetenskap2002DatorsystemEmbedded systemsReal-time systemsStochastic execution timesPerformance analysisDatorsystemComputer SciencesDatavetenskap (datalogi)Systems controlled by embedded computers become indispensable in our lives and can be found in avionics, automotive industry, home appliances, medicine, telecommunication industry, mecatronics, space industry, etc. Fast, accurate and flexible performance estimation tools giving feedback to the designer in every design phase are a vital part of a design process capable to produce high quality designs of such embedded systems. In the past decade, the limitations of models considering fixed task execution times have been acknowledged for large application classes within soft real-time systems. A more realistic model considers the tasks having varying execution times with given probability distributions. No restriction has been imposed in this thesis on the particular type of these functions. Considering such a model, with specified task execution time probability distribution functions, an important performance indicator of the system is the expected deadline miss ratio of tasks or task graphs. This thesis proposes two approaches for obtaining this indicator in an analytic way. The first is an exact one while the second approach provides an approximate solution trading accuracy for analysis speed. While the first approach can efficiently be applied to monoprocessor systems, it can handle only very small multi-processor applications because of complexity reasons. The second approach, however, can successfully handle realistic multiprocessor applications. Experiments show the efficiency of the proposed techniques. <p>Report code: LiU-Tek-Lic-2002:58.</p>Licentiate thesis, monographinfo:eu-repo/semantics/masterThesistexthttp://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-5730urn:isbn:9173734772Local LiU-TEK-LIC-2002:58Linköping Studies in Science and Technology. Thesis, 0280-7971 ; 985application/pdfinfo:eu-repo/semantics/openAccess
collection NDLTD
language English
format Others
sources NDLTD
topic Datorsystem
Embedded systems
Real-time systems
Stochastic execution times
Performance analysis
Datorsystem
Computer Sciences
Datavetenskap (datalogi)
spellingShingle Datorsystem
Embedded systems
Real-time systems
Stochastic execution times
Performance analysis
Datorsystem
Computer Sciences
Datavetenskap (datalogi)
Manolache, Sorin
Schedulability analysis of real-time systems with stochastic task execution times
description Systems controlled by embedded computers become indispensable in our lives and can be found in avionics, automotive industry, home appliances, medicine, telecommunication industry, mecatronics, space industry, etc. Fast, accurate and flexible performance estimation tools giving feedback to the designer in every design phase are a vital part of a design process capable to produce high quality designs of such embedded systems. In the past decade, the limitations of models considering fixed task execution times have been acknowledged for large application classes within soft real-time systems. A more realistic model considers the tasks having varying execution times with given probability distributions. No restriction has been imposed in this thesis on the particular type of these functions. Considering such a model, with specified task execution time probability distribution functions, an important performance indicator of the system is the expected deadline miss ratio of tasks or task graphs. This thesis proposes two approaches for obtaining this indicator in an analytic way. The first is an exact one while the second approach provides an approximate solution trading accuracy for analysis speed. While the first approach can efficiently be applied to monoprocessor systems, it can handle only very small multi-processor applications because of complexity reasons. The second approach, however, can successfully handle realistic multiprocessor applications. Experiments show the efficiency of the proposed techniques. === <p>Report code: LiU-Tek-Lic-2002:58.</p>
author Manolache, Sorin
author_facet Manolache, Sorin
author_sort Manolache, Sorin
title Schedulability analysis of real-time systems with stochastic task execution times
title_short Schedulability analysis of real-time systems with stochastic task execution times
title_full Schedulability analysis of real-time systems with stochastic task execution times
title_fullStr Schedulability analysis of real-time systems with stochastic task execution times
title_full_unstemmed Schedulability analysis of real-time systems with stochastic task execution times
title_sort schedulability analysis of real-time systems with stochastic task execution times
publisher Linköpings universitet, ESLAB - Laboratoriet för inbyggda system
publishDate 2002
url http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-5730
http://nbn-resolving.de/urn:isbn:9173734772
work_keys_str_mv AT manolachesorin schedulabilityanalysisofrealtimesystemswithstochastictaskexecutiontimes
_version_ 1719315543242047488