Differences

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

--- pads:ddm [2021/07/29 08:00] – gda
+++ 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.
-Unfortunately, many solutions employed for the Data Distribution Management service of HLA are either inefficient, or can only partially be parallelized.
+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.
 =====  Parallel Sort-based Matching (pSBM)=====
-A novel [[parallel extension of the Sort Based Matching algorithm|pads:parallelddm-paper]], whose sequential version is considered among the most efficient solutions to the DDM problem.
+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.
 =====  Interval Tree Matching (ITM) =====
-We propose 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.
+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.