Explicit Spatial Scattering for Load Balancing in Conservatively Synchronized Parallel Discrete Event Simulations

  • Authors:
  • Sunil Thulasidasan;Shiva Prasad Kasiviswanathan;Stephan Eidenbenz;Phillip Romero

  • Affiliations:
  • Los Alamos Nat. Lab., Los Alamos, NM, USA;Los Alamos Nat. Lab., Los Alamos, NM, USA;Los Alamos Nat. Lab., Los Alamos, NM, USA;Los Alamos Nat. Lab., Los Alamos, NM, USA

  • Venue:
  • PADS '10 Proceedings of the 2010 IEEE Workshop on Principles of Advanced and Distributed Simulation
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We re-examine the problem of load balancing in conservatively synchronized parallel, discrete- event simulations executed on high-performance computing clusters, focusing on simulations where computational and messaging load tend to be spatially clustered. Such domains are frequently characterized by the presence of geographic "hot-spots'' - regions that generate significantly more simulation events than others. Examples of such domains include simulation of urban regions, transportation networks and networks where interaction between entities is often constrained by physical proximity. Noting that in conservatively synchronized parallel simulations, the speed of execution of the simulation is determined by the slowest ( i.e most heavily loaded) simulation process, we study different partitioning strategies in achieving equitable processor-load distribution in domains with spatially clustered load. In particular, we study the effectiveness of partitioning via spatial scattering to achieve optimal load balance. In this partitioning technique, nearby entities are explicitly assigned to different processors, thereby scattering the load across the cluster. This is motivated by two observations, namely, (i) since load is spatially clustered, spatial scattering should, intuitively, spread the load across the compute cluster, and (ii) in parallel simulations, equitable distribution of CPU load is a greater determinant of execution speed than message passing overhead. Through large-scale simulation experiments - both of abstracted and real simulation models - on high performance clusters, we observe that scatter partitioning - even with its greatly increased messaging overhead - often significantly outperforms more conventional spatial partitioning techniques that seek to reduce messaging overhead. Further, even if hot-spots change over the course of the simulation, if the underlying feature of spatial clustering is retained, load continues to be balanced with spatial scattering leading us to the observation that spatial scattering can often obviate the need for dynamic load balancing.