A time-division algorithm for parallel simulation

Most parallel simulation algorithms (e.g., Chandy and Misra’s algorithm or the Time Warp algorithm) are based on a “space-division” approach. The parallelism of this approach is limited by the causality constraints. Another approach, the “time-division” approach, may provide more parallelism if the time domain is appropriately partitioned. We present a time-division parallel simulation algorithm that partitions the time domain via state matching, We show that linear speed up can be achieved. For a complex system, the best parallel simulation approach is to integrate “time-division” and “space-division” algorithms: the simulated system is partitioned into several subsystems; a subsystem may be simulated by the time-division approach (e. g., our algorithm), while the overall system is simulated by the space-division approach.

[1]  Philip Heidelberger,et al.  Analysis of parallel replicated simulations under a completion time constraint , 1991, TOMC.

[2]  Edward D. Lazowska,et al.  Conservative parallel discrete event simulation: principles and practice , 1989 .

[3]  Philip Heidelberger,et al.  Discrete event simulations and parallel processing: statistical properties , 1988 .

[4]  Philip Heidelberger.  Statistical analysis of parallel simulations , 1986, WSC '86.

[5]  Philip Heidelberger,et al.  Parallel trace-driven cache simulation by time partitioning , 1990, 1990 Winter Simulation Conference Proceedings.

[6]  David R. Jefferson,et al.  Virtual time , 1985, ICPP.

[7]  David M. Nicol,et al.  The cost of conservative synchronization in parallel discrete event simulations , 1993, JACM.

[8]  K. Mani Chandy,et al.  Distributed Simulation: A Case Study in Design and Verification of Distributed Programs , 1979, IEEE Transactions on Software Engineering.

[9]  Philip Heidelberger,et al.  Analysis of initial transient deletion for replicated steady-state simulations , 1991, Oper. Res. Lett..

[10]  Edward D. Lazowska,et al.  Parallel simulation of queueing networks: limitations and potentials , 1989, SIGMETRICS '89.

[11]  Albert G. Greenberg,et al.  Unboundedly parallel simulations via recurrence relations , 1990, SIGMETRICS '90.

[12]  A. A. Crane,et al.  An introduction to the regenerative method for simulation analysis , 1977 .

[13]  Donald L. Iglehart,et al.  Regenerative Simulation of Response Times in Networks of Queues , 1980, J. ACM.

[14]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[15]  Fred J. Kaudel,et al.  A literature survey on distributed discrete event simulation , 1987, SIML.

[16]  Y.-B. Lin,et al.  Exploiting Lookahead in Parallel Simulation , 1990, IEEE Trans. Parallel Distributed Syst..