Numerical iterative methods for Markovian dependability and performability models: new results and a comparison

Performance Evaluation

Volumn 39, Issue 1-4, 2000, Pages 99-125

  Suñé, Víctor ^a   Domingo, José L ^a,b   Carrasco, Juan A ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b Ardanuy Ingeniería   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; LINEAR SYSTEMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; NUMERICAL METHODS; PERFORMANCE; POISSON DISTRIBUTION; PROBABILITY; VECTORS;

CONTINUOUS TIME MARKOV CHAINS; DEPENDABILITY; ITERATIVE NUMERICAL METHODS; PERFORMABILITY;

MARKOV PROCESSES;

EID: 0343168080     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-5316(99)00060-7     Document Type: Article

References (27)

1. W.A. Adkins, S.H. Weintraub, Algebra. An Approach via Module Theory, Springer, New York, 1992.
2. G.P. Barker, R.J. Plemmons, Convergent iterations for computing stationary distributions of Markov chains, SIAM J. AIg. Disc. Meth. 7 (3) (1986) 390-398.
3. J.L. Barlow, On the smallest positive singular value of a singular M-matrix with applications to ergodic Markov chains, SIAM J. Alg. Disc. Meth. 7 (3) (1986) 414-424.
4. C. Béounes, M. Aguéra, J. Arlat, S. Bachman, C. Bourdeau, J.E. Doucet, K. Kanoun, J.C. Laprie, S. Metge, J. Moreira de Souza, D. Powell, P. Spiesser, SURF-2: a program for dependability evaluation of complex hardware and software systems, in: Proceedings of the 23rd IEEE International Symposium on Fault-Tolerant Computing (FTCS-23), 1993, pp. 668-673.
5. A. Berman, R.J. Plemmons, Nonnegative Matrices in the Mathematical Sciences, SIAM, Philadelphia, PA, 1994.
6. U.N. Bhat, Elements of Applied Stochastic Processes, 2nd ed., Wiley, New York, 1984.
7. P.N. Brown, H.F. Walker, GMRES on (nearly) singular systems, SIAM J. Matrix Anal. Appl. 18 (3) (1997) 37-51.
8. G. Ciardo, A. Blakemore, P.F. Chimento, J.K. Muppala, K.S. Trivedi, Automated generation and analysis of Markov reward models using stochastic reward nets, in: C. Meyer, R. Plemmons (Eds.), Linear Algebra, Markov Chains and Queuing Models, IMA Volumes in Mathematics and its Applications, Springer, Berlin, 1983, pp. 145-191.
9. G. Ciardo, J.K. Muppala, K.S. Trivedi, SPNP: stochastic Petri Net package, in: Proceedings of the Third IEEE International Workshop on Petri Nets and Performance Models (PNPM89), Kyoto, Japan, 1989, pp. 142-150.
10. J. Couvillon, R. Freire, R. Johnson, W. Obal II, A. Qureshi, M. Rai, W Sanders, J. Tvedt, Performability modeling with UltraSAN, IEEE Software 8 (5) (1991) 69-80.
11. R.W. Freund, M. Hochbruck, On the use of two QMR algorithms for solving singular systems and applications in Markov chain modeling, Numer. Linear Alg. Appl. 1 (4) (1994) 403-420.
12. A. Goyal, W.C. Carter, E. de Souza e Silva, S.S. Lavenberg, K.S. Trivedi, The system availability estimator, in: Proceedings of the 16th International Symposium on Fault-Tolerant Computing (FTCS-16), 1986, pp. 84-89.
13. L. Kaufman, B. Gopinath, E.F. Wunderlich, Analysis of packet network congestion control using sparse matrix algorithms, IEEE Trans. Commun. COM 29 (4) (1981) 453-465.
14. U.R. Krieger, B. Müller-Clostermann, M. Sczittnick, Modeling and analysis of communication systems based on computational methods for Markov chains, IEEE J. Selected Areas in Commun. 8 (3) (1990) 1630-1648.
15. P. Heidelberger, J.K. Muppala, K.S. Trivedi, Accelerating mean time to failure computations, Perform. Eval. 27/28 (1996) 627-645.
16. J.C.S. Lui, R.R. Muntz, D. Towsley, Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach, IEEE Trans. Comput. 44 (12) (1995) 1371-1382.
17. D. Mitra, P. Tsoucas, Relaxations for the numerical solutions of some stochastic problems, Commun. Stat. Stochastic Models 4 (3) (1988) 387-419.
18. M. Neumann, R.J. Plemmons, Convergent nonnegative matrices and iterative methods for consistent linear systems, Numer. Math. 31 (1978) 265-279.
19. B. Philippe, Y Saad, W.J. Stewart, Numerical methods in Markov chain modeling, Oper. Res. 40 (6) (1992) 1156-1179.
20. W.H. Press, B.P. Flannery, S.A. Teukolsky, W.T. Vetterling, Numerical Recipes. The Art of Scientific Computing, Cambridge University Press, Cambridge, 1986.
21. Y. Saad, Iterative Methods for Sparse Linear Systems, PWS Publishing Company, Boston, MA, 1996.
22. Y. Saad, M.H. Schultz, GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Stat. Comput. 7 (3) (1986) 856-869.
23. M. Sosonkina, L.T. Watson, R.K. Kapania, H.F. Walker, A new adaptive GMRES algorithm for achieving high accuracy, Numer. Linear Alg. Appl. 5 (1998) 275-297.
24. W.J. Stewart, Introduction to the Numerical Solution of Markov Chains, Princeton University Press, Princeton, NJ, 1994.
25. W.J. Stewart, A. Goyal, Matrix methods in large dependability models, IBM Thomas J. Watson Research Center, Technical Report RC-11485, 1985.
26. R.S. Varga, Matrix Iterative Analysis, Prentice-Hall, Englewood Cliffs, NJ, 1962.
27. D.M. Young, Iterative Solution of Large Linear Systems, Academic Press, Orlando, FL, 1971.