Name
Abstract | ||
|---|---|---|
In distributed simulation, communication based on publish/subscribe will generate large amount of irrelevant data transmissions, and thereby degrading the performance. To solve the problem, HLA standard defines data distribution management to filter unnecessary communication. Among several famous interest matching algorithms, the sort-based algorithm has been proven to be the most efficient method in most scenarios. However, the potential of existing sort-based algorithm has not been fully exploited, due to the overhead of sorting the bounds can be further reduced and a portion of unnecessary bit operations can be eliminated. In this paper, we propose a binary search enhanced sort-based interest matching algorithm (BSSIM). Based on a different sufficient and necessary condition to judge interval overlapping, the size of list to be sorted can be remarkably reduced. Moreover, unnecessary bit operations can be eliminated by binary searches. Experimental results show that BSSIM algorithm outperforms the sort-based algorithm, and approximately 64%-159% performance improvement can be achieved at different scenarios.
|
Year | DOI | Venue |
|---|---|---|
2018 | 10.1145/3200921.3200941 | SIGSIM-PADS '18: SIGSIM Principles of Advanced Discrete Simulation
Rome
Italy
May, 2018 |
Keywords | Field | DocType |
Interest matching,sort-based algorithm,binary search | Publication,Computer science,sort,Algorithm,Sorting,Binary search algorithm,Blossom algorithm,Binary number,Performance improvement,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-1-4503-5092-1 | 0 | 0.34 |
References | Authors | |
5 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tianlin Li | 1 | 0 | 3.72 |
| Wenjie Tang | 2 | 46 | 11.91 |
| Yiping Yao | 3 | 120 | 31.11 |
| Feng Zhu | 4 | 11 | 6.83 |