parallel algorithms for simulating continuous time markov chains
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. Touchstone Delta multiprocessor, using up to 256 processors.
parallel algorithm continuation timing synchronization parallel simulation paper review method functional use optimality aggregate communication management adapt multiprocessor processor