Optimistic parallel simulation of continuous time Markov chains using uniformization

DOI10.1006/JPDC.1993.1073MaRDI QIDQ1309209zbMATH OpenOpenAlexFDO

Authors David M. Nicol, Philip Heidelberger

Publication date 24 February 1994

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1993.1073

zbMATH Keywords

optimistic synchronizationuniformizationparallel simulationcontinuous time Markov chain

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Continuous-time Markov processes on discrete state spaces (60J27)

Recommendations

• A comparative study of parallel algorithms for simulating continuous time Markov chains
• scientific article; zbMATH DE number 956823
• Adaptive uniformization
• Conservative Parallel Simulation of a Large Number of Processes
• Variance reduction algorithms for parallel replicated simulation of uniformized Markov chains

Cited in

(5)

• scientific article; zbMATH DE number 714461 (Why is no real title available?)
• Variance reduction algorithms for parallel replicated simulation of uniformized Markov chains
• Virtual time III. I: Unified virtual time synchronization for parallel discrete event simulation
• Virtual time III. II: Combining conservative and optimistic synchronization
• Parallel simulation today

This page was built for publication: Optimistic parallel simulation of continuous time Markov chains using uniformization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309209)