Non-preemptive time warp scheduling algorithms

This paper presents results of experiments we conducted on a number of scheduling algorithms used in a multi-processing Time Warp system. Our results show that system performance can be improved by using indirect indicators of Time Warp progress without going to the expense of user specified scheduling or relying on dependency graphs. Our best algorithm is based on a composite measure of simulation advance rate, flow control, and the appearance of specific message types.