论文信息 - Heaps applied to event driven mechanisms

Heaps applied to event driven mechanisms

I read with great interest F.P. Wyman's paper “Improved Event-Scanning Mechanisms for Discrete Event Simulation” [10] which, I found, makes a careful study of some techniques for event-list scanning.

Gaston H. Gonnet | G. Gonnet

[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[2] Rick Thomas,et al. A simplified recombination scheme for the Fibonacci buddy system , 1975, CACM.

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

[4] Kenneth C. Knowlton,et al. A fast storage allocator , 1965, CACM.

[5] James A. Hinds. An algorithm for locating adjacent storage blocks in the buddy system , 1975, CACM.

[6] W. Morven Gentleman,et al. Row elimination for solving sparse linear systems and least squares problems , 1976 .

[7] James L. Peterson,et al. A weighted buddy method for dynamic storage allocation , 1974, CACM.

[8] R. Bruce Simpson,et al. Local Versus Global Strategies for Adaptive Quadrature , 1975, TOMS.

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

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

[11] Daniel S. Hirschberg,et al. A class of dynamic memory allocation algorithms , 1973, CACM.

[12] Daniel G. Bobrow,et al. A note on hash linking , 1975, CACM.