User Tools

Site Tools


pads:ddm

Differences

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

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
pads:ddm [2013/06/26 08:44] gdangelopads: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. 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 (ITMalgorithm 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 Mandriolisubmitted for evaluation to the 17th IEEE/ACM International Symposium on  +=====  Interval Tree Matching (ITM=====
-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 =====+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.
  
-For more information on our DDM research effort please [[pads:contacts|contact us]]. 
  
pads/ddm.1372236264.txt.gz · Last modified: 2013/06/26 08:44 by gdangelo

Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki