论文信息 - A comparison of heaps and the TL structure for the simulation event set

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

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:

Kurt Maly | William R. Franta | K. Maly | W. Franta

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

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

[3] William R. Franta,et al. The process view of simulation , 1977 .

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

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

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

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