This Article 
 Bibliographic References 
 Add to: 
Parallel Discrete Event Simulation Using Shared Memory
April 1988 (vol. 14 no. 4)
pp. 541-553

With traditional event list techniques, evaluating a detailed discrete event simulation model can often require hours or even days of computation time. By eliminating the event list and maintaining only sufficient synchronization to ensure causality, parallel simulation can potentially provide speedups that are linear in the number of processors. We present a set of shared memory experiments using the Chandy-Misra distributed simulation algorithm to simulate networks of queues. Parameters of the study include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors.

[1] J. P. Buzen, "Computational algorithms for closed queueing networks with exponential servers,"Commun. ACM, vol. 16, no. 9, Sept. 1973.
[2] K. M. Chandy, V. Holmes, and J. Misra, "Distributed simulation of networks,"Comput. Networks, vol. 3, no. 1, pp. 105-113, Feb. 1979.
[3] K. M. Chandy and J. Misra, "Distributed simulation: A case study in design and verification of distributed programs,"IEEE Trans. Software Eng., vol. SE-5, no. 5, pp. 440-452, Sept. 1979.
[4] K.M. Chandy and J. Misra, "Asynchronous Distributed Simulation via a Sequence of Parallel Computations,"Comm. ACM, Vol. 24, No. 4, Apr. 1981, pp. 198-206.
[5] K. M. Chandy, J. Misra, and L. M. Haas, "Distributed deadlock detection,"ACM Trans. Comput. Syst., vol. 1, no. 2, pp. 144-156, May 1983.
[6] A. Chandak and J. C. Browne, "Vectorization of discrete event simulation," inProc. 1983 Int. Conf. Parallel Processing, Aug. 1983, pp. 359-361.
[7] W. W. Chuetal., "Task allocation in distributed data processing," Computer, vol. 13, no. 11, pp. 57-69, Nov. 1980.
[8] J. C. Comfort, "The design of a multi-microprocessor based simulation computer-I," inProc. Fifteenth Annu. Simulation Symp., Mar. 1982, pp. 45-53.
[9] J. C. Comfort, "The simulation of a master-slave event set processor,"Simulation, vol. 42, pp. 117-124.
[10] R. A. Finkel,An Operating Sysrems Vade Mecum. Englewood Cliffs, NJ: Prentice-Hall, 1986.
[11] M. A. Franklin, D. F. Wann, and K. F. Wong, "Parallel machines and algorithms for discrete-event simulation," inProc.1984 Int.Conf. Parallel Processing, Aug. 1984, pp. 449-458.
[12] D. Franta and W. Maly, "An efficient data structure for the simulation event set," Commun. ACM, vol. 20, no. 8, pp. 596-602, Aug. 1977.
[13] R. M. Fujimoto, "Performance measurements of distributed simulation strategies," inDistributed Simulation, 1988, Proc. SCS Multiconf. Distributed Simulation, Feb. 3-5, 1988, pp. 14-20.
[14] P. Heidelberger, "Statistical analysis of parallel simulations," inProc. 1986 Winter Simulation Conf., to be published.
[15] D. Jefferson and H. Sowizral, "Fast concurrent simulation using the time warp mechanism," inDistributed Simulation 1985, The 1985 Society for Computer Simulation Multiconf., San Diego, CA.
[16] M. B. Konsek, D. A. Reed, and W. Watcharawittayakul, "Context switching with multiple register windows: A RISC performance study," in preparation.
[17] D. A. Patterson and C. H. Sequin, "A VLSI RISC,"Computer, vol.15, no. 9, pp. 8-21, Sept. 1982.
[18] D. A. Patterson, "Reduced instruction set computers,"Commun. ACM, vol. 28, pp. 8-21, Jan. 1985.
[19] J. K. Peacock, J. W. Wong, and E. G. Manning, "Distributed simulation using a network of processors,"Comput. Nerworks, vol. 3, no. 1, pp. 44-56, Feb. 1979.
[20] G. F. Pfister, "The Yorktown Simulation Engine," inProc. 19th DAC, 1982, pp. 31-54.
[21] D. A. Reed, "A simulation study of multimicrocomputer networks," inProc. 1983 Int. Conf. Parallel Processing, Aug. 1983, pp. 161- 163.
[22] D. A. Reed, "Parallel discrete event simulation: A case study" (Invited Paper),Rec. Proc. 19th Annu. Simulation Symp., Mar. 1985, pp. 95- 107.
[23] D. A. Reed and R. M. Fujimoto,Multicomputer Networks, Message-Based Parallel Processing. Cambridge, MA: MIT Press, 1987.
[24] C. H. Sauer, E. A. MacNair, and S. Salza, "A language for extended queueing networks,"IBM J. Res. Develop., vol. 24, no. 6, pp. 747- 755, Nov. 1980.
[25] M. Seethalakshmi, "Performance analysis of distributed simulation," M. S. thesis, Dep. Comput. Sci., Univ. Texas, Austin, 1978.
[26] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 22-33, Jan. 1985.
[27] P. F. Wyman, "Improved event scanning mechanisms for discrete event simulation,"Commun. ACM, vol. 18, no. 4, pp. 221-230, Apr. 1975.

Index Terms:
Chandy-Misra algorithm, deadlock recovery, discrete event simulation, distributed simulation, parallel processing.
D.A. Reed, A.D. Maloney, B.D. McCredie, "Parallel Discrete Event Simulation Using Shared Memory," IEEE Transactions on Software Engineering, vol. 14, no. 4, pp. 541-553, April 1988, doi:10.1109/32.4677
Usage of this product signifies your acceptance of the Terms of Use.