Dynamic load balancing in parallel discrete event simulation for spatially explicit problems

We present a dynamic load balancing algorithm for parallel discrete event simulation of spatially explicit problems. In our simulations, the space is discretized and divided into subareas, each of which is simulated by a logical process (LP). Load predictions are done based on the future events that are scheduled for a given LP. The information about the load of the processes is gathered and distributed during the Global Virtual Time calculation. Each LP calculates the new load distribution of the system. The load is then balanced by moving spatial data between neighboring LPs in one round of communications. In our problems, the LPs should be described as being elements of a ring from the point of view of communication. Due to the spatial characteristics, the load can be migrated only between neighboring LPs. We present an algorithm that performs the load balancing in a ring and minimizes the maximum after-balance load