Access Restriction

Author Borran, Fatemeh ♦ Hutle, Martin ♦ Santos, Nuno ♦ Schiper, André
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract Abstract—Consensus is one of the key problems in fault-tolerant distributed computing. Communication predicates serve as an abstraction for distributed algorithms that allows us to reason about permanent and transient failures in a uniform way. This paper discusses several implementations of communication predicates in a system that alternates between good periods and bad periods. This approach allows us to quantify the required length of a good period to solve a given number of consensus instances. With our results, we can observe several interesting issues, like that the number of rounds is not in general a good prediction for the time to solve consensus.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article