Publication

A General Characterization of Indulgence

Rachid Guerraoui
2008
Journal Articles

Abstract

An indulgent algorithm is a distributed algorithm that, besides tolerating process failures, also tolerates unreliable information about the interleaving of the processes. This article presents a general characterization of indulgence in an abstract computing model that encompasses various communication and resilience schemes. We use our characterization to establish several results about the inherent power and limitations of indulgent algorithms.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A General Characterization of Indulgence

Chat with Graph Search

Partial Synchrony for Free: New Upper Bounds for Byzantine Agreement

3D diffractive optics for linear interconnects and nonlinear processing

Planetary-Scale Byzantine Fault Tolerance