SIAM Journal on Computing
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
OpenMP: An Industry-Standard API for Shared-Memory Programming
IEEE Computational Science & Engineering
Performance Comparison of Data Distribution Management Strategies
DS-RT '01 Proceedings of the Fifth IEEE International Workshop on Distributed Simulation and Real-Time Applications
A New Adaptive Middleware for Parallel and Distributed Simulation of Dynamically Interacting Systems
DS-RT '04 Proceedings of the 8th IEEE International Symposium on Distributed Simulation and Real-Time Applications
A sort-based DDM matching algorithm for HLA
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A dichromatic framework for balanced trees
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
A Rectangle-Intersection Algorithm with Limited Resource Requirements
CIT '10 Proceedings of the 2010 10th IEEE International Conference on Computer and Information Technology
A dynamic sort-based DDM matching algorithm for HLA applications
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Geographical Data Structures Compared: A Study of Data Structures Supporting Region Queries
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Bioinformatics
A binary partition-based matching algorithm for data distribution management
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
Identifying intersections among a set of d-dimensional rectangular regions (d-rectangles) is a common problem in many simulation and modeling applications. Since algorithms for computing intersections over a large number of regions can be computationally demanding, an obvious solution is to take advantage of the multiprocessing capabilities of modern multicore processors. Unfortunately, many solutions employed for the Data Distribution Management service of the High Level Architecture are either inefficient, or can only partially be parallelized. In this paper we propose the Interval Tree Matching(ITM) algorithm for computing intersections among d-rectangles. ITMis based on a simple Interval Tree data structure, and exhibits an embarrassingly parallel structure. We implement the ITM algorithm, and compare its sequential performance with two widely used solutions(brute force and sort-based matching). We also analyze the scalability of ITM on shared-memory multicore processors. The results show that the sequential implementation of ITM is competitive with sort-based matching, moreover, the parallel implementation provides good speed upon multicore processors.