A low-overhead constant-time LTF scheduler for optimistic simulation systems

We present an implementation of the Lowest- Timestamp-First (LTF) algorithm for the identification of the next Logical Process (LP) to be dispatched in context where the optimistic simulation kernel conforms the best-practice of keeping separate event lists for the hosted LPs. The implementation provides low-overhead, constant-time dispatching. We release our implementation within the open source ROOT-Sim optimistic simulation platform. Experimental data are also reported supporting the effectiveness of our proposal.