In this paper, we propose a new parallel sparse iterative method (PPSIA) for computing the stationary distribution of large-scale Markov chains. The PPSIA method is based on Markov chain state isolation and aggregation techniques. The parallel method conserves as much as possible the benefits of aggregation, and Gauss–Seidel effects contained in the sequential algorithm (SIA) using a pipelined technique. Both SIA and PPSIA exploit sparse matrix representation in order to solve large-scale Markov chains. Some Markov chains have been tested to compare the performance of SIA, PPSIA algorithms with other techniques such as the power method, and the generalized minimal residual GMRES method. In all the tested models, PPSIA outperforms the other methods and shows a super-linear speed-up.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Gelenbe E, Labetoulle J, Marie R, Stewart WJ (1980) Reseaux de files d’attentes—modelisation et traitement numerique. In: Ed des hommes et technique de l’AFCET
Varga RS (1963) Matrix iteratives analysis. Printice Hall, Englewood Cliffs
Saad Y (1981) Krylov Subspace Methods for Solving Unsymetric Linear Systems. Math Comput 37:105–126
Philippe B, Saad Y, Stewart WJ (1992) Numerical methods in Markov chain modeling. Oper Res 40:1156–1179
Couturier R, Jezequel F (2010) Solving large-scale linear systems in grid environment using Java. In: Proceeding of IPDPS’10, Atlanta, USA
Touzene A (2012) A new parallel block aggregated algorithm for solving Markov chains. J Supercomput 62:573–587
Benzi M, Tuma M (2002) A parallel solver for large-scale Markov chains. Appl Numer Math 41:135–153
Benzi M, Ucar B (2007) Block triangular preconditioners for M-matrices and Markov chains. Electron Trans Numer Anal 26:209–227
Touzene A (1995) A new iterative method for solving large-scale Markov chains. In: Lecture notes in computer science, vol 977. Springer, Berlin, pp 180–193
Cao W-L, Stewart WJ (1985) Iterative aggregation/disaggregation techniques for nearly uncoupled Markov chains. J ACM 32(3):702–719
Koury R, McAllister DF, Stewart WJ (1984) Iterative methods for computing stationary distributions of nearly completely decomposable Markov chains. SIAM J Alg Discrete Math 5(2):164–186
Schweitzer PJ (1983) Aggregation methods for large Markov chains. In: International workshop on applied mathematics and performance reliability models of computer communication systems. University of Pisa, Pisa, pp 225–234
Stewart WJ, Wu W (1992) Numerical experiments with iteration and aggregation for Markov chains. ORSA J Comput 4:336–350
Dayar T, Stewart WJ (2000) Comparison of partitioning techniques for two-level iterative methods on large, sparse Markov chains. SIAM J Sci Comput 21:1691–1705
We thank Sultan Qaboos University for providing the High Performance Computer (HPC). We also thank Professor William Stewart for making the MARCA software available.
About this article
Cite this article
Touzene, A. A new parallel algorithm for solving large-scale Markov chains. J Supercomput 67, 239–253 (2014). https://doi.org/10.1007/s11227-013-0997-5
- Performance evaluation
- Markov chains
- Iterative methods
- Aggregation techniques