By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
E. Deelman ; Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA ; B. K. Szymanski

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

Published in:

Parallel and Distributed Simulation, 1998. PADS 98. Proceedings. Twelfth Workshop on

Date of Conference:

26-29 May 1998