liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Schedulability Analysis of Real-Time Systems with Stochastic Task Execution Times
Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, The Institute of Technology.
Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, The Institute of Technology.
Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory. Linköping University, The Institute of Technology.
2006 (English)In: ARTES: A network for Real-Time research and graduate Education in Sweden 1997-2006 / [ed] Hans Hansson, Uppsala: The Department of Information Technology , 2006, 123-159 p.Chapter in book (Other academic)
Abstract [en]

For soft real-time applications, a system is considered to function correctly even if some timeliness requirements are occasionally broken, since this leads only to a tolerable reduction of the service quality. Analysis of such a system should be focused on the degree to which the system meets its timeliness requirements rather than on a binary answer indicating whether the whole system is schedulable or not. In many soft real-time applications, the task execution times vary also widely since they are dependent on many parameters. In such a context, analysis techniques based on worst case execution time assumption will lead to very pessimistic results, and many techniques have been developed to consider a more realistic model that assumes tasks to have varying execution times with given probability distributions. The chapter presents one of such techniques. It describes an analytic method to produce the expected deadline miss ratio of the tasks and the task graphs that represent a software real-time application. The reported method improves the currently existing ones by providing exact solutions for larger and less restricted task sets. In particular, it allows continuous task execution time probability distributions, and supports different scheduling policy. Furthermore, task dependencies and arbitrary deadlines are supported by the proposed technique.

Place, publisher, year, edition, pages
Uppsala: The Department of Information Technology , 2006. 123-159 p.
Series
Technical report / Department of Information Technology, Uppsala University, ISSN 1404-3203 ; 2006:006
Keyword [en]
embedded systems, soft real-time, schedulability analysis, stochastic task execution, analytic method
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-33838Local ID: MDH-MRTC-197/2006-1-SEISBN: 91-506-1859-8 (print)Archive number: 19909OAI: oai:DiVA.org:liu-33838DiVA: diva2:254661
Note

MRTC report, ISSN 1404-3041 No, 197/2006

Available from: 2009-10-09 Created: 2009-10-09 Last updated: 2016-06-30Bibliographically approved

Open Access in DiVA

No full text

Other links

find book at a swedish library/hitta boken i ett svenskt bibliotek

Authority records BETA

Manolache, SorinEles, Petru IonPeng, Zebo

Search in DiVA

By author/editor
Manolache, SorinEles, Petru IonPeng, Zebo
By organisation
ESLAB - Embedded Systems LaboratoryThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 139 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf