Abstract
Efficient modeling of delay conditions is a critical requirement of modern discrete-event simulation software. In this article four forms of delay are discussed: time-based, state-based, compound combinations of time-based and state-based, and user-managed. Most of the algorithms described are those used by the SLX simulation language. An informal survey of SLX users provides many examples of the demands placed on delay mechanisms and the resultant performance of the SLX models.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brown, R. 1988. Calendar queues: a fast O(1) priority queue implementation for the simulation event set problem. Communications of the ACM 31(10):1220–1227.
Chung, K., J. Sang, and V. Rego. 1993. A performance comparison of event calendar algorithms: an empirical approach. Software, Practice & Experience 23(10):1107–1138.
Crain, R. C., and D. T. Brunner. 1990. Modeling efficiently with GPSS/H. In Proceedings of the 1990 Winter Simulation Conference, eds. O. Balci, R. Sadowski, and R. Nance, pp. 89–93. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers.
Franta, W. R., and K. Maly. 1978. A comparison of heaps and the TL structure for simulation event set. Communications of the ACM 21(10):873–875.
Henriksen, J. O. 1977. An improved event list algorithm. In Proceedings of the 1977 Winter Simulation Conference, eds. H. J. Highland, R. G. Sargent, and J. W. Schmidt, pp. 547-557. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers.
Henriksen, J. O. 1981. GPSS—Finding the appropriate world-view. In Proceedings of the 1981 Winter Simulation Conference, eds. T. Ören, C. Delfosse, and C. Shub, pp. 505–516. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers.
Henriksen, J. O. 2000. SLX: the X is for extensibility. In Proceedings of the 2000 Winter Simulation Conference, eds. R. R. Barton, J. A. Joines, P. A. Fishwick, and K. Kang, pp. 183–190. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers. Available online as www.informs-sim.org/wsc00papers/027.PDF [accessed February 6, 2008].
Kingston, J. 1984. Analysis of algorithms for the simulation event list. Ph.D. diss., Department of Computer Science, University of Sydney.
Kiviat, P. J., R. Villanueva, and H. M. Markowitz. 1973. The SIMSCRIPT II.5 programming language. Los Angeles: Consolidated Analysis Centers, Inc.
Knuth, D. E., and J. L. McNeley. 1964a. SOL—A symbolic language for general-purpose systems simulation. IEEE Transactions on Electronic Computers EC-13(4):401–408.
Knuth, D. E., and J. L. McNeley. 1964b. A formal definition of SOL. IEEE Transactions on Electronic Computers EC-13(4):409–414.
McCormack, W. M. 1979. Analysis of future event set algorithms for discrete event simulation. Ph.D. diss., Syracuse University.
McCormack, W. M., and R. G. Sargent. 1981. Analysis of future event set algorithms for discrete event simulation. Communications of the ACM 24(12):801–812.
Oh, S., and J. Ahn. 1999. Dynamic calendar queue. In Proceedings of the 32nd Annual Simulation Symposium, pp. 20–25. Washington, DC: IEEE Computer Society.
Rönngren, R., and R. Ayani. 1997. Lazy queue: an efficient implementation of the pending event set. In Proceedings of the 24th Annual Simulation Symposium, pp. 194–204. Los Alamitos, CA: IEEE Computer Society Press.
Schriber, T. J. 1990. An Introduction to Simulation using GPSS/H. New York: Wiley.
Ståhl, I. 1998. The efficient implementation of wait statements. In Proceedings of the 1998 Winter Simulation Conference, eds. D. J. Medeiros, E. F. Watson, J. S. Carson, and M. S. Manivannan, pp. 523–530. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers. Available online as www.informs-sim.org/wsc98papers/070.PDF [accessed February 8, 2009].
Tan, K. L., and L.-J. Thng. 2000. SNOOPy calendar queue. In Proceedings of the 2000 Winter Simulation Conference, eds. R. R. Barton, J. A. Joines, P. A. Fishwick, and K. Kang, pp. 487–495. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers. Available online as www.informs-sim.org/wsc00papers/068.PDF [accessed February 8, 2009].
Vaucher, J. G. 1973. A “wait until” algorithm for general purpose simulation languages. In Proceedings of the 1973 Winter Simulation Conference, eds. A. C. Hoggatt and J. Sussman, pp. 77–83. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers.
Vaucher, J. G., and P. Duval. 1975. A comparison of simulation event list algorithms. Communications of the ACM 18(4):223–230.
Acknowledgements
I thank Dr. Donald Knuth for kindly sharing design notes from SOL.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag US
About this chapter
Cite this chapter
Henriksen, J.O. (2009). Efficient Modeling of Delays in Discrete-Event Simulation. In: Alexopoulos, C., Goldsman, D., Wilson, J. (eds) Advancing the Frontiers of Simulation. International Series in Operations Research & Management Science, vol 133. Springer, Boston, MA. https://doi.org/10.1007/b110059_6
Download citation
DOI: https://doi.org/10.1007/b110059_6
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-0816-2
Online ISBN: 978-1-4419-0817-9
eBook Packages: Business and EconomicsBusiness and Management (R0)