Performability analysis: a new algorithm

We propose, in this paper, a new algorithm to compute the performability distribution. Its computational complexity is polynomial and it deals only with nonnegative numbers bounded by one. This important property allows us to determine truncation steps and so to improve the execution time of the alg...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 1996-04, Vol.45 (4), p.491-494
Main Authors: Nabli, H., Sericola, B.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computational complexity
Computer science
control theory
systems
Computer systems performance. Reliability
Distributed computing
Exact sciences and technology
Fault tolerant systems
Markov processes
Performance analysis
Performance evaluation
Polynomials
Software
Steady-state
Theoretical computing
Time measurement
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We propose, in this paper, a new algorithm to compute the performability distribution. Its computational complexity is polynomial and it deals only with nonnegative numbers bounded by one. This important property allows us to determine truncation steps and so to improve the execution time of the algorithm.
ISSN:0018-9340
1557-9956
DOI:10.1109/12.494108