1,372 Hits in 3.6 sec

Optimizing cell-size in grid-based DDM

R. Ayani, F. Moradi, G. Tan
Proceedings Fourteenth Workshop on Parallel and Distributed Simulation  
We develop an analytical model and derive a formula for identifying the optimal cell size in grid-based DDM.  ...  We show that appropriate choice of the grid-cell size is crucial in obtaining good performance.  ...  In grid-based DDM, an important issue is the size of the grid cells. We develop a model to study the impact of cell size on performance.  ... 
doi:10.1109/pads.2000.847149 dblp:conf/pads/AyaniMT00 fatcat:xljx6fwkzbaxxjmq2hbbp3rz2a

Implementation of Data Distribution Management services in a Service Oriented HLA RTI

Ke Pan, Stephen John Turner, Wentong Cai, Zengxiang Li
2009 Proceedings of the 2009 Winter Simulation Conference (WSC)  
To demonstrate the plug-and-play paradigm, this paper discusses the implementation of two DDM approaches, the grid-based approach and an extended efficient sort-based approach, in SOHR.  ...  Its Data Distribution Management (DDM) service group aims at optimizing communication efficiency between simulation components and there are various approaches for DDM implementation.  ...  Ayani et al. have carried out a study on optimization of the cell size for the grid-based approach .  ... 
doi:10.1109/wsc.2009.5429557 dblp:conf/wsc/PanTCL09 fatcat:kthss6ef5nczrdtbuvfapxtvt4

An Adaptive Dynamic Grid-Based approach to DDM for large-scale distributed simulation systems

Azzedine Boukerche, Yunfeng Gu, Regina B. Araujo
2008 Journal of computer and system sciences (Print)  
This paper presents a novel DDM scheme called the Adaptive Dynamic Grid-Based (ADGB) scheme that optimizes DDM time through analysis of matching performance.  ...  Examples of such systems include the Region-Based, Fixed Grid-Based, Hybrid, and Dynamic Grid-Based (DGB) schemes.  ...  The paper is organized as follows: in Section 2, DDM Time in the Dynamic Grid-Based scheme is analyzed for potential optimizations.  ... 
doi:10.1016/j.jcss.2007.07.007 fatcat:ifhbdn35onfvvemzm4fwg66jou

A binary partition-based matching algorithm for Data Distribution Management

Junghyun Ahn, Changho Sung, Tag Gon Kim
2011 Proceedings of the 2011 Winter Simulation Conference (WSC)  
In order to reduce the computational overhead for the matching process, this paper proposes a binary partition-based matching algorithm for DDM in the HLA-based distributed simulation.  ...  The new matching algorithm is fundamentally based on a divide-and-conquer approach.  ...  rate is low and the optimal 10 × 10 grid cells are used).  ... 
doi:10.1109/wsc.2011.6147978 dblp:conf/wsc/AhnSK11 fatcat:z6wjbj4anzanzjkpiv7v3ega2m

A binary partition-based matching algorithm for Data Distribution Management in a High-level Architecture-based distributed simulation

Junghyun Ahn, Changho Sung, Tag Gon Kim
2012 Simulation (San Diego, Calif.)  
To reduce the computational overhead for the matching process, this paper proposes a binary partition-based matching algorithm for DDM in a HLA-based distributed simulation.  ...  The new matching algorithm is fundamentally based on a divide-and-conquer approach.  ...  by the Defense Acquisition Program Administration and Agency for Defense Development (contract UD110006MD) and the Brain Korea 21 Project, BK Electronics and Communications Technology Division, KAIST in  ... 
doi:10.1177/0037549712450628 fatcat:tvnsmouq2fdj7hunqezw5j3vqu

A Comparative Study of Data Distribution Management Algorithms

Pankaj Gupta, Ratan K. Guha
2007 The Journal of Defence Modeling and Simulation: Applications, Methodology, Technology  
In this paper, we present a comparative study of a recently proposed DDM algorithm, called P-Pruning algorithm, with three other known techniques: region-matching, fixed-grid, and dynamic-grid DDM algorithms  ...  In large-scale distributed defense modeling and simulation, Data Distribution Management (DDM) controls and limits the data exchanged reducing the processing requirements of federates.  ...  size 5 Figure 12 .Figure 13 .Figure 14 . 121314 Comparison of multicast group size in DDM algorithms for routing space 50 x 50 and grid size 2 Comparison of multicast group size in DDM algorithms for  ... 
doi:10.1177/154851290700400204 fatcat:q5yiu6wu3bf5rehnppudzn2qwq

Displacement residual based DDM matching algorithm

Lin Zhang, Zhong Zhou, Lin Liu, Wei Wu
2012 Science China Information Sciences  
Consequently, a region matching algorithm called displacement residual-based DDM matching (DRBM) is proposed in the paper.  ...  The key in DDM implementation is the region overlap computation, i.e. the matching between update and subscription regions.  ...  The major problem is that its performance depends on the chosen size of grid cells.  ... 
doi:10.1007/s11432-011-4427-0 fatcat:2arssjrkibb3jaf7qctcmdrm4u

Fast 3-D Thermal Simulation for Integrated Circuits With Domain Decomposition Method

Wenjian Yu, Tao Zhang, Xiaolong Yuan, Haifeng Qian
2013 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
In this letter, techniques based on the domain decomposition method (DDM) are presented for the 3-D thermal simulation of nonrectangular IC thermal model including heat sink and heat spreader.  ...  Numerical experiments on several 2-D and 3-D IC test cases demonstrate that the relaxed nonoverlapping DDM is faster than the other preconditioned conjugate gradient algorithms with same mesh grid.  ...  Take the kth grid cell in 2 as an example; it overlaps several cells in 1 . We convert the heat flow into cells in 1 to the heat flow into cell k.  ... 
doi:10.1109/tcad.2013.2273987 fatcat:yc6kdclab5c6rcdgkw2a4scecu

Implementing Data Distribution Management System Using Layer Partition-Based Matching Algorithm

Nwe Nwe Myint Thein, University of Information Technology, Myanmar
2020 International Journal of Future Computer and Communication  
In High Level Architecture paradigm, the Runtime Infrastructure (RTI) provides a set of services. Data Distribution Management (DDM) service reduces message traffic over the network.  ...  The paper describes practically testing simulation for the data distribution management (DDM) service of the Battleground simulation with the dynamic fighters by using layer partition-based algorithm.  ...  The amount of irrelevant data communicated in the grid-based filtering depends on the grid cell size, but it is hard to define the appropriate size of grid cells [12] - [14] . C.  ... 
doi:10.18178/ijfcc.2020.9.1.558 fatcat:cdsbigxyazaptis5a6vw6iwdam

A Dynamic Data Driven Application System for Vehicle Tracking

Richard Fujimoto, Angshuman Guin, Michael Hunter, Haesun Park, Gaurav Kanitkar, Ramakrishnan Kannan, Michael Milholen, SaBra Neal, Philip Pecher
2014 Procedia Computer Science  
A testbed under development in the midtown area of Atlanta, Georgia in the United States is briefly described.  ...  Tracking the movement of vehicles in urban environments using fixed position sensors, mobile sensors, and crowd-sourced data is a challenging but important problem in applications such as law enforcement  ...  Fixed Grid Approach The Fixed Grid DDM method divides the routing space into fixed sized grid cells, and a multicast group is associated with each cell (see Figure 5 ).  ... 
doi:10.1016/j.procs.2014.05.108 fatcat:ujy32vhi5rfbhhjmuisxdfivma

A Service Oriented HLA RTI on the Grid

Ke Pan, Stephen John Turner, Wentong Cai, Zengxiang Li
2007 IEEE International Conference on Web Services (ICWS 2007)  
Ayani et al. have carried out a study on optimization of the cell size for the grid-based approach [AYA00].  ...  Grid-Based DDM Implementation The grid-based DDM approach was implemented in SOHR by implementing a Grid-Based DDM Module in the LRI structure and a new DDMS as shown in Figure 6 grid cells with their  ... 
doi:10.1109/icws.2007.20 dblp:conf/icws/PanTCL07 fatcat:rrfd6nmxrfbm3fefdh3cba3aye

Nearwell local space and time refinement in reservoir simulation

Walid Kheriji, Roland Masson, Arthur Moncorgé
2015 Mathematics and Computers in Simulation  
We propose to combine this latter windowing approach with a DDM Robin-Neumann algorithm coupling the coarse grid solution with full overlap to the refined (in space and time) nearwell grid solution.  ...  The algorithm is based on an optimized Schwarz method using a full overlap at the coarse level.  ...  The isotropic log-normal permeability K is first defined on the uniform fine grid of size 3M x × 3M y × 3M z and upscaled in the coarse cells of M r by simple averaging.  ... 
doi:10.1016/j.matcom.2014.11.022 fatcat:dgpju3alzragnm3iwucyzxvr5e

Performance Analysis of a Photovoltaic Source Connected to the Utility Grid

Asmaa Shehab, Adel Abou El-Ela, Sohir Allam
2022 ERJ. Engineering Research Journal  
Based on the optimal parameters for the study module using the proposed AOA, the detailed Simulink model of small-scale 42 kW PV system is accurately designed and connected to the utility grid.  ...  In this paper, a recent algorithm called Arithmetic Optimization Algorithm (AOA) is proposed to find the optimal PV model parameters to build a Simulink model for an actual case study of the New and Renewable  ...  In addition, a MATLAB code is employed to simulate the parameters of PV cells based on analytical expressions and determine the values of these parameters using AOA.  ... 
doi:10.21608/erjm.2022.71050.1091 fatcat:ps72izcrarhzpdu35f5v5q6onq

Sub-1.5 Time-Optimal Multi-Robot Path Planning on Grids in Polynomial Time [article]

Teng Guo, Jingjin Yu
2022 arXiv   pre-print
Graph-based multi-robot path planning (MRPP) is NP-hard to optimally solve.  ...  In extensive numerical evaluations, RTH and its variants demonstrate exceptional scalability as compared with methods including ECBS and DDM, scaling to over 450 × 300 grids with 45,000 robots, and consistently  ...  ACKNOWLEDGMENTS This work is supported in part by NSF awards IIS-1845888, CCF-1934924, and IIS-2132972, and an Amazon Research Award.  ... 
arXiv:2201.08976v2 fatcat:2v7czpbc5jadhaur7ba74outbq

DDM: Fast Near-Optimal Multi-Robot Path Planning using Diversified-Path and Optimal Sub-Problem Solution Database Heuristics [article]

Shuai D. Han, Jingjin Yu
2019 arXiv   pre-print
We propose a novel centralized and decoupled algorithm, DDM, for solving multi-robot path planning problems in grid graphs, targeting on-demand and automated warehouse-like settings.  ...  Extensive evaluation demonstrates that DDM achieves high levels of scalability and high levels of solution optimality.  ...  All tests are repeated with varied grid sizes and obstacle percentages. The results, which are omitted due to space constraint, are consistent in all cases.  ... 
arXiv:1904.02598v2 fatcat:m3a5iv5eqjgbfi7y5tgkhsa3ea
« Previous Showing results 1 — 15 out of 1,372 results