By Topic

Solving Markov chains using bounded aggregation on a massively parallel processor

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Mattingly, R.B. ; Dept. of Math., Youngstown State Univ., OH, USA

An SIMD implementation of a method for approximating the stationary distribution vector of a Markov chain is presented. A key feature of the implementation is the simultaneous computation of several matrix inverses. Computational results from a MasPar MP-1 system are discussed

Published in:

Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on

Date of Conference:

1-4 Dec 1993