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

Authors:
Tiziano Santoro;Francesco Quaglia
Affiliations:
DIS, Sapienza Università di Roma, Italy;DIS, Sapienza Università di Roma, Italy
Venue:
ISCC '10 Proceedings of the The IEEE symposium on Computers and Communications
Year:
2010

Citing 0
Cited 3

The ROme OpTimistic Simulator: core internals and programming model

Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques
Cache-aware memory manager for optimistic simulations

Proceedings of the 5th International ICST Conference on Simulation Tools and Techniques
Event pool structures for PDES on many-core Beowulf clusters

Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation

Quantified Score

Hi-index	0.00

Visualization

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.