A light-weight solution for large sparse Markov processes

Authors:
Hertong Song;Chokchai Leangsuksun;Raja Nassar
Affiliations:
Louisiana Tech University, Ruston, LA;Louisiana Tech University, Ruston, LA;Louisiana Tech University, Ruston, LA
Venue:
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Year:
2005

Citing 6
Cited 1

Calculating Cumulative Operational Time Distributions of Repairable Computer Systems

IEEE Transactions on Computers - The MIT Press scientific computation series
Computing Poisson probabilities

Communications of the ACM
Numerical transient analysis of Markov models

Computers and Operations Research
Numerical methods in Markov chain modeling

Operations Research
A numerical study of large sparse matrix exponentials arising in Markov chains

Computational Statistics & Data Analysis
Inside the Java Virtual Machine

Inside the Java Virtual Machine

A framework for cluster availability specification and evaluation

Proceedings of the 43rd annual Southeast regional conference - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper illustrates the uniformization procedure for a numerical transient solution of large sparse Markov processes. Alternative implementations are discussed, particularly on the small state space of a Markov process. A light weight solution is presented for solving large sparse systems. The light weight solution has the merits of clear modularity, platform independency, and ease of deployment on the network for remote computing.