TY - GEN
T1 - Parallel algorithms for simulating continuous time Markov chains
AU - Nicol, David M.
AU - Heidelberger, Philip
PY - 1993
Y1 - 1993
N2 - We have previously shown that the mathematical technique of uniformization can serve as the basis of synchronization for the parallel simulation of continuous-time Markov chains. This paper reviews the basic method and compares four different methods based on uniformization, evaluating their strengths and weaknesses as a function of problem characteristics. The methods vary in their use of optimism, logical aggregation, communication management, and adaptivity. Performance evaluation is conducted on the Intel Touchstone Delta multiprocessor, using up to 256 processors.
AB - We have previously shown that the mathematical technique of uniformization can serve as the basis of synchronization for the parallel simulation of continuous-time Markov chains. This paper reviews the basic method and compares four different methods based on uniformization, evaluating their strengths and weaknesses as a function of problem characteristics. The methods vary in their use of optimism, logical aggregation, communication management, and adaptivity. Performance evaluation is conducted on the Intel Touchstone Delta multiprocessor, using up to 256 processors.
UR - http://www.scopus.com/inward/record.url?scp=0027870161&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0027870161&partnerID=8YFLogxK
U2 - 10.1145/158459.158461
DO - 10.1145/158459.158461
M3 - Conference contribution
AN - SCOPUS:0027870161
SN - 1565550552
SN - 9781565550551
T3 - Proc 7 Workshop Parallel Distrib Simul
SP - 11
EP - 18
BT - Proc 7 Workshop Parallel Distrib Simul
PB - Publ by ACM
T2 - Proceedings of the 7th Workshop on Parallel and Distributed Simulation
Y2 - 16 May 1993 through 19 May 1993
ER -