Multitarget tracking algorithm parallelization for distributed-memory computing systems
- and others
In this paper we present a robust scalable parallelization of a multitarget tracking algorithm developed for air traffic surveillance. We couple the state estimation and data association problems by embedding an Interacting Multiple Model (IMM) state estimator into an optimization-based assignment framework. A SPMD distributed-memory parallelization is described, wherein the interface to the optimization problem, namely, computing the rather numerous gating and IMM state estimates, covariance calculations, and likelihood function evaluations (used as cost coefficients in the assignment problem), is parallelized. We describe several heuristic algorithms developed for the inherent task allocation problem, wherein the problem is one of assigning track tasks, having uncertain processing costs and negligible communication costs, across a set of homogeneous processors to minimize workload imbalances. Using a measurement database based on two FAA air traffic control radars, courtesy of Rome Laboratory, we show that near linear speedups are obtainable on a 32-node Intel Paragon supercomputer using simple task allocation algorithms.
- OSTI ID:
- 421384
- Report Number(s):
- CONF-960835-; CNN: Grant AFOSR F409620-93-1-0399; Grant ONR/BMDO N00014-91-J-1950; Grant NASA NGT-303104; TRN: 96:006403-0046
- Resource Relation:
- Conference: 5. IEEE international symposium on high-performance distributed computing, Syracuse, NY (United States), 6-9 Aug 1996; Other Information: PBD: 1996; Related Information: Is Part Of Proceedings of the fifth IEEE international symposium on high performance distributed computing; PB: 664 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Application of a parallel 3-dimensional hydrogeochemistry HPF code to a proposed waste disposal site at the Oak Ridge National Laboratory
LEISURE: Load-Balanced Network-Wide Traffic Measurement and Monitor Placement