In this paper we consider the problem of identifying intersections between two sets of d-dimensional axis-parallel rectangles. This is a common operation that arises in many agent-based simulation studies, and is of c...
详细信息
ISBN:
(纸本)9781538640289
In this paper we consider the problem of identifying intersections between two sets of d-dimensional axis-parallel rectangles. This is a common operation that arises in many agent-based simulation studies, and is of central importance in the context of High Level Architecture (HLA), where it is at the core of the data distribution management (DDM) service. Several realizations of the DDM service have been proposed;however, many of them are either inefficient or inherently sequential. We propose a parallel version of the Sort-Based Matching algorithm for shared-memory multiprocessors. SortBased Matching is one of the most efficient serial algorithms for the DDM problem, but is quite difficult to parallelize because of data dependencies. We describe the algorithm and compute its asymptotic running time;we complete the analysis by assessing its performance and scalability through extensive experiments on two commodity multicore systems based on a dual socket Intel Xeon processor, and a single socket Intel Core i7 processor.
One of the services provided by the High Level Architecture (HLA) Run-time Infrastructure (RTI) is data distribution management (DDM), which aims to make data communication more efficient by sending data to only those...
详细信息
ISBN:
(纸本)0769508375
One of the services provided by the High Level Architecture (HLA) Run-time Infrastructure (RTI) is data distribution management (DDM), which aims to make data communication more efficient by sending data to only those federates requiring rite data. Several DDM methods, notably region and grid-based have been proposed and some of them have been implemented in RTI. This paper first briefly discusses SI grid-based and region-based DDM and their advantages and disadvantages, and then a new hybrid approach is proposed Our simulations show that in some situations, the hybrid approach can reduce both the number of irrelevant messages of the grid-based DDM and the number of matching of the region-based approach.
作者:
Petty, MDOld Dominion Univ
Coll Engn & Technol Virginia Modeling Anal & Simulat Ctr Suffolk VA 23435 USA
The high level architecture (HLA) is a standard for federations of distributed simulations that exchange run-time data. HLA's data distribution management (DDM) services reduce data delivered to simulations based ...
详细信息
The high level architecture (HLA) is a standard for federations of distributed simulations that exchange run-time data. HLA's data distribution management (DDM) services reduce data delivered to simulations based on their declarations of data produced and required. The HLA specifications, including DDM, were changed substantially from the Department of Defense 1.3 standard to the IEEE 1516 standard. The two DDM specifications' (DDM 1.3 and DDM 1516) power to define intersimulation data flows are compared. A transformation from DDM 1.3 to DDM 1516 configurations and a mapping from DDM 1516 to DDM 1.3 configurations prove that the DDM specifications are equivalently powerful. (C) 2001 Elsevier Science B.V. All rights reserved.
The High Level Architecture's (HLA) data distribution management (DDM) services are the most recent in a succession of systems designed to reduce the amount of data received by individual simulations in large-scal...
详细信息
The High Level Architecture's (HLA) data distribution management (DDM) services are the most recent in a succession of systems designed to reduce the amount of data received by individual simulations in large-scale distributed simulations. A common optimization in these interest management systems is the use of multicast groups for sending data to a selected subset of all potential receivers. The use of multicast has met with considerable success in this application. However, its use to date has relied on a priori knowledge of communication patterns between simulations and static assignment of multicast groups to these patterns. As larger, more complex, and less predictable simulations are built, the need has arisen for more efficient use of multicast groups as they are a restricted resource [3Com Corporation, Scaling Performance and Managing Growth with the CoreBuilder 3500 Layer 3 Switch (available at http://***/products/dsheets/***) lists a limit of 6 K, the highest number identified while Synthetic Theater of War (STOW) (D. Van Hook, RITN IM and IM history, personal communication, January 1996) had a hardware limit of approximately 1000. A typical workstation network interface card has only a few (H. Abrams, Extensible interest management for scalable persistent distributed virtual environments, Ph.D. Dissertation, Naval Postgraduate School, December 1999)]. This paper presents two algorithms for performing grouping, and the message delivery time improvements resulting from applying the algorithms to selected data sets. (C) 2001 Elsevier Science B.V. All rights reserved.
In this paper, we design data distribution management modules based on region match. datadistribution man-agement module based on region match combined region match and multicast network, and the regions are matched ...
详细信息
ISBN:
(纸本)9781728101057
In this paper, we design data distribution management modules based on region match. datadistribution man-agement module based on region match combined region match and multicast network, and the regions are matched before the system runs to establish a multicast channel for the region in advance. This method is suita-ble for applications where the requirement of transmission efficiency is high. Experimental results show that the software is characterized with complete function, stable performance, with the flexible, reduced network load, and the high efficient data transmission.
Identifying intersections among a set of d-dimensional rectangular regions (d-rectangles) is a common problem in many simulation and modeling applications. Since algorithms for computing intersections over a large num...
详细信息
ISBN:
(纸本)9780769551388
Identifying intersections among a set of d-dimensional rectangular regions (d-rectangles) is a common problem in many simulation and modeling applications. Since algorithms for computing intersections over a large number of regions can be computationally demanding, an obvious solution is to take advantage of the multiprocessing capabilities of modern multicore processors. Unfortunately, many solutions employed for the data distribution management service of the High Level Architecture are either inefficient, or can only partially be parallelized. In this paper we propose the Interval Tree Matching (ITM) algorithm for computing intersections among d-rectangles. ITM is based on a simple Interval Tree data structure, and exhibits an embarrassingly parallel structure. We implement the ITM algorithm, and compare its sequential performance with two widely used solutions (brute force and sort-based matching). We also analyze the scalability of ITM on shared-memory multicore processors. The results show that the sequential implementation of ITM is competitive with sort-based matching;moreover, the parallel implementation provides good speedup on multicore processors.
Using data distribution management (DDM), federates can send/receive interest data properly instead of broadcasting data over entire network. For large-scale HLA simulations with many simulation entities or federates,...
详细信息
Using data distribution management (DDM), federates can send/receive interest data properly instead of broadcasting data over entire network. For large-scale HLA simulations with many simulation entities or federates, the use of DDM is essential to support such simulations. However, the scalability issue of DDM is rarely raised in the literature. Thus we present a scalable DDM approach, DHT-DDM, using Content-Addressable Networks (CANs) [1] based on Distributed Hash Table (DHT). Region declaration, region matching, and network connection mechanisms for DDM are designed considering scalability. The declaration of regions is done deterministically without depending on global information, the load of region matching is distributed and shared among federates, and the connections of federates is built upon application-level multicast.
data distribution management (DDM) is one of the services provided by the High Level Architecture (HLA) Run-time Infrastructure (RTI), which aims to reduce the amount of irrelevant data communication among federates a...
详细信息
ISBN:
(纸本)9781565553194
data distribution management (DDM) is one of the services provided by the High Level Architecture (HLA) Run-time Infrastructure (RTI), which aims to reduce the amount of irrelevant data communication among federates and to minimize computational requirements for sending and receiving *** DDM methods, including region-based, grid-based and their hybrids have been proposed in the literature. In this paper, we propose a new quadtree-based approach which significantly reduces irrelevant data communication and system complexity compared to previous methods. We introduce a mini-RTI toolkit to evaluate our model and previous methods. The experimental results show the improvement of our approach compared to grid and region based methods.
data distribution management(DDM) is an important service of the DoD High Level Architecture(HLA).For providing efficient,scalable mechanisms for distributing state updates and interaction information in large scale d...
详细信息
data distribution management(DDM) is an important service of the DoD High Level Architecture(HLA).For providing efficient,scalable mechanisms for distributing state updates and interaction information in large scale distributed simulations,DDM mechanisms(also known as filtering) in these interest management systems is the use of real time training *** paper presents cloudbased algorithms for *** this method,the initiation of the regions is made with the cloud model and an interest tree of pan-concepts is *** results of instance imply that this cloud DDM algorithm can be applied under the most situations and is self-adaptive,can reach the goal of the data distributed management,and greatly improves the effect and efficiency of the high complexity simulation system based on high-level architecture.
暂无评论