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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:
    Jing Wei-peng, (author) / Liu Ya-qiu, (author) / Wu Qu, (author)


    Publication date :

    2010-06-01


    Size :

    788228 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    The fault-tolerant multiprocessor computer

    Smith, T.B. | Tema Archive | 1986


    A fault tolerant reconfigurable multiprocessor System

    Hamill, T.G. / Phillips, R. | Tema Archive | 1977


    Performance and economy of a fault-tolerant multiprocessor

    Lala, J. H. / Smith, C. J. | NTRS | 1979


    Performance and economy of a fault-tolerant multiprocessor

    Jaynarayan, H.L. / Smith, C.J. | Tema Archive | 1979