Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Parallel proximity detection and the distribution list algorithm
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
On extending parallelism to serial simulators
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
On extending more parallelism to serial simulators
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
Proximity problems on moving points
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Case study: parallelizing a sequential simulation model
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
Routing in quad tree-hypercube networks
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
Dynamic Grid-Based Multicast Group Assignment in Data Distribution Management
DS-RT '00 Proceedings of the Fourth IEEE International Workshop on Distributed Simulation and Real-Time Applications
A Hybrid Approach to Data Distribution Management
DS-RT '00 Proceedings of the Fourth IEEE International Workshop on Distributed Simulation and Real-Time Applications
Proceedings of the 35th conference on Winter simulation: driving innovation
Proximity detection in distributed simulation of wireless mobile systems
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
| Hi-index | 0.00 |
This paper describes a parallel proximity detection algorithm and illustrates its application to the problem of conflict detection in an aviation simulation. The algorithm invokes a previously designed sequential function in parallel, using spatial information acquired during the traversal of a quad tree, to keep the separate invocations of the function as independent as possible. The method is generally applicable to any function (not just conflict detection) whose arguments are spatially organized. Empirical results show that a single-threaded version of the algorithm sped up the simulation by 57%, while a four-threaded parallel version extracted 30% of the remaining additional speedup. These results are even more noteworthy given that the architecture of the simulation remains intact: we only replace the invocation mechanism for one function.