Analysis of the Completion Time of Markov Reward Models and its Application

M. Telek, András Pfening, Gábor Fodor

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish
Pages (from-to)439-452
Number of pages14
JournalActa Cybernetica
Volume13
Issue number4
Publication statusPublished - 1998

Fingerprint

Completion Time
Reward
Numerical methods
Recursive Method
Multiprocessor Systems
Standard deviation
Numerical Methods
Model
Transform
Moment
Numerical Examples

Keywords

  • Completion Time
  • Markov Reward Models
  • Preemptive Resume Policy

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software

Cite this

Analysis of the Completion Time of Markov Reward Models and its Application. / Telek, M.; Pfening, András; Fodor, Gábor.

In: Acta Cybernetica, Vol. 13, No. 4, 1998, p. 439-452.

Research output: Contribution to journalArticle

Telek, M. ; Pfening, András ; Fodor, Gábor. / Analysis of the Completion Time of Markov Reward Models and its Application. In: Acta Cybernetica. 1998 ; Vol. 13, No. 4. pp. 439-452.
@article{87423ac53bae497490f40222152c8635,
title = "Analysis of the Completion Time of Markov Reward Models and its Application",
abstract = "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.",
keywords = "Completion Time, Markov Reward Models, Preemptive Resume Policy",
author = "M. Telek and Andr{\'a}s Pfening and G{\'a}bor Fodor",
year = "1998",
language = "English",
volume = "13",
pages = "439--452",
journal = "Acta Cybernetica",
issn = "0324-721X",
publisher = "University of Szeged",
number = "4",

}

TY - JOUR

T1 - Analysis of the Completion Time of Markov Reward Models and its Application

AU - Telek, M.

AU - Pfening, András

AU - Fodor, Gábor

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

KW - Completion Time

KW - Markov Reward Models

KW - Preemptive Resume Policy

UR - http://www.scopus.com/inward/record.url?scp=0348166833&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0348166833&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0348166833

VL - 13

SP - 439

EP - 452

JO - Acta Cybernetica

JF - Acta Cybernetica

SN - 0324-721X

IS - 4

ER -