Analysis of the completion time of Markov reward models and its application
Analysis of Markov Reward Models (MRM) with preemptive resume (prs) policy usually results in a double transform expression, whose solution is based on the inverse transformations both in time and reward variable domain. This . paper discusses the case when the reward rates can be either 0 or positi...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1998
|
| Sorozat: | Acta cybernetica
13 No. 4 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12603 |
| Tartalmi kivonat: | Analysis of Markov Reward Models (MRM) with preemptive resume (prs) policy usually results in a double transform expression, whose solution is based on the inverse transformations both in time and reward variable domain. This . paper discusses the case when the reward rates can be either 0 or positive, and analyses the completion time of MRMs. We present a symbolic expression of moments of the completion time, from which a computationally effective recursive numerical method can be obtained. As a numerical example the mean and the standard deviation of the completion time of a Carnegie-Mellon multiprocessor system are evaluated by the proposed method. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 439-452 |
| ISSN: | 0324-721X |