User Tools

Site Tools


pads:ddm

This is an old revision of the document!


DDM: Data Distribution Management

The High Level Architecture (HLA) specification (IEEE 1516) defines several Data Distribution Management (DDM) services to forward events generated on update regions to a set of subscription regions. For example, consider a simulation of vehicles moving over a two-dimensional terrain. In this case, each vehicle may be interested in events happening inside its area of interest (e.g., its field of view), that might be approximated with a rectangular region centered at the vehicle position. This kind of problem also arises in the context of Massively Multiplayer Online Games, where the game engine must send game updates only to players that might be affected, in order to reduce computation cost and network traffic.

Interval Tree Matching (ITM)

Unfortunately, many solutions employed for the Data Distribution Management service of HLA are either inefficient, or can only partially be parallelized. 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.

Research results and implementation

This is the support page of the paper titled “A Parallel Data Distribution Management Algorithm” (Moreno Marzolla, Gabriele D'Angelo, Marco Mandrioli) submitted for evaluation to the 17th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT 2013).

To foster the reproducibility of our experiments, all the source code used in the performance evaluation reported in the submitted paper, and the raw data obtained in the experiments execution, are freely available (with a Free Software license) following this link.

Contacts

For more information on our DDM research effort please contact us.

pads/ddm.1372239257.txt.gz · Last modified: 2013/06/26 09:34 by gdangelo

Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki