Publication

A General Characterization of Indulgence

Rachid Guerraoui
2008
Journal paper

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

https://infoscience.epfl.ch/record/160241?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

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

Graph Chatbot

Chat with Graph Search

Hypergraph-Based Fast Distributed AC Power Flow Optimization

A digital bridge between brain and spinal cord restores walking after paralysis

Science Communication Desperately Needs More Aligned Recommendation Algorithms

Hypergraph-Based Fast Distributed AC Power Flow Optimization

A digital bridge between brain and spinal cord restores walking after paralysis

Science Communication Desperately Needs More Aligned Recommendation Algorithms