Abstract
GSPN models often generate high cardinality state spaces, whose analysis requires the solution of very large and sparse nonsymmetric linear systems for the associated Markov chain. In this paper we report the results of an empirical investigation of three well-known iterative methods for linear systems of equations: Gauss-Seidel, GMRES, and Bi-CGstab. We evaluate these methods on several large Markov chains generated by GSPN models proposed in the literature. Issues addressed include state space characterization, problem conditioning, numerical accuracy and stability, and computation time. Results show that increased attention should be paid to the numerical issues underlying performance and reliability analyses when dealing with large state spaces.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ajmone Marsan, M., Balbo, G., Conte, G., Donatelli, S., Franceschinis, G.: Modelling with Generalized Stochastic Petri Nets. Wiley, New York (1995)
Ajmone Marsan, M., Donatelli, S., Neri, F.: GSPN models of markovian multiserver multiqueue systems. Perform. Eval. 11(4), 227–240 (1990)
Baarir, S., Beccuti, M., Cerotti, D., De Pierro, M., Donatelli, S., Franceschinis, G.: The GreatSPN tool: recent enhancements. ACM SIGMETRICS Perform. Eval. Rev. 36, 4–9 (2009)
Caselli, S., Conte, G.: GSPN models of concurrent architectures with mesh topology. In: Proceedings of the 4th IEEE International Workshop on Petri Nets and Performance Models, Melbourne, Australia, December 1991
Caselli, S., Conte, G., Marenzoni, P.: Parallel state space exploration for GSPN models. In: De Michelis, G., Diaz, M. (eds.) ICATPN 1995. LNCS, vol. 935, pp. 181–200. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-60029-9_40
Caselli, S., Conte, G., Marenzoni, P.: A distributed algorithm for GSPN reachability graph generation. J. Parallel Distrib. Comp. 61(1), 79–95 (2001)
Chiola, G., Franceschinis, G., Gaeta, R., Ribaudo, M.: GreatSPN 1.7: graphical editor and analyzer for timed and stochastic Petri nets. Perform. Eval. 24(1–2), 47–68 (1995)
Ciardo, G., Tilgner, M.: On the use of Kronecker operators for the solution of generalized stochastic petri nets. ICASE Report No. 96-35 CR-198336, NASA Langley Research Center, May 1996
Deavours, D.D., Sanders, W.H.: On-the-Fly solution techniques for stochastic Petri nets and extensions. IEEE Trans. Softw. Eng. 24(10), 889–902 (1998)
Fletcher, R.: Conjugate gradient methods for indefinite systems. In: Watson, G.A. (ed.) Numerical Analysis. LNM, vol. 506, pp. 73–89. Springer, Heidelberg (1976). https://doi.org/10.1007/BFb0080116
Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins, Baltimore (1996)
Hestenes, M.R., Stiefel, E.: Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stand. 49, 409–436 (1952)
Kemper, P.: Transient analysis of superposed GSPNs. In: Proceedings of the 7th IEEE International Workshop on Petri Nets and Performance Models, Saint Malo, France, pp. 101–110, June 1997
Marenzoni, P., Caselli, S., Conte, G.: Analysis of large GSPN models: a distributed solution tool. In: Proceedings of the 7th IEEE International Workshop on Petri Nets and Performance Models, Saint Malo, France, pp. 122–131, June 1997
Philippe, B., Saad, Y., Stewart, W.J.: Numerical methods in Markov chain modeling. J. Oper. Res. 40, 1156–1179 (1992)
Saad, Y., Schultz, M.H.: GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 7, 856–869 (1986)
Sonneveld, P.: CGS: a fast Lanczos-type solver for nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 10, 36–52 (1989)
Stewart, W.J.: Introduction to Numerical Solution of Markov Chains. Princeton University Press, Princeton (1994)
Tanimoto, H.: Factory automation: an automatic assembly line for manufacture of printers. IEEE Comput. 12, 50–68 (1984)
Van Der Vorst, H.A.: Bi-CGStab: a fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 13, 631–644 (1992)
Acknowledgment
We are grateful to Enrico Riccardi and Lorenzo Amighetti for their contribution to the initial phase of this research.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Caselli, S., Conte, G., Diligenti, M. (2018). Evaluation of Iterative Methods on Large Markov Chains Generated by GSPN Models. In: Balsamo, S., Marin, A., Vicario, E. (eds) New Frontiers in Quantitative Methods in Informatics. InfQ 2017. Communications in Computer and Information Science, vol 825. Springer, Cham. https://doi.org/10.1007/978-3-319-91632-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-91632-3_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91631-6
Online ISBN: 978-3-319-91632-3
eBook Packages: Computer ScienceComputer Science (R0)