Differences

This shows you the differences between two versions of the page.

--- pads:ddm [2013/10/29 08:34] – gdangelo
+++ pads:ddm [2021/07/29 08:05] (current) – [DDM: Data Distribution Management] gda
@@ Line 4: / Line 4: @@
 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. In the last years, we have developed two different solutions that are described in the corresponding research papers.
-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.
+=====  Parallel Sort-based Matching (pSBM)=====
-===== Research results and implementation =====
+A novel [[:parallelsbm-paper|parallel extension of the Sort Based Matching algorithm]], whose sequential version is considered among the most efficient solutions to the DDM problem.
-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).
+=====  Interval Tree Matching (ITM) =====
-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    |    [[http://pads.cs.unibo.it/download/DDM-DSRT-2013-sources.tgz|this link]]  |  //sources//  |
-===== Slides =====
-<iframe src="http://www.slideshare.net/slideshow/embed_code/27681131?rel=0" width="597" height="486" frameborder="0" marginwidth="0" marginheight="0" scrolling="no" style="border:1px solid #CCC;border-width:1px 1px 0;margin-bottom:5px" allowfullscreen> </iframe> <div style="margin-bottom:5px"> <strong> <a href="https://www.slideshare.net/gda/ds-rt2013gda" title="A Parallel Data Distribution Management Algorithm" target="_blank">A Parallel Data Distribution Management Algorithm</a> </strong> from <strong><a href="http://www.slideshare.net/gda" target="_blank">Gabriele D&#39;Angelo</a></strong> </div>
+The [[pads: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.
-===== Contacts =====
-For more information on our DDM research effort please [[pads:contacts|contact us]].