Distributed re‐arrangement scheme for balancing computational load and minimizing communication delays in HLA‐based simulations. (28th July 2011)

• Record Type: Journal Article
• Authors: Grande, Robson Eduardo De; Boukerche, Azzedine; Ramadan, Hussam; Fouchal, Hacène; Notare, Mirela Sechi Moretti Annoni
• Is Part Of: Concurrency and computation. Volume 25:Number 5(2013:Apr.)
• Page Start: 626
• Page End: 648
• Publication Date: 2011-07-28
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.1807
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main" id="cpe1807-abs-0001"> <title>SUMMARY</title> <p id="cpe1807-para-0001">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.</p> </abstract>