Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
A parallel shortest augmenting path algorithm for the assignment problem
Journal of the ACM (JACM)
SIAM Journal on Computing
A taxonomy of scheduling in general-purpose distributed computing systems
IEEE Transactions on Software Engineering
An Application of Bayesian Decision Theory to Decentralized Control of Job Scheduling
IEEE Transactions on Computers
Load Sharing in Distributed Systems
IEEE Transactions on Computers
Load Balancing in Distributed Systems
IEEE Transactions on Software Engineering
Shared-Memory Parallelization of the Data Association Problem in Multitarget Tracking
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
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.