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

DOI10.1145/226275.226278zbMath0887.60074MaRDI QIDQ4368864

David M. Nicol, Philip Heidelberger

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

algorithms; simulation; Markov chains

Mathematics Subject Classification ID

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

68W15: Distributed algorithms