Publication

Model Checking of Distributed Algorithm Implementations

Related publications (89)

An Efficient Universal Construction for Message-Passing Systems

Rachid Guerraoui, Bastian Pochon, Partha Dutta

A universal construction is an algorithm that transforms any object with a sequential specification into a wait-free and linearizable implementation of that object. This paper presents a novel universal construction algorithm for a message-passing system w ...

2002

Asynchronous Leasing

Rachid Guerraoui, Partha Dutta, Romain Boichat

Leasing is a very effective way to improve the performance of distributed algorithms without hampering their fault-tolerance. The notion of lease has traditionally been defined using a global notion of time and was hence strongly tied to synchronous system ...

2001

Effective Multicast Programming in Large Scale Distributed Systems

Rachid Guerraoui, Patrick Eugster

Many distributed applications have a strong requirement for efficient dissemination of large amounts of information to widely spread consumers in large networks. These include applications in e-commerce and telecommunication. Publish/subscribe is considere ...

2001

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

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

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

Parallelization of population-based evolutionary algorithms for combinatorial optimization problems

The objective of the present work is to make efficient parallelization of evolutionary algorithms (EA) easier in order to solve large instances of difficult combinatorial optimization problems within an acceptable amount of time, on parallel computer archi ...

EPFL1999

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

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

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

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.