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 Multiprocessor Real-Time Applications with Stochastic Task Execution Times
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. Linköping University, Department of Computer and Information Science, ESLAB - Embedded Systems Laboratory.
2002 (English)In: Intl Conference on Computer Aided Design, ICCAD 02,2002, San Jose, California, USA: IEEE Computer Society Press , 2002, 699- p.Conference paper, Published paper (Refereed)
Abstract [en]

This paper presents an approach to the analysis of task sets implemented on multiprocessor systems, when the task execution times are specified as generalized probability distributions. Because of the extreme complexity of the problem, an exact solution is practically impossible to be obtained even for toy examples. Therefore, our methodology is based on approximating the generalized probability distributions of execution times by Coxian distributions of exponentials. Thus, we transform the generalized semi-Markov process, corresponding to the initial problem, into a continuous Markov chain (CTMC) which, however, is extremely large and, hence, most often is impossible to be stored in memory. We have elaborated a solution which allows to generate and analyze the CTMC in an efficient way, such that only a small part has to be stored at a given time. Several experiments investigate the impact of various parameters on complexity, in terms of time and memory, as well as the trade-offs regarding the accuracy of generated results.

Place, publisher, year, edition, pages
San Jose, California, USA: IEEE Computer Society Press , 2002. 699- p.
Keyword [en]
continuous Markov chain, tast execution time analysis, CTMC
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-23350Local ID: 2785OAI: oai:DiVA.org:liu-23350DiVA: diva2:243664
Available from: 2009-10-07 Created: 2009-10-07

Open Access in DiVA

No full text

Other links

http://www.ida.liu.se/labs/eslab/publications/pap/db/ICCAD02.pdf

Authority records BETA

Manolache, SorinEles, Petru IonPeng, Zebo

Search in DiVA

By author/editor
Manolache, SorinEles, Petru IonPeng, Zebo
By organisation
The Institute of TechnologyESLAB - Embedded Systems Laboratory
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 70 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