About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
IEEE TPDS
Paper
Conservative Parallel Simulation Of Continuous Time Markov Chains Using Uniformization
Abstract
This paper describes parallel algorithms for simulating certain continuous time Markov Chains such as those arising in queueing network models of distributed computing systems, or communications systems. The algorithms are based on the technique of uniformization. Two variations of a conservative parallel simulation algorithm are presented. In each algorithm, a relatively short “presimulation” is performed to identify those times, and only those times, at which the simulation algorithm requires processor pairs to synchronize. Speedup studies of the algorithms, performed on a 16 node Intel iPSC/2 hypercube, are presented and discussed. © 1993 IEEE