By Topic

Optimal scheduling of parallel tasks of tracking problem onto multiprocessors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Piriyakumar, A.L. ; Dept. of Comput. Sci., Pondicherry Univ., India ; Murthy, C.S.R.

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.

Published in:

Aerospace and Electronic Systems, IEEE Transactions on  (Volume:32 ,  Issue: 2 )