Analysis of Performability for Stochastic Models of Fault-Tolerant Systems
IEEE Transactions on Computers
Performability Analysis: Measures, an Algorithm, and a Case Study
IEEE Transactions on Computers - Fault-Tolerant Computing
Journal of the ACM (JACM)
Performability Analysis Using Semi-Markov Reward Processes
IEEE Transactions on Computers
On Evaluating the Cumulative Performance Distribution of Fault-Tolerant Computer Systems
IEEE Transactions on Computers
A Unified Framework for the Performability Evaluation of Fault-Tolerant Computer Systems
IEEE Transactions on Computers
Availability Analysis of Repairable Computer Systems and Stationarity Detection
IEEE Transactions on Computers
A Dependability Analysis for Systems with Global Spares
IEEE Transactions on Computers
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
MRMSolve: Distribution Estimation of Large Markov Reward Models
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Computers and Operations Research
What Designers of Bus and Network Architectures Should Know about Hypercubes
IEEE Transactions on Computers
Transient and Asymptotic Analysis of General Markov Fluid Models
Queueing Systems: Theory and Applications
Asymptotic solution of stochastic fluid models
Performance Evaluation
Short communication: Uniqueness of asymptotic solution for general Markov fluid models
Performance Evaluation
Performability: asymptotic distribution and moment computation
Computers & Mathematics with Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
Fluid analysis of energy consumption using rewards in massively parallel markov models
Proceedings of the 2nd ACM/SPEC International Conference on Performance engineering
A unified approach to the moments based distribution estimation – unbounded support
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
A New General-Purpose Method for the Computation of the Interval Availability Distribution
INFORMS Journal on Computing
| Hi-index | 14.99 |
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 he algorithm.