The optimal scheduling of the tasks of a multitarget tracking problem onto multiprocessors to minimize the schedule length is considered. The main impediments of the recent A* algorithm for optimal scheduling of the tasks of this problem, the space and time requirements, are reduced using three new techniques, viz. processor isomorphism, duplicated node deletion, and lower bound on completion time. The effectiveness of these techniques is analyzed and demonstrated with the above real-time critical problem.
Optimal scheduling of parallel tasks of tracking problem onto multiprocessors
IEEE Transactions on Aerospace and Electronic Systems ; 32 , 2 ; 722-731
1996-04-01
2966330 byte
Article (Journal)
Electronic Resource
English
Optimal Scheduling of Parallel Tasks of Tracking Problem Onto Multiprocessors
Online Contents | 1996
|Scheduling Tasks In Parallel Processing
NTRS | 1989
|Parallel Processor Scheduling with Chain-structured Tasks
British Library Online Contents | 2001
|On mapping a tracking algorithm onto parallel processors
IEEE | 1990
|