Publication

Evaluating the performance of distributed agreement algorithms

Related publications (132)

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.

Fault Tolerance by Transparent Replication for Distributed Ada 95

This paper presents the foundations of Rapids ("Replicated Ada Partitions In Distributed Systems"), an implementation of the Distributed Systems Annex E incorporating the transparent replication of partitions in distributed Ada 95 applications. Rapids is a ...

Springer Verlag1999

Muteness Failure Detectors, Specification and Implementation

Rachid Guerraoui, André Schiper

This paper extends the failures detector approach from crash-stop failures to muteness failures. Muteness failures are malicious failures in which a process stops sending algorithm messages, but might continue to send other messages, e.g. 'I-am-alive' mess ...

1999

Consensus in Asynchronous Distributed Systems: A Concise Guided Tour

Rachid Guerraoui, André Schiper

It is now recognized that the Consensus problem is a fundamental problem when one has to design and implement reliable asynchronous distributed systems. This chapter is on the Consensus problem. It studies Consensus in two failure models, namely, the Crash ...

Springer1999

Optimistic Atomic Broadcast: A Pragmatic Viewpoint

André Schiper, Fernando Pedone

This paper presents the Optimistic Atomic Broadcast algorithm (OPT-ABcast) which exploits the spontaneous total order message reception property experienced in local area networks in order to allow fast delivery of messages. The OPT-ABcast algorithm is bas ...

1999

Soft real-time analysis of asynchronous agreement algorithms using Petri nets

Nicoleta Sergent

A distributed algorithm comprises a collection of sequential-code entities, which are spread over different computers connected to a network. The process of designing a distributed algorithm is influenced by the assumptions we make on the computational env ...

EPFL1998

The CORBA object group service

Pascal Felber

Distributed computing is one of the major trends in the computer industry. As systems become more distributed, they also become more complex and have to deal with new kinds of problems, such as partial crashes and link failures. To answer the growing deman ...

EPFL1998

Protocol objects and patterns for structuring reliable distributed systems

Benoît Garbinato

This thesis is at the crossing of object-orientation and reliable distributed systems, and contributes to integrate those two research fields. Existing distributed programming environments can be characterised according to whether they rely on object conce ...

EPFL1998

The performance of the consensus algorithm running on FDDI

Nicoleta Sergent

The performance of the consensus algorithm running on FDDI N. Sergent This paper presents an application of Hierarchical Coloured Timed Petri Nets to the modelling and the performance evaluation of a distributed consensus algorithm. We took a top down modu ...

1998

Optimistic Atomic Broadcast

André Schiper, Fernando Pedone

Optimistic Atomic Broadcast F.Pedone and A.Schiper This paper presents an Optimistic Atomic Broadcast algorithm (OPT-ABcast) that exploits the spontaneous total order message reception property experienced in local area networks, in order to allow fast del ...

1998

Optimistic Atomic Broadcast

André Schiper, Fernando Pedone

1998