MERAL Myanmar Education Research and Learning Portal
-
RootNode
-
Co-operative College, Mandalay
-
Cooperative College, Phaunggyi
-
Co-operative University, Sagaing
-
Co-operative University, Thanlyin
-
Dagon University
-
Kyaukse University
-
Laquarware Technological college
-
Mandalay Technological University
-
Mandalay University of Distance Education
-
Mandalay University of Foreign Languages
-
Maubin University
-
Mawlamyine University
-
Meiktila University
-
Mohnyin University
-
Myanmar Institute of Information Technology
-
Myanmar Maritime University
-
National Management Degree College
-
Naypyitaw State Academy
-
Pathein University
-
Sagaing University
-
Sagaing University of Education
-
Taunggyi University
-
Technological University, Hmawbi
-
Technological University (Kyaukse)
-
Technological University Mandalay
-
University of Computer Studies, Mandalay
-
University of Computer Studies Maubin
-
University of Computer Studies, Meikhtila
-
University of Computer Studies Pathein
-
University of Computer Studies, Taungoo
-
University of Computer Studies, Yangon
-
University of Dental Medicine Mandalay
-
University of Dental Medicine, Yangon
-
University of Information Technology
-
University of Mandalay
-
University of Medicine 1
-
University of Medicine 2
-
University of Medicine Mandalay
-
University of Myitkyina
-
University of Public Health, Yangon
-
University of Veterinary Science
-
University of Yangon
-
West Yangon University
-
Yadanabon University
-
Yangon Technological University
-
Yangon University of Distance Education
-
Yangon University of Economics
-
Yangon University of Education
-
Yangon University of Foreign Languages
-
Yezin Agricultural University
-
New Index
-
Item
{"_buckets": {"deposit": "4f3ec4b5-048b-434b-a6c6-80a0e22a9802"}, "_deposit": {"created_by": 45, "id": "6711", "owner": "45", "owners": [45], "owners_ext": {"displayname": "", "username": ""}, "pid": {"revision_id": 0, "type": "depid", "value": "6711"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/00006711", "sets": ["user-uit"]}, "communities": ["uit"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Layer Partition-based Matching Algorithm of DDM based on Dimension", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "High Level Architecture (HLA) is architecture for reuse and interoperation of simulations. In HLA paradigm, the Runtime Infrastructure (RTI) provides a set of services. Data Distribution Management (DDM) service reduces message traffic over the network. DDM aims to control and limit the data exchanged between federates during federation. Each federate may inform the RTI about its intention to publish some data or it may subscribe to receive a subset of the published data. DDM services are used to reduce the transmission and receiving of irrelevant data and aimed at reducing the communication over the network. These services rely on the computation of the intersection between “update” and “subscription” regions. When calculating the intersection between update regions and subscription regions, the higher computation overhead can occur. Currently, there are several main DDM filtering algorithms. This paper compares the performance of the layer partition-based matching algorithm based on the result of previous calculated dimension. The algorithm chooses the dynamic pivot based on regions distribution in the routing space. The proposed algorithm firstly calculates the regions distribution. Then, the partitioning among regions performs based on the result of choosing pivot based on region detection and defines the matching area that entirely covers all regions which need to match with regions at pivot point. The proposed algorithm provides the more definite matching area between update region and subscription region during matching process. This algorithm firstly calculates the X-dimension for matching result. Then modify the input region of Y-dimension based on the matching result of the previous dimension. The proposed algorithm is more efficient most of overlapping degree but sometime the proposed algorithm has more execution time than the original layer partition-based algorithm."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "HLA"}, {"interim": "DDM"}, {"interim": "Region-based Algorithm"}, {"interim": "Grid-based Algorithm"}, {"interim": "Sort-based Algorithm"}, {"interim": "Binary Partition-based Algorithm"}, {"interim": "Layer Partition-based Algorithm"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2020-12-09"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "Layer Partition-based Matching Algorithm of DDM based on Dimension.pdf", "filesize": [{"value": "343 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "mimetype": "application/pdf", "size": 343000.0, "url": {"url": "https://meral.edu.mm/api/files/4f3ec4b5-048b-434b-a6c6-80a0e22a9802/Layer%20Partition-based%20Matching%20Algorithm%20of%20DDM%20based%20on%20Dimension.pdf"}, "version_id": "6030bf0e-e9fe-40d4-82fa-61fb2e6a36f9"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "Issue-IV", "subitem_journal_title": "International Journal of Advanced Computer Technology (COMPUSOFT)", "subitem_volume": "Volume-III"}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Nwe Nwe Myint Thein"}, {"subitem_authors_fullname": "Nay Min Tun"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Journal article"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2014-04-01"}, "item_title": "Layer Partition-based Matching Algorithm of DDM based on Dimension", "item_type_id": "21", "owner": "45", "path": ["1596102355557"], "permalink_uri": "https://meral.edu.mm/records/6711", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2020-12-09"}, "publish_date": "2020-12-09", "publish_status": "0", "recid": "6711", "relation": {}, "relation_version_is_last": true, "title": ["Layer Partition-based Matching Algorithm of DDM based on Dimension"], "weko_shared_id": -1}
Layer Partition-based Matching Algorithm of DDM based on Dimension
https://meral.edu.mm/records/6711
https://meral.edu.mm/records/6711cc6e8f17-4086-4cee-801f-8a945ff656d6
4f3ec4b5-048b-434b-a6c6-80a0e22a9802
Name / File | License | Actions |
---|---|---|
![]() |
|
Publication type | ||||||
---|---|---|---|---|---|---|
Journal article | ||||||
Upload type | ||||||
Publication | ||||||
Title | ||||||
Title | Layer Partition-based Matching Algorithm of DDM based on Dimension | |||||
Language | en | |||||
Publication date | 2014-04-01 | |||||
Authors | ||||||
Nwe Nwe Myint Thein | ||||||
Nay Min Tun | ||||||
Description | ||||||
High Level Architecture (HLA) is architecture for reuse and interoperation of simulations. In HLA paradigm, the Runtime Infrastructure (RTI) provides a set of services. Data Distribution Management (DDM) service reduces message traffic over the network. DDM aims to control and limit the data exchanged between federates during federation. Each federate may inform the RTI about its intention to publish some data or it may subscribe to receive a subset of the published data. DDM services are used to reduce the transmission and receiving of irrelevant data and aimed at reducing the communication over the network. These services rely on the computation of the intersection between “update” and “subscription” regions. When calculating the intersection between update regions and subscription regions, the higher computation overhead can occur. Currently, there are several main DDM filtering algorithms. This paper compares the performance of the layer partition-based matching algorithm based on the result of previous calculated dimension. The algorithm chooses the dynamic pivot based on regions distribution in the routing space. The proposed algorithm firstly calculates the regions distribution. Then, the partitioning among regions performs based on the result of choosing pivot based on region detection and defines the matching area that entirely covers all regions which need to match with regions at pivot point. The proposed algorithm provides the more definite matching area between update region and subscription region during matching process. This algorithm firstly calculates the X-dimension for matching result. Then modify the input region of Y-dimension based on the matching result of the previous dimension. The proposed algorithm is more efficient most of overlapping degree but sometime the proposed algorithm has more execution time than the original layer partition-based algorithm. | ||||||
Keywords | ||||||
HLA, DDM, Region-based Algorithm, Grid-based Algorithm, Sort-based Algorithm, Binary Partition-based Algorithm, Layer Partition-based Algorithm | ||||||
Journal articles | ||||||
Issue-IV | ||||||
International Journal of Advanced Computer Technology (COMPUSOFT) | ||||||
Volume-III |