Abstract
An efficient method for use in the discrete-event distributed simulation of large systems is presented. A conservative distributed simulation as well as the mapping of several simulated processes onto the same processor is assumed. The method consits of two algorithms: an algorithm for computing the lower bounds on times of future events, and a distributed algorithm that resolves deadlocks. The performance of the method is demonstrated by comparing it to the Chandy-Misra-Bryant simulation and by presenting some experimental results.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
