A comparative study of parallel algorithms for simulating continuous time Markov chains

DOI10.1145/226275.226278zbMath0887.60074OpenAlexW2006231437MaRDI QIDQ4368864

Philip Heidelberger, David M. Nicol

Publication date: 23 April 1998

Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/tomacs/

zbMATH Keywords

algorithmssimulationMarkov chains

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Distributed algorithms (68W15)

This page was built for publication: A comparative study of parallel algorithms for simulating continuous time Markov chains