Analysis of future event set algorithms for discrete event simulation

New analytical and empirical results for the performance of future event set algorithms in discrete event simulation are presented. These results provide a clear insight to the factors affecting algorithm performance, permit evaluation of the hold model, and determine the best algorithm(s) to use. The analytical results include a classification of distributions for efficient insertion scanning of a linear structure. In addition, it is shown that when more than one distribution is present, there is generally an increase in the probability that new insertions will have smaller times than those in the future event set. Twelve algorithms, including most of those recently proposed, were empirically evaluated using primarily simulation models. Of the twelve tested, four performed well, three performed fairly, and five performed poorly.

[1]  Gaston H. Gonnet,et al.  Heaps applied to event driven mechanisms , 1976, CACM.

[2]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[3]  F. Paul Wyman,et al.  Improved event-scanning mechanisms for discrete event simulation , 1975, Commun. ACM.

[4]  Thomas Porter,et al.  Random insertion into a priority queue structure , 1974, IEEE Transactions on Software Engineering.

[5]  Anthony Marsland,et al.  Detection Of Deadlocks In Distributed Database Systems , 1980 .

[6]  Forrest Paul Wyman.  Simulation modeling : a guide to using SIMSCRIPT , 1970 .

[7]  Kurt Maly,et al.  A comparison of heaps and the TL structure for the simulation event set , 1978, CACM.

[8]  William L. Maxwell,et al.  Analysis of the Time Indexed List Procedure for Synchronization of Discrete Event Simulations , 1978 .

[9]  James R. Emshoff,et al.  Design and use of computer simulation models , 1970 .

[10]  Thomas J. Schriber,et al.  Simulation Using GPSS , 1974 .

[11]  Marvin Zelen,et al.  Mathematical Theory of Reliability , 1965 .

[12]  Jean G. Vaucher,et al.  A comparison of simulation event list algorithms , 1975, Commun. ACM.

[13]  A. Law.  Statistical Analysis of the Output Data from Terminating Simulations. , 1980 .

[14]  Ernst G. Ulrich.  Event manipulation for discrete simulations requiring large numbers of events , 1978, CACM.

[15]  George S. Fishman,et al.  Solution of Large Networks by Matrix Methods , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[16]  Benjamin Avi-Itzhak,et al.  A Time-Sharing Queue with a Finite Number of Customers , 1969, JACM.

[17]  William M. McCormack,et al.  COMPARISON OF FUTURE EVENT SET ALGORITHMS FOR SIMULATIONS OF CLOSED QUEUEING SYSTEMS , 1979 .

[18]  John Craig Comfort.  A taxonomy and analysis of event set management algorithms for discrete event simulation , 1979 .

[19]  D. Davey,et al.  Self-Optimizing Partitioned Sequencing Sets For Discrete Event Simulation , 1980 .

[20]  A. Alan B. Pritsker.  Ongoing developments in GASP , 1976, WSC '76.

[21]  Richard E. Barlow,et al.  Statistical Theory of Reliability and Life Testing: Probability Models , 1976 .

[22]  G SargentRobert,et al.  Analysis of future event set algorithms for discrete event simulation , 1981 .

[23]  James O. Henriksen.  An improved events list algorithm , 1977, WSC '77.

[24]  Jean G. Vaucher.  On the Distribution of Event Times for the notices in a Simulation Event List , 1977 .

[25]  Ole-Johan Dahl,et al.  Analysis of an algorithm for priority queue administration , 1975 .

[26]  Charles Gilbert Moore,et al.  Network models for large-scale time-sharing systems , 1971 .

[27]  Henry Kleine,et al.  A survey of users' views of discrete simulation languages , 1970 .

[28]  Brian W. Unger,et al.  The process view of simulation in Ada , 1982, WSC.

[29]  Kurt Maly,et al.  An efficient data structure for the simulation event set , 1977, CACM.

[30]  W. R Franta,et al.  The process view of simulation (Operating and programming systems series) , 1977 .

[31]  A. Alan B. Pritsker,et al.  Gasp iv simulation language , 1974 .