User Tools

Site Tools


pads:interval_tree_matching_itm

DDM: Data Distribution Management

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) accepted for publication 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 and scripts used in the performance evaluation are freely available (with a Free Software license).

Download

Sources Description
DDM-DSRT-2013 ddm-dsrt-2013-sources.tgz source code

Slides

Contacts

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

Citation

To cite this DDM software use:

ddm-dsrt13.txt
M. Marzolla, G. D'Angelo, M. Mandrioli, 
A Parallel Data Distribution Management Algorithm. 
To appear in proc. IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT 2013).
Oct 30—nov 1, 2013, Delft, the Netherlands.

If you use BibTeX for LaTeX, use:

ddm-dsrt13.tex
@inproceedings{ddm-dsrt13,
  author = "Moreno Marzolla and Gabriele D'Angelo and Marco Mandrioli",
  title = "A Parallel Data Distribution Management Algorithm",
  booktitle = "Proc. IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications (DS-RT 2013)",
  month = oct # " 30--" # nov # " 1",
  year = 2013,
  address = "Delft, the Netherlands"
}
pads/interval_tree_matching_itm.txt · Last modified: 2021/07/29 07:55 by gda