Advertisement

On the Transient Analysis of Stiff Markov Chains

  • Jürgen Dunkel
  • Harald Stahl
Part of the Dependable Computing and Fault-Tolerant Systems book series (DEPENDABLECOMP, volume 8)

Abstract

Dependability and performability analysis commonly requires the transient analysis of Markov chains. Because most of these models involve rates of different orders of magnitude, they lead to stiff Markov chains, which are ill-conditioned in a computational sense for conventional numerical methods. In this paper the well-known randomization technique is adapted to cope with a special class of stiff models. Then we present a class of models wich remain computational intractable. This leads to an appropriate new characterization of stiff Markov chains. For this model class the recently proposed implicit ODE-solvers are also computational infeasible, if they use iterative numerical techniques. A modified step size control and iterative aggregation/disaggregation techniques are proposed to improve the solver performance. The composite usage of both techniques yields large computational gains, especially for higher order methods.

Keywords

Algebraic System Transient Analysis Ordinary Differential Equation Stiffness Index Continuous Time Markov Chain 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A. V. Aho, J. E. Hopcraft, J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.zbMATHGoogle Scholar
  2. [2]
    R. C. Aiken (ed.). Stiff Computation. Oxford University Press, Oxford, 1985.zbMATHGoogle Scholar
  3. [3]
    R. Bank, W. Courghan, W. Fichtner, E. Grosse, D. Rose, R. Smith. Transient simulation of silicon devices and circuits. IEEE Transactions on CAD, 1985, pp. 436-451.Google Scholar
  4. [4]
    R. K. Brayton, F. G. Gustavson, G. D. Hachtel. A new efficient algorithm for solving differential-algebraic systems using implicit backward differentiation formulas. Proceedings of the IEEE, Vol. 60, 1972, pp. 98–108.MathSciNetCrossRefGoogle Scholar
  5. [5]
    P. J. Courtois. Decomposability: Queueing and computer applications. Academic Press, 1977.Google Scholar
  6. [6]
    W. L. Cao, W. J. Stewart. Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains. Journal of the ACM, 1985, pp. 702-719.Google Scholar
  7. [7]
    J. Dunkel. On the modeling of workload dependent memory faults. Proc. of the 20th International Symposium of Fault Tolerant Computing (FTCS—20), 1990, pp. 348-355.Google Scholar
  8. [8]
    J. Dunkel, H. Stahl. A heuristical approach to determine state space partitions. Internal report, University of Dortmund, Informatik IV, (in German), 1991.Google Scholar
  9. [9]
    B. L. Fox, P. W. Glynn. Computing poisson probabilities. Communications of the ACM, 1988, pp. 440-445.Google Scholar
  10. [10]
    G. H. Golub, C. F. van Loan. Nineteen dubious ways to compute the exponential of a matrix. SIAM review, 1978, pp. 801-835.Google Scholar
  11. [11]
    D. Gross, D. Miller. Randomization technique as a modeling tool and solution procedure for transient markov processes. Operations Research, 1984, pp. 343-361.Google Scholar
  12. [12]
    W. K. Grassmann. Finding transient solutions in markovian event systems through randomization. 1st Intern. Workshop on the Numerical Solution of Markovian Chains, Raleigh, 1990, pp. 375-95.Google Scholar
  13. [13]
    J. Lambert. Computational methods in ordinary differential equations. Wiley, London, 1973.zbMATHGoogle Scholar
  14. [14]
    W. L. Miranker. Numerical methods for stiff equations and singular perturbation problems. Reidel, Dordrecht, 1981.Google Scholar
  15. [15]
    M. Malhotra, K. S. Trivedi. High-order methods for transient analysis of stiff markov chains. Intern. Conf. on the Performance of Distributed Systems and Integrated Communication Networks, Kyoto, 1991.Google Scholar
  16. [16]
    J. K. Muppala. Performance and dependability modeling using stochastic reward nets. PhD. thesis, Duke University, Durham, NC, 1991.Google Scholar
  17. [17]
    J. K. Muppala, K. S. Trivedi. Numerical transient solution of finite markovian queueing systems. To appear in: Queueing and Related Models, U. Bhat ed., Oxford University Press, 1992.Google Scholar
  18. [18]
    B. Melamed, M. Yadin. Randomization procedure in the computation of cumulative-time distributions over discrete state markov processes. Operations Research, 1984, pp. 926-944.Google Scholar
  19. [19]
    A. L. Reibman, K. S. Trivedi. Numerical transient analysis of markov models. Computers and Operations Research, 1988, pp. 19-36.Google Scholar
  20. [20]
    W. J. Steward, A. Goyal. Matrix methods for large dependability methods. IBM Research Report RC 11485, 1985.Google Scholar
  21. [21]
    P. J. Schweitzer, K. W. Kindle. An iterative aggregation-disaggregation algorithm for solving linear equations. Applied Mathematics and Computation, Vol. 18, 1986, pp. 313–353.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Wien 1993

Authors and Affiliations

  • Jürgen Dunkel
    • 1
  • Harald Stahl
    • 1
  1. 1.Informatik IVUniversität DortmundDortmund 50Germany

Personalised recommendations