Get access

Distributed re-arrangement scheme for balancing computational load and minimizing communication delays in HLA-based simulations

Authors

  • Robson Eduardo De Grande,

    Corresponding author
    • PARADISE Research Laboratory -School of Information and Technology Engineering, University of Ottawa, Ottawa, Canada
    Search for more papers by this author
  • Azzedine Boukerche,

    1. PARADISE Research Laboratory -School of Information and Technology Engineering, University of Ottawa, Ottawa, Canada
    2. College of Computer and Information Sciences, King Saud University, Riyadh, Saudi Arabia
    Search for more papers by this author
  • Hussam Ramadan

    1. College of Computer and Information Sciences, King Saud University, Riyadh, Saudi Arabia
    Search for more papers by this author

Correspondence to: Robson Eduardo De Grande, School of Information and Technology Engineering - University of Ottawa - Ottawa, Canada.

E-mail: rdgrande@site.uottawa.ca

SUMMARY

Because of the availability of shared resources, substantial efforts have been applied to the development of large-scale distributed simulations, and performance has become an essential aspect that can be impaired by heterogeneity and availability of resources, dynamic, unpredictable load imbalances, and communication delays. In order to manage and keep such distributed simulations consistent, the high level architecture (HLA) standard has been designed; however, it does not provide any solution that directly solves simulation performance issues. Many balancing approaches have been proposed in order to offer a suboptimal balancing solution, but they are limited to certain simulation aspects, are specific to determined applications, or are unaware of the HLA-based simulation characteristics. In light of considering both computational and communication aspects for HLA-based simulations, a centralized hierarchical balancing scheme was proposed. This scheme presents several drawbacks that make it susceptible to bottlenecks, overheads, global synchronization, and single point of failure. Therefore, a scheme based on a distributed algorithm to re-arrange the computational and communication load is proposed. Experiments have been performed to evaluate the effectiveness of the distributed scheme when compared with the scheme based on a centralized redistribution algorithm. The results showed that the distributed balancing technique could provide similar performance gain or even improve it for some specific cases. Copyright © 2011 John Wiley & Sons, Ltd.

Get access to the full text of this article

Ancillary