Load balancing in individual-based spatial applications (1998) [3 citations — 2 self]
Abstract:
Individual-based spatial simulations are a class of applications in which a collection of entities interact locally with one another within a simulated space to generate some global collective behavior. An Eulerian implementation of such a system partitions the simulated space and assigns each partition, together with the corresponding entities, to a different physical node. Load balancing is achieved by dynamically adjusting the decomposition of the simulated space, which forces the corresponding autonomous entities to automatically migrate among physical nodes. This paper presents three load balancing algorithms suitable for such applications. Their primary advantages are (1) full integration into the application, which permits load balancing to be performed without suspending the application and without any additional messages, and (2) use of only near-neighbor communication, which facilitates scalability.
Citations
| 43 | Load Balancing on Message Passing Architectures – Hanxleden, Scott - 1991 |
| 30 | Parallelizing molecular dynamics using spatial decomposition – Clark, Hanxleden, et al. - 1994 |
| 20 | Messages versus messengers in distributed programming – Fukuda, Bic, et al. - 1997 |
| 18 | Distributed coordination with messengers – Fukuda, Bic, et al. - 1998 |
| 17 | The Simulation of the Movement of Fish Schools – Huth, Wissel - 1992 |
| 9 | Domain decomposition in distributed and shared memory environments – Fox - 1987 |
| 9 | A run-time load balancing strategy for highly parallel systems – Hinz - 1990 |
| 4 | Run-time Partitioning of Scientific Continuum Calculations Running on Multiprocessors – Baden - 1987 |
| 3 | Using parallel computers to simulate individual-oriented models in ecology: A case study – Lorek, Sonnenschein - 1995 |
| 1 | Load Balancing in Spatial Individual-based Systems using Autonomous Objects – Merchant - 1998 |
