Event scheduling in window based parallel simulation schemes

The authors study the impact of load balancing on the performance of a window-based parallel simulation scheme. They show the impact of four scheduling policies: static, dynamic, majority, and longest window. For simple simulation problems where there are a few events and the events need fairly short computation, i.e., small event granularity, the first three policies perform fairly close to each other. However, for large simulation problems where millions of events exist and the event granularity is large, majority scheduling is a better choice. For instance, if each event requires 18.3 ms processing time, majority scheduling performs 38.5% better than dynamic scheduling and 43.6% better than static scheduling.<>