Publication

Chasing the FLP Impossibility Result in a LAN or How Robust Can a Fault Tolerant Server Be?

Publications associées (82)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Using Optimistic Atomic Broadcast in Transaction Processing Systems

André Schiper, Matthias Wiesmann, Fernando Pedone

Atomic broadcast primitives are often proposed as a mechanism to allow fault-tolerant cooperation between sites in a distributed system. Unfortunately, the delay incurred before a message can be delivered makes it difficult to implement high performance, s ...

2001

Genuine atomic multicast in asynchronous distributed systems

Rachid Guerraoui, André Schiper

This paper addresses the problem of atomic multicasting messages in asynchronous distributed systems. Firstly, we give a characterization of the notion of ``genuine atomic multicast''. This characterization leads to a better understanding of the difference ...

2001

The Generic Consensus Service

Rachid Guerraoui, André Schiper

This paper describes a modular approach for the construction of fault-tolerant agreement protocols. The approach is based on a generic consensus service. Fault-tolerant agreement protocols are built using a client-server interaction, where the clients are ...

2001

Agreement-related problems

Xavier Défago

Agreement problems constitute a fundamental class of problems in the context of distributed systems. All agreement problems follow a common pattern: all processes must agree on some common decision, the nature of which depends on the specific problem. This ...

EPFL2000

Solving consensus

Distributed systems are the basis of widespread computing facilities enabling many of our daily life activities. Telebanking, electronic commerce, online booking-reservation, and telecommunication are examples of common services that rely on distributed sy ...

EPFL2000

Optimistic Active Replication

André Schiper

Replication is a powerful technique for increasing availability of a distributed service. Algorithms for replicating distributed services do however face a dilemma: they should be (1) efficient (low latency), while (2) ensuring consistency of the replicas, ...

2000

Efficient Algorithms to Implement Failure Detectors and Solve Consensus in Distributed Systems

The consensus problem is a fundamental paradigm for fault-tolerant distributed computing. It abstracts a family of problems known as agreement problems, e.g., atomic broadcast, atomic commitment, group membership, and leader election. Any solution to Conse ...

2000

Making Consensus Practical

Rachid Guerraoui, Romain Boichat

This paper presents the abstraction of lazy consensus and argues for its use as an effective component for building distributed agreement protocols in practical asynchronous systems where processes and links can crash and recover. Lazy consensus looks like ...

2000

Cluster Reserves: A Mechanism for Resource Management in Cluster-based Network Servers

Willy Zwaenepoel

In network (e.g., Web) servers, it is often desirable to isolatethe performance of different classes of requests from each other. That is, one seeks to achieve that a certain minimalproportion of server resources are available for a class ofrequests, indep ...

2000

Contention-Aware Metrics for Distributed Algorithms: Comparison of Atomic Broadcast Algorithms

André Schiper, Xavier Défago

Contention-Aware Metrics for Distributed Algorithms: Comparison of Atomic Broadcast Algorithms Peter Urban, Xavier Defago and Andre Schiper Resource contention is widely recognized as having a major impact on the performance of distributed algorithms. Neve ...

2000