A comparison of heaps and the TL structure for the simulation event set

ABSTRACT

Following publication of our paper [2], questions arose with respect to the superiority of the TL structure over heaps,1 particularly in the face of the remarks of Gonnet [3], concerning the use of heaps for the physical realization of the simulation event set. Gonnet's communication was in response to the Vaucher and Duval paper [5], and suggested the heap to be a more efficient structure than any proposed in [5]. As regards a comparison of heaps and the TL structure we can make the following remarks:

REFERENCES

• 1: W. R Franta, The process view of simulation (Operating and programming systems series), North-Holland, 1977
• 2: W. R. Franta , Kurt Maly, An efficient data structure for the simulation event set, Communications of the ACM, v.20 n.8, p.596-602, Aug. 1977 [doi>10.1145/359763.359801]
• 3: Gaston H. Gonnet, Heaps applied to event driven mechanisms, Communications of the ACM, v.19 n.7, p.417-418, July 1976 [doi>10.1145/360248.360261]
• 4: Jonassen, A., and Dahl, O.-J. Analysis of an algorithm for priority queue administration. BIT 15 (1975), 409-422.
• 5: Jean G. Vaucher , Pierre Duval, A comparison of simulation event list algorithms, Communications of the ACM, v.18 n.4, p.223-230, April 1975 [doi>10.1145/360715.360758]
• 6: Vaucher, J.G. On the distribution o f event times for the notices in a simulation event list. INFOR 15, 2 (June 1977), 171-182.

INDEX TERMS

Primary Classification:
  E. Data

Additional Classification:
  I. Computing Methodologies
  I.6 SIMULATION AND MODELING

General Terms:
Design, Performance, Theory

Keywords:
TL structure, event set, heaps, simulation