A binary partition-based matching algorithm for large scale distributed simulation = 대규모 분산 시뮬레이션을 위한 이진 분할 기반 정합 알고리즘

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 602
  • Download : 0
Data distribution management (DDM) is one of the most important filtering mechanisms in large scale distributed simulations. DDM has been successful in reducing the network traffic in some respect, but its capability is limited by the computational overhead for matching update regions and subscription regions that represent the interests of data producers and data consumers, respectively. For example, a typical DDM scenario is a battlefield simulation, where sensors are deployed to detect enemy movement. The enemy units are moving to a certain destination point and a sensor detects any enemy units. The update regions represent the location of enemy units with small rectangles, and the subscription regions represent the detecting ranges of the sensors. In this example, only if the update regions of the enemy units and subscription regions of the sensor overlap, the location of the enemy units will be routed by the DDM filtering mechanism. However, that mechanism produces high computational overhead because a matching process is performed to calculate the intersection between all pairs of update regions and subscription regions. As the previous matching algorithms do not consider the characteristics of the region distribution, it is difficult to select a matching algorithm that is appropriate for some region-distribution situations. In the case of large scale distributed simulations, such as a battlefield simulation, it will probably be a situation with large overlapping regions. The computational overhead of the matching process in large scale simulations is significant, because of superfluous intersections between regions. First, in this dissertation, we propose a binary partition-based matching algorithm based on the divide-and-conquer approach to reduce the computational overhead in the matching process. The design goal of our algorithm is to perform binary partitioning that divides the regions into two partitions, the left-hand partition and right-hand pa...
Advisors
Kim, Tag-Gonresearcher김탁곤
Description
한국과학기술원 : 전기및전자공학과,
Publisher
한국과학기술원
Issue Date
2013
Identifier
513069/325007  / 020075099
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전기및전자공학과, 2013.2, [ vii, 78 p. ]

Keywords

HLA/RTI; binary partitioning; BPM; DDM System; Data distribution; Large-scale; 데이터 분배; 데이터 분산 관리 시스템; 이진 분할 정합 알고리즘; 이진 분할; 연동기반 구조/런타임 인프라스트럭쳐; 대규모; 분산 시뮬레이션; Distributed simulation

URI
http://hdl.handle.net/10203/180146
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=513069&flag=dissertation
Appears in Collection
EE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0