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 ROOTSim optimistic simulation platform. Experimental data are also reported supporting the effectiveness of our proposal. © 2010 IEEE.
A low-overhead constant-time LTF scheduler for optimistic simulation systems / Tiziano, Santoro; Quaglia, Francesco. - (2010), pp. 948-953. (Intervento presentato al convegno 15th IEEE Symposium on Computers and Communications, ISCC 2010 tenutosi a Riccione; Italy nel 22 June 2010 through 25 June 2010) [10.1109/iscc.2010.5546544].
A low-overhead constant-time LTF scheduler for optimistic simulation systems
QUAGLIA, Francesco
2010
Abstract
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 ROOTSim optimistic simulation platform. Experimental data are also reported supporting the effectiveness of our proposal. © 2010 IEEE.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
