Eighth IEEE International Symposium on Distributed Simulation and Real-Time Applications
DOI: 10.1109/ds-rt.2004.27
|View full text |Cite
|
Sign up to set email alerts
|

Load Distribution Services in HLA

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 21 publications
(10 citation statements)
references
References 17 publications
0
10
0
Order By: Relevance
“…[19] employs Grids services to perform monitoring and high-latency federate migration to move load. Tan and Lim [5] presented a load distribution scheme based on time advance calls and on a freeze-free federate migration. The focus of all these schemes regards federate migration, avoiding lost and disordered events and minimizing latency.…”
Section: Related Workmentioning
confidence: 99%
“…[19] employs Grids services to perform monitoring and high-latency federate migration to move load. Tan and Lim [5] presented a load distribution scheme based on time advance calls and on a freeze-free federate migration. The focus of all these schemes regards federate migration, avoiding lost and disordered events and minimizing latency.…”
Section: Related Workmentioning
confidence: 99%
“…Rather, it applies standard features of the HLA supported by open-source RTIs for interoperability in a class of simulations defined by the ISoS structural and behavioral rules. It does not address several important topics discussed by others, such as security issues with distributed simulation [44], filtering communications with data distribution management (DDM) [45], load balancing across hosts [46], rapid evaluation of alternative decisions by cloning federates [47], fault tolerance for federation robustness [47], and automated federate code generation and evaluation [48]. Future work to improve federation performance should evaluate the impact of these and other proposed activities with nominal results of the baseline method introduced here.…”
Section: E Known Limitationsmentioning
confidence: 99%
“…Dynamic load balancing for distributed simulations has received much interest due to its potential ability to enhance performance. Many algorithms [5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22] have been developed to tackle the problem of distributed simulations running on different workstations, clusters and the grid. The authors in [5] propose an algorithm that uses two central metrics: The processor advance time (PAT) and the cluster (of LPs) advance time (CAT) which are the amount of wall clock time required by a processor and a cluster respectively to advance one unit of simulated time in the absence of rollback.…”
Section: Related Workmentioning
confidence: 99%
“…The centralized approach makes use of a central processor to collect and disseminate the loads for each processor while the hierarchical method use a central approach at level one and a distributed strategy at level two, where processors communicate and share LPs' information only with their immediate neighbors. It is worth mentioning that a new metric for measuring the workload is defined in [16] for both optimistic and conservative simulations. In their approach, an architecture for load distribution services over a multi-threaded HLA / RTI is described, and these services aimed to improve the overall simulation performance.…”
Section: Related Workmentioning
confidence: 99%