Interactive Consistency in Quasi-Asynchronous Systems

A. Postma, Th. Krol

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    1 Citation (Scopus)
    55 Downloads (Pure)

    Abstract

    In order to make a dependable distributed computer system resilient to arbitrary failures of its processors, deterministic interactive consistency algorithms (ICAs) are required. Thus far, in order to guarantee interactive consistency, all ICAs found in the literature require that all correct processors in the system start the algorithm simultaneously. In a distributed system, it is hard to satisfy this requirement. Therefore, in this paper, we describe a new class of self-synchronizing ICAs that guarantee interactive consistency without the above-mentioned requirement
    Original languageEnglish
    Title of host publicationProceedings 2nd IEEE International Conference on Engineering of Complex Computer Systems
    Place of PublicationMontreal, Canada
    PublisherIEEE
    Pages2-9
    ISBN (Print)0-8186-7614-0
    DOIs
    Publication statusPublished - 31 Jan 1996
    Event2nd IEEE International Conference on Engineering of Complex Computer Systems, ICECCS 1996 - Montreal, Canada
    Duration: 21 Oct 199625 Oct 1996
    Conference number: 2

    Publication series

    Name
    PublisherIEEE

    Conference

    Conference2nd IEEE International Conference on Engineering of Complex Computer Systems, ICECCS 1996
    Abbreviated titleICECCS
    CountryCanada
    CityMontreal
    Period21/10/9625/10/96

    Fingerprint

    Dive into the research topics of 'Interactive Consistency in Quasi-Asynchronous Systems'. Together they form a unique fingerprint.

    Cite this