Search, Space, and Time
Every execution of a computer program uses memory space and consumes computing time. In particular, a discrete-event simulation expends a considerable proportion of its running time executing searches for new space and creating and maintaining order among the myriad of entity records and event notices it generates as simulated time evolves. In spite of their relative importance, current PC workstation environments, with their substantial memories and reduced, if nonexistent, emphasis on execution within a specified computing time constraint, make these topics appear less important to the simulationist than they were in the past. Moreover, every simulation programming language implicitly provides a means for managing space and performing searches during execution of virtually any program written in the language, further removing these issues from a simulationist’s consciousness.
KeywordsComputing Time Event Notice Memory Space Interarrival Time Average Selection Time
Unable to display preview. Download preview PDF.
- Arguelles, M.C., and G.S. Fishman (1997). Reducing the frequency of future event set search in manufacturing simulation, Operations Research Department, University of North Carolina at Chapel Hill, in preparation.Google Scholar
- Evans, J.B. (1988). Structure of Discrete Event Simulation, Ellis Horwood Limited, Chichester, England.Google Scholar
- Henriksen, J.O. (1977). An improved events list algorithm, Proceedings of the 1977 Winter Simulation Conference, H.J. Highland, R.G. Sargent, and J.W. Schmidt, editors, 547557.Google Scholar
- Henriksen, J.O. (1983). Event list management, a tutorial, Proc. Winter Simulation Conference, IEEE and SCS, Piscataway, N.J., 543–551.Google Scholar
- Henriksen, J.O. (1994). Personal communication.Google Scholar
- Kingston, J.H. (1986b). The amortized complexity of Henriksen’s algorithm, Bit, 26, 156163.Google Scholar
- Knuth, D. (1973). The Art of Computer Programming: Sorting and Searching, Addison-Wesley, Reading, MA.Google Scholar
- Williams, J.W.J. (1964). “Algorithm 232,” Comm. ACM, 7, 347–348.Google Scholar