Parallel Randomization for Large Structured Markov Chains

  • Authors:
  • Peter Kemper

  • Affiliations:
  • -

  • Venue:
  • DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multiprocessor architectures with few but powerful processors gain more and more popularity. In this paper we describe a parallel iterative algorithm to perform randomization for a continuous time Markov chain with a Kronecker representation on a shared memory architecture. The Kronecker representation is modified for a parallel matrix-vector multiplication with a fast multiplication scheme and no write conflicts on iteration vectors. The proposed technique is applied on a model of a workstation cluster for dependability analysis, corresponding computations are performed on two multiprocessor architectures, a Sun enterprise and a SGI Origin 2000 to measure its performance.