An Efficient Data Structure for the Simulation Event Set Recently algorithms have been presented for the realization of event scheduling routines suitable for general purpose discrete event simulation systems. Several exhibited a performance superior to that of commonly used simple linked list algorithms. In this paper a new event scheduling algorithm is presented which improves on two aspects of the best of the previously published algorithms. First, the new algorithm's performance is quite insensitive to skewed distributions, and second, its worst-case complexity is O( n), where n is the number of events in the set. Furthermore, tests conducted to estimate the average complexity showed it to be nearly independent of n. CACM August, 1977 Franta, W. R. Maly, K. simulation, time flow mechanisms, event scanning mechanisms, multilinked lists 3.34 4.22 5.5 8.1 CA770807 JB December 28, 1977 7:15 AM 2844 4 2936 2844 4 2936 2936 4 2936 2936 4 2936 3051 4 2936 3064 4 2936 3064 4 2936 3109 4 2936 2742 5 2936 2767 5 2936 2936 5 2936 2936 5 2936 2936 5 2936 3064 5 2936 1846 6 2936 1939 6 2936 2742 6 2936 2767 6 2936 2936 6 2936