On mapping a tracking algorithm onto parallel processors

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. >

[1]  Ravi Sethi,et al.  Scheduling Graphs on Two Processors , 1976, SIAM J. Comput..

[2]  Krishna R. Pattipati,et al.  A decision support system for the algorithm-architecture mapping problem , 1988, Proceedings of the 1988 IEEE International Conference on Systems, Man, and Cybernetics.

[3]  Shahid H. Bokhari,et al.  On the Mapping Problem , 1981, IEEE Transactions on Computers.

[4]  G. D. Bergland,et al.  Application of a Highly Parallel Processor to Radar Data Processing , 1972, IEEE Transactions on Aerospace and Electronic Systems.

[5]  Krishna R. Pattipati,et al.  On the asymptotic optimality of a heuristic mapping algorithm , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.

[6]  Michael W. Summers,et al.  The Evolution of a Parallel Active Tracking Program , 1974, Sagamore Computer Conference.

[7]  Krishna R. Pattipati,et al.  BM/C(3) algorithm mapping onto concurrent processors. Final report, May-December 1987 , 1989 .

[8]  Kenneth E. Batcher,et al.  Bit-Serial Parallel Processing Systems , 1982, IEEE Transactions on Computers.

[9]  Robert B. Washburn,et al.  Multiobject Tracking using Passive Sensors , 1985 .

[10]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[11]  Donald Reid An algorithm for tracking multiple targets , 1978 .

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Kai Hwang,et al.  Computer architecture and parallel processing , 1984, McGraw-Hill Series in computer organization and architecture.

[14]  Yaakov Bar-Shalom,et al.  Tracking methods in a multitarget environment , 1978 .

[15]  Hironori Kasahara,et al.  Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing , 1984, IEEE Transactions on Computers.

[16]  T. C. Hu Parallel Sequencing and Assembly Line Problems , 1961 .