An Efficient Data Structure for the Simulation Event Set

Communications of the ACM

Volumn 20, Issue 8, 1977, Pages 596-602

  Franta, W R ^a   Maly, Kurt ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

event scanning mechanisms; multilinked lists; simulation; time flow mechanisms

Indexed keywords

COMPUTER PROGRAMMING - SUBROUTINES; SCHEDULING;

DATA PROCESSING;

EID: 0017526865     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/359763.359801     Document Type: Article

References (5)

1. Aho, A., Hopcroft, T.E., and Ullman, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
2. Franta, W.R., and Maly, K. An event scanning algorithm of nearly constant complexity. Tech. Rep. 75-18, Univ. of Minnesota, Minneapolis, Minn. Nov. 1975.
3. Jensen, K., and Wirth, W. Pascal user manual and report. Lecture Notes in Computer Science, Vol. 18, Springer-Verlag, 1974.
4. Vaucher, J.G., Duval, P. A comparison of simulation event list algorithms. Comm. ACM 18, 4 (April 1975), 223-230.
5. Wyman, F.P. Improved event-scanning mechanisms for discrete event simulation. Comm. ACM 18, 6 (June 1975), 350-353.