Parallel Discrete Event Simulation Using Shared Memory
IEEE Transactions on Software Engineering
Common features of simulation based scheduling
WSC '91 Proceedings of the 23rd conference on Winter simulation
Parallel discrete event simulation: a case study
ANSS '85 Proceedings of the 18th annual symposium on Simulation
Analysis of future event set algorithms for discrete event simulation
Communications of the ACM
A two-list synchronization procedure for discrete event simulation
Communications of the ACM
A data structure for manipulating priority queues
Communications of the ACM
Event manipulation for discrete simulations requiring large numbers of events
Communications of the ACM
An efficient data structure for the simulation event set
Communications of the ACM
Heaps applied to event driven mechanisms
Communications of the ACM
The design of a multi-microprocessor based simulation computer - I
ANSS '82 Proceedings of the 15th annual symposium on Simulation
The design of a multi-microprocessor based simulation computer - II
ANSS '83 Proceedings of the 16th annual symposium on Simulation
Event list management - a tutorial
WSC '83 Proceedings of the 15th conference on Winter Simulation - Volume 2
A Two-list method for synchronization of event driven simulation
ANSS '81 Proceedings of the 14th annual symposium on Simulation
The simulation of a pipelined event set processor
WSC '81 Proceedings of the 13th conference on Winter simulation - Volume 2
Adaptation of the TL event list algorithm to the GASP IV simulation language
WSC '81 Proceedings of the 13th conference on Winter simulation - Volume 2
A taxonomy and analysis of event set management algorithms for discrete event simulation
ANSS '79 Proceedings of the 12th annual symposium on Simulation
Simulation modeling of the criminal justice system and process
WSC '77 Proceedings of the 9th conference on Winter simulation - Volume 1
The development of the General Purpose Simulation System (GPSS)
ACM SIGPLAN Notices - Special issue: History of programming languages conference
Information systems approach to discrete event simulation
ANSS '80 Proceedings of the 13th annual symposium on Simulation
The design of a multi-microprocessor based simulation computer - III
ANSS '84 Proceedings of the 17th annual symposium on Simulation
The priority queue as an example of hardware/software codesign
CODES '94 Proceedings of the 3rd international workshop on Hardware/software co-design
An empirical comparison of advanced event file synchronization structures
WSC '82 Proceedings of the 14th conference on Winter Simulation - Volume 1
A comparison of clock pulse and event algorithms for simulation of traffic flow
ACM SIGSIM Simulation Digest
The development of the General Purpose Simulation System (GPSS)
History of programming languages I
Analysis of free-storage algorithms: revisited
IBM Systems Journal
| Hi-index | 48.31 |
Simulation models of large, complex “real-world” applications have occasionally earned the reputation of eating up hours of computer time. This problem may be attributed in part to difficulties such as slow stochastic convergence. However, an additional problem lies in the fact that a significant amount of bookkeeping time is required to keep future events in their proper sequence. This paper presents a method for significantly reducing the time spent scanning future events lists in discrete event simulations. Three models are presented, all of which improve in effectiveness as the events-list scan problem becomes more burdensome.