Extended Abstract
We are concerned with computing the steady-state distribution it of an finite irreducible Markov chain with transition matrix P. We will use the GTH [1]algorithm which has excellent numerical properties which have been demonstrated empirically[2] and mathematically [3] We have at our disposal workstations and a massively parallel computer; we want to see how execution times on the latter compare to execution times on the former. Embedded in this endeavor is an exploration of how to harness the massively parallel computer to work on the GTH algorithm. Our main conclusions are:
-
Our massively parallel computer can solve a problem with one thousand states one hundred times as fast as a serial computer. Extrapolation of our experience using one-eighth of the available memory indicates that for a problem with eleven thousand states,the serial machine would require 104 as much time as the parallel machine
-
Having enough memory to store the transition matrix is the limiting factor for our parallel computer.
-
When the transition matrix has the block tridiagonal form, our parallel computer can store many thousands of states (depending on the block size; 16 × 106 states can be stored when the blocks are 2 × 2) and compute the steady-state distribution in a few hours. The 16 × 106 state example can be done in 24 hours.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
W. K. Grassmann, M. I. Taksar and D. P. Heyman, “Regenerative analysis and steady state distributions for Markov chains”, Operat. Res. 37, 1107–116, 1985.
D. P. Heyman, “Further comparisons of some direct methods for computing steady-state distributions of Markov chains”, SIAM J. Aig. and Disc. Meth. 8, 226–232, 1987.
C. A. O’Cinneide, “Nonnegative arithmetic and relative-error analysis for Markov chains”, Nam. Math. 65,109–120, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media New York
About this paper
Cite this paper
Cohen, D.M., Heyman, D.P., Rabinovitch, A., Brown, D. (1995). Parallel Implementation of the GTH Algorithm for Markov Chains. In: Stewart, W.J. (eds) Computations with Markov Chains. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2241-6_35
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2241-6_35
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5943-2
Online ISBN: 978-1-4615-2241-6
eBook Packages: Springer Book Archive