Abstract
Many physical or computer systems can be modelled as Markov chains. A range of solution techniques exist to address the state-space explosion problem, encountered while analysing such Markov models. However, numerical solution of these Markov chains is impeded by the need to store the probability vector(s) explicitly in the main memory. In this paper, we extend the earlier out-of-core methods for the numerical solution of large Markov chains and introduce an algorithm which uses a disk to hold the probability vector as well as the matrix. We give experimental results of the implementation of the algorithm for a Kanban manufacturing system and a flexible manufacturing system. Next, we describe how the algorithm can be modified to exploit sparsity structure of a model, leading to better performance. We discuss two models, a cyclic server polling system and a workstation cluster system, in this context and present results for the polling models. We also introduce a new sparse matrix storage format which can provide 30% or more saving over conventional schemes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alexander Bell and Boudewijn R. Haverkort. Serial and Parallel Out-of-Core Solution of Linear Systems arising from Generalised Stochastic Petri Nets. In Proc. High Performance Computing 2001, Seattle, USA, April 2001.
G. Ciardo and A. Miner. A Data Structure for the Efficient Kronecker Solution of GSPNs. In Proc. 8th International Workshop on Petri Nets and Performance Models (PNPM’99), Zaragoza, 1999.
G. Ciardo and M. Tilgner. On the use of Kronecker Operators for the Solution of Generalized Stocastic Petri Nets. ICASE Report 96-35, Institute for Computer Applications in Science and Engineering, 1996.
G. Ciardo and K. S. Trivedi. A Decomposition Approach for Stochastic Reward Net Models. Performance Evaluation, 18(1):37–59, 1993.
Gianfrance Ciardo. What a Structural World. In Reinhard German and Boudewijn Haverkort, editors, Proceedings of the 9th International Workshop on Petri Nets and Performance Models, pages 3–16, Aachen, Germany, September 11-14 2001.
E. Clarke, M. Fujita, P. McGeer, J. Yang, and X. Zhao. Multi-Terminal Binary Decision Diagrams: An Effificient Data Structure for Matrix Representation. In Proc. International Workshop on Logic Synthesis (IWLS’93), pages 6a:1–15, Tahoe City, May 1993. Also available in Formal Methods in System Design, 10(2/3), 1997.
Daniel D. Deavours and William H. Sanders. An Efficient Disk-based Tool for Solving Very Large Markov Models. In Lecture Notes in computer Science: Proceedings of the 9th International Conference on Modelling Techniques and Tools (TOOLS’ 97), pages 58–71, St. Malo, France, June 1997. Springer-Verlag.
Daniel D. Deavours and William H. Sanders. An Efficient Disk-based Tool for Solving Large Markov Models. Performance Evaluation, 33(1):67–84, 1998.
Daniel D. Deavours and William H. Sanders. “On-the-fly” Solution Techniques for Stochastic Petri Nets and Extensions. IEEE Transactions on Software Engineering, 24(10):889–902, 1998.
S. Donatelli. Superposed Stochastic Automata: A Class of Stochastic Petri Nets Amenable to Parallel Solution. Performance Evaluation, 18:21–36, 1993.
I. S. Duff, A. M. Erisman, and J. K. Reid. Direct Methods for Sparse Matrices. Oxford Science Publications. Clarendon Press Oxford, (with corrections) 1997.
G. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Markovian analysis of large finite state machines. IEEE Transactions on CAD, 15(12):1479–1493, December 1996.
H. Hansson and B. Jonsson. A Logic for Reasoning about Time and Probability. Formal Aspects of Computing, 6:512–535, 1994.
B. Haverkort, H. Hermanns, and J.-P. Katoen. On the Use of Model Checking Techniques for Dependability Evaluation. In Proc. 19th IEEE Symposium on Reliable Distributed Systems (SRDS 2000), pages 228–237, Erlangen, Germany, October 2000.
John L. Hennessy and David A. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann Publishers, Inc., 2nd edition, 1996.
H. Hermanns, J. Meyer-Kayser, and M. Siegle. Multi Terminal Binary Decision Diagrams to Represent and Analyse Continuous Time Markov Chains. In Proc. Numerical Solutions of Markov Chains (NSMC’99), Zaragoza, 1999.
O. Ibe and K. Trivedi. Stochastic Petri Net Models of Polling Systems. IEEE Journal on Selected Areas in Communications, 8(9):1649–1657, 1990.
William J. Knottenbelt. Parallel Performance Analysis of Large Markov Models. PhD thesis, Imperial College of Science, Technology and Medicine, University of London, 1999.
William J. Knottenbelt and Peter G. Harrison. Distributed Disk-based Solution Techniques for Large Markov Models. In Proc. Numerical Solution of Markov Chains (NSMC’99), Zaragoza, 1999.
M. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic Symbolic Model Checker. In Proc. TOOLS 2002, April 2002.
M. Kwiatkowska, G. Norman, and D. Parker. Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach. In Proc. TACAS 2002, April 2002.
Andrew S. Miner. Efficient Solution of GSPNs using Canonical Matrix Diagrams. In Reinhard German and Boudewijn Haverkort, editors, Proceedings of the 9th International Workshop on Petri Nets and Performance Models, pages 101–110, Aachen, Germany, September 2001.
B. Plateau. On the Stochastic Structure of Parallelism and Synchronisation Models for Distributed Algorithms. In Proc. 1985 ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 147–153, Austin, TX, USA, May 1985.
Yousaf Saad. Iterative Methods for Sparse Linear Systems. PWS Publishing Company, 1996.
Markus Siegle. Advances in Model Representations. In Luca de Alfaro and Stephen Gilmore, editors, Proc. PAPM/PROBMIV 2001, Available as Volume 2165 of LNCS, pages 1–22, Aachen, Germany, September 2001. Springer Verlag.
W.J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton University Press, 1994.
Sivan Toledo. A Survey of Out-of-Core Algorithms in Numerical Linear Algebra. In James Abello and Jeffrey Scott Vitter, editors, External Memory Algorithms and Visualization, DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society Press, Providence, RI, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kwiatkowska, M., Mehmood, R. (2002). Out-of-Core Solution of Large Linear Systems of Equations Arising from Stochastic Modelling. In: Hermanns, H., Segala, R. (eds) Process Algebra and Probabilistic Methods: Performance Modeling and Verification. PAPM-PROBMIV 2002. Lecture Notes in Computer Science, vol 2399. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45605-8_9
Download citation
DOI: https://doi.org/10.1007/3-540-45605-8_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43913-4
Online ISBN: 978-3-540-45605-6
eBook Packages: Springer Book Archive