Performability Analysis: Measures, an Algorithm, and a Case Study
IEEE Transactions on Computers - Fault-Tolerant Computing
Journal of the ACM (JACM)
On Evaluating the Cumulative Performance Distribution of Fault-Tolerant Computer Systems
IEEE Transactions on Computers
IEEE Transactions on Computers - Special issue on fault-tolerant computing
GreatSPN 1.7: graphical editor and analyzer for timed and stochastic Petri nets
Performance Evaluation - Special issue: performance modeling tools
The UltraSAN modeling environment
Performance Evaluation - Special issue: performance modeling tools
Calculating transient distributions of cumulative reward
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Performability Analysis: A New Algorithm
IEEE Transactions on Computers
Performability of an Algorithm for Connection Admission Control
IEEE Transactions on Computers
A Unified Framework for the Performability Evaluation of Fault-Tolerant Computer Systems
IEEE Transactions on Computers
The Möbius Framework and Its Implementation
IEEE Transactions on Software Engineering
SPNP: The Stochastic Petri Net Package (Version 3.1)
MASCOTS '93 Proceedings of the International Workshop on Modeling, Analysis, and Simulation On Computer and Telecommunication Systems
MRMSolve: Distribution Estimation of Large Markov Reward Models
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
A new methodology for calculating distributions of reward accumulated during a finite interval
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
SMART: Simulation and Markovian Analyzer for Reliability and Timing
IPDS '96 Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96)
Solving large interval availability models using a model transformation approach
Computers and Operations Research
Improved bounds for performability evaluation algorithms using state generation
Performance Evaluation
User-perceived software service availability modeling with reliability growth
ISAS'08 Proceedings of the 5th international conference on Service availability
A New General-Purpose Method for the Computation of the Interval Availability Distribution
INFORMS Journal on Computing
Hi-index | 0.01 |
Degradable fault-tolerant systems can be evaluated using rewarded continuous-time Markov chain (CTMC) models. In that context, a useful measure to consider is the distribution of the cumulative reward over a time interval [0, t]. All currently available numerical methods for computing that measure tend to be very expensive when the product of the maximum output rate of the CTMC model and t is large and, in that case, their application is limited to CTMC models of moderate size. In this paper, we develop two methods for computing bounds for the cumulative reward distribution of CTMC models with reward rates associated with states: BT/RT (Bounding Transformation/Regenerative Transformation) and BT/BRT (Bounding Transformation/Bounding Regenerative Transformation). The methods require the selection of a regenerative state, are numerically stable and compute the bounds with well-controlled error. For a class of rewarded CTMC models, class C′″1, and a particular, natural selection for the regenerative state the BT/BRT method allows us to trade off bound tightness with computational cost and will provide bounds at a moderate computational cost in many cases of interest. For a class of models, class C1″ slightly wider than class C′″1, and a particular, natural selection for the regenerative state, the BT/RT method will yield tighter bounds at a higher computational cost. Under additional conditions, the bounds obtained using the less expensive version of BT/BRT and BT/RT seem to be tight for any value of t or not small values of t, depending on the initial probability distribution of the model. Class C1″ and class C′″1 models with these additional conditions include both exact and bounding typical failure/repair performability models of fault-tolerant systems with exponential failure and repair time distributions and repair in every state with failed components and a reward rate structure which is a non-increasing function of the collection of failed components. We illustrate both the applicability and the performance of the methods using a large CTMC performability example of a fault-tolerant multiprocessor system.