The problem of mapping the tasks of a multitarget tracking algorithm onto parallel computing architectures to maximize speedup is considered. An asymptotically optimal mapping algorithm is developed and applied to study the effects of task granularity and processor architectures on the speedup. From the simulation results, it is concluded that task granularity and the parallelization of clustering and global hypotheses formation stages of the tracking algorithm are major determinants of speedup.<>
On mapping a tracking algorithm onto parallel processors
IEEE Transactions on Aerospace and Electronic Systems ; 26 , 5 ; 774-791
1990-09-01
1513652 byte
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Mapping the Kalman Tracking Algorithm Onto the Transputer Network
Online Contents | 1998
|Algorithm for Proximity Detection on Parallel Processors
Online Contents | 1996