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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Optimal scheduling of parallel tasks of tracking problem onto multiprocessors


    Beteiligte:


    Erscheinungsdatum :

    01.04.1996


    Format / Umfang :

    2966330 byte




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    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