Parallel And Distributed Simulation Research Group

User Tools

Site Tools

Trace:
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 revisionBoth sides next revision
pads:ddm [2021/07/29 07:54] – gdapads:ddm [2021/07/29 07:54] – gda
Line 6: Line 6:
 =====  Interval Tree Matching (ITM) ===== =====  Interval Tree Matching (ITM) =====
  
-[[Interval Tree Matching (ITM)]]+[[pads: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. 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.
  
pads/ddm.txt · Last modified: 2021/07/29 08:05 by gda
Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki