Sökning: WFRF:(Papadopoulos Alessandro) >
Adaptive Runtime Es...
Adaptive Runtime Estimate of Task Execution Times using Bayesian Modeling
-
- Friebe, Anna (författare)
- Mälardalens högskola,Inbyggda system
-
- Markovic, Filip (författare)
- Mälardalens högskola,Inbyggda system
-
- Papadopoulos, Alessandro (författare)
- Mälardalens högskola,Inbyggda system
-
visa fler...
-
- Nolte, Thomas (författare)
- Mälardalens högskola,Inbyggda system
-
visa färre...
-
(creator_code:org_t)
- Institute of Electrical and Electronics Engineers Inc. 2021
- 2021
- Engelska.
-
Ingår i: Proceedings - 2021 IEEE 27th International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2021. - : Institute of Electrical and Electronics Engineers Inc.. - 9781665441889 ; , s. 1-10
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- In the recent works that analyzed execution-time variation of real-time tasks, it was shown that such variation may conform to regular behavior. This regularity may arise from multiple sources, e.g., due to periodic changes in hardware or program state, program structure, inter-task dependence or inter-task interference. Such complexity can be better captured by a Markov Model, compared to the common approach of assuming independent and identically distributed random variables. However, despite the regularity that may be described with a Markov model, over time, the execution times may change, due to irregular changes in input, hardware state, or program state. In this paper, we propose a Bayesian approach to adapt the emission distributions of the Markov Model at runtime, in order to account for such irregular variation. A preprocessing step determines the number of states and the transition matrix of the Markov Model from a portion of the execution time sequence. In the preprocessing step, segments of the execution time trace with similar properties are identified and combined into clusters. At runtime, the proposed method switches between these clusters based on a Generalized Likelihood Ratio (GLR). Using a Bayesian approach, clusters are updated and emission distributions estimated. New clusters can be identified and clusters can be merged at runtime. The time complexity of the online step is $O(N^{2}+ NC)$ where N is the number of states in the Hidden Markov Model (HMM) that is fixed after the preprocessing step, and C is the number of clusters.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Inbäddad systemteknik (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Embedded Systems (hsv//eng)
Nyckelord
- Bayesian Analysis
- Hidden Markov Model
- Probabilistic Timing Analysis
- Real-time systems
- Bayesian networks
- Hidden Markov models
- Interactive computer systems
- Timing circuits
- Bayesian approaches
- Hidden-Markov models
- Markov modeling
- Pre-processing step
- Probabilistic timing analyse
- Probabilistics
- Program state
- Real - Time system
- Timing Analysis
- Real time systems
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas