Service oriented scheduling in time warp

In Time Warp discrete event simulations the performance depends on the scheduling of the logical processes. Proper scheduling can drastically reduce the overheads associated with the optimistic execution approach. In some simulations the logical processes can predict the time stamps of outgoing messages resulting from the execution of future events. In this paper a scheduling method exploiting this information is presented. Experimental results show that the proposed method reduces the rollback and memory overheads and improves the performance of the simulation.