Person

Bastian Pochon

This person is no longer with EPFL

Related publications (16)

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.

From a Static Impossibility to an Adaptive Lower Bound: The Complexity of Early Deciding Set Agreement

Rachid Guerraoui, Bastian Pochon

Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This is because the topological questions that underly set agreement are not about ...

2004

The Driving Philosophers

Rachid Guerraoui, Bastian Pochon

We introduce a new synchronization problem in mobile ad-hoc systems: the Driving Philosophers. In this problem, an unbounded number of driving philosophers (processes) access a round-about (set of shared resources organized along a logical ring). The crux ...

2004

The Driving Philosophers

Bastian Pochon

2004

Early Local Decisions in Distributed Agreement

Rachid Guerraoui, Bastian Pochon, Partha Dutta

When devising a distributed agreement algorithm, it is common to minimize the time complexity of global decisions, which is typically measured as the number of communication rounds needed for all correct processes to decide. In practice, what we might want ...

2003

Distributed Programming for Dummies: A Shifting Transformation Technique

Rachid Guerraoui, Bastian Pochon

The perfectly synchronized round model provides the powerful abstraction of crash-stop failures with atomic message delivery. This abstraction makes distributed programming very easy. We present an implementation of this abstraction in a distributed system ...

2003

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