With multiprocessor systems, redundant scheduling is a technique that trades processing power for increased reliability through redundancy. One novel approach, called primary-backup task scheduling, is a large number of used in hard real-time multiprocessor systems to guarantee the deadlines of tasks faults. In this paper, we analysis and compare the scheduling algorithm based on primary-backup replication in current distributed system. Finally, the important features that fault-tolerant Task Scheduling in Multiprocessor Systems based on primary-backup are summarized, and the future research strategies and tends are given.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Fault-tolerant task scheduling in multiprocessor systems based on primary-backup scheme


    Beteiligte:
    Jing Wei-peng, (Autor:in) / Liu Ya-qiu, (Autor:in) / Wu Qu, (Autor:in)


    Erscheinungsdatum :

    01.06.2010


    Format / Umfang :

    788228 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch