Event manipulation for discrete simulations requiring large numbers of events
- 1 September 1978
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 21 (9), 777-785
- https://doi.org/10.1145/359588.359611
Abstract
The event-manipulation system presented here consists of two major parts. The first part addresses the familiar problem of event scheduling efficiency when the number of scheduled events grows large. The second part deals with the less apparent problem of providing efficiency and flexibility as scheduled events are accessed to be executed. Additional features and problems dealt with include the proper handling of simultaneous events; that certain events must be created, scheduled, and executed at the same points in simulated time; that infinite loops caused by the concatenation of such “zero-time” events are possible and must be diagnosed; that maintaining various event counts is practical and economical; and that a capability for handling “time-displaceable” events is desirable and possible.Keywords
This publication has 8 references indexed in Scilit:
- An efficient data structure for the simulation event setCommunications of the ACM, 1977
- Non-integral event timing for digital logic simulationPublished by Association for Computing Machinery (ACM) ,1976
- Improved event-scanning mechanisms for discrete event simulationCommunications of the ACM, 1975
- A comparison of simulation event list algorithmsCommunications of the ACM, 1975
- Time flow mechanisms for use in digital logic simulationPublished by Association for Computing Machinery (ACM) ,1971
- On simulating networks of parallel processes in which simultaneous events may occurCommunications of the ACM, 1969
- Exclusive simulation of activity in digital networksCommunications of the ACM, 1969
- Serial/parallel event scheduling for the simulation of large systemsPublished by Association for Computing Machinery (ACM) ,1968