The choice of a particular event-list implementation can dramatically improve or reduce performance of a discrete event simulation (DES). For more than 40 years, several data structures had been proposed to address this problem. We present new empirical results using the parallel discrete event system specification (PDEVS) formalism and a DEVStone benchmark. Similar analyzes were previously conducted, the last one being published in 2007. This paper includes most recent proposals, particularly the LadderQueue [19], evaluated using the DEVS-Ruby simulator.
['Romain Franceschini', 'Paul-Antoine Bisgambiglia', 'Paul Antoine Bisgambiglia']
A comparative study of pending event set implementations for PDEVS simulation