Concept

Durabilité (informatique)

Publications associées (60)

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

On the Hardness of Failure-Sensitive Agreement Problems

Rachid Guerraoui

In [CT96], [FRT99], and [SM95], respectively, it was stated that the weakest failure detector for any of non-blocking atomic commit, terminating reliable broadcast and leader election, is the Perfect failure detector P. This paper presents a counter exampl ...

2000

Indulgent Algorithms

Rachid Guerraoui

Informally, an indulgent algorithm is a distributed algorithm that tolerates unreliable failure detection: the algorithm is indulgent towards its failure detector. This paper formally characterizes such algorithms and states some of their interesting featu ...

2000

Exception Handling in Open Multithreaded Transactions

Jörg Kienzle

This paper describes a model for providing transaction support for object-oriented concurrent programming languages. In order to achieve seamless integration, the use of the concurrency features provided by the programming language should not be restricted ...

2000

Database Replication Prototype

This report describes the design of a Replication Framework that facilitates the implementation and com-parison of database replication techniques. Furthermore, it discusses the implementation of a Database Replication Prototype and compares the performanc ...

2000

Database Replication Techniques: a three parameter classification

André Schiper, Matthias Wiesmann, Fernando Pedone

Data replication is an increasingly important topic as databases are more and more deployed over clusters of workstations. One of the challenges in database replication is to introduce replication without severely affecting performance. Because of this dif ...

IEEE Computer Society2000

A Systematic Classification of Replicated Database Protocols based on Atomic Broadcast

André Schiper, Matthias Wiesmann, Fernando Pedone

Database replication protocols based on group communication primitives have recently emerged as a promising technology to improve database fault-tolerance and performance. Roughly speaking, this approach consists in exploiting the order and atomicity prope ...

1999

The Database State Machine Approach

Rachid Guerraoui, André Schiper, Fernando Pedone

Database replication protocols have historically been built on top of distributed database systems, and have consequently been designed and implemented using distributed transactional mechanisms, such as atomic commitment. We present the database state mac ...

1999

On Transaction Liveness in Replicated Databases

Rachid Guerraoui, Fernando Pedone

On Transaction Liveness in Replicated Databases F.Pedone and R.Guerraoui This paper makes a first attempt to give a precise characterisation of liveness in replicated database systems. We introduce the notion of liveness degrees, which express the expectat ...

1997

The Decentralized Non-Blocking Atomic Commitment Protocol

Rachid Guerraoui, André Schiper

In a transactional system, an atomic commitment protocol ensures that for any transaction, all data managers agree on the same outcome: commit or abort. A non-blocking atomic commitment protocol enables an outcome to be decided at every correct data manage ...

1995

Non Blocking Atomic Commitment with an Unreliable Failure Detector

Rachid Guerraoui, André Schiper

In a transactional system, an {\em atomic commitment} protocol ensures that for any transaction, all {\em Data Manager} processes agree on the same outcome {\em (commit} or {\em abort)}. A {\em non-blocking atomic commitment} protocol enables an outcome to ...

1995