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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimal scheduling of parallel tasks of tracking problem onto multiprocessors


    Contributors:


    Publication date :

    1996-04-01


    Size :

    2966330 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Scheduling Tasks In Parallel Processing

    Price, Camille C. / Salama, Moktar A. | NTRS | 1989


    Parallel Processor Scheduling with Chain-structured Tasks

    Zhao, C.-l. / Zhang, Q.-l. / Tang, H.-y. | British Library Online Contents | 2001



    On mapping a tracking algorithm onto parallel processors

    Pattipati, K.R. / Kurien, T. / Lee, R.-T. et al. | IEEE | 1990