Classes of Byzantine Fault-Tolerant Algorithms for Dependable Distributed Systems

André Postma

    Research output: ThesisPhD Thesis - Research UT, graduation UT

    77 Downloads (Pure)

    Abstract

    This thesis concentrates on the design of new algorithms for fault-tolerant systems based on system-level hardware masking redundancy. It is argued that any system in which a reliability improvement of at least a factor 100 is required should be based on system-level hardware masking redundancy. The technique of system-level hardware masking redundancy is applicable in a redundant system consisting of a number of processors, in which the system services are replicated on the different processors, and provides resilience to a limited number of faulty processors in the system. The technique is most effective in a distributed system, since the autonomous nature and geographical distribution of the processors in such a system largely contribute to achieve independency between failures of different processors, which improves the reliability of the system.
    Original languageEnglish
    Awarding Institution
    • University of Twente
    Supervisors/Advisors
    • Krol, Th., Supervisor
    Award date20 Feb 1998
    Place of PublicationEnschede
    Publisher
    Print ISBNs90-365-1081-3
    Publication statusPublished - 20 Feb 1998

    Keywords

    • METIS-118436
    • IR-17917

    Fingerprint Dive into the research topics of 'Classes of Byzantine Fault-Tolerant Algorithms for Dependable Distributed Systems'. Together they form a unique fingerprint.

    Cite this