Publication

Early Consensus in an Asynchronous System with a Weak Failure Detector

Publications associées (35)

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

Game Theory in Communications

Vojislav Gajic

Multi-user communication theory typically studies the fundamental limits of communication systems, and considers communication schemes that approach or even achieve these limits. The functioning of many such schemes assumes that users always cooperate, eve ...

EPFL2010

Expanding the Size of Organometallic Nanostructures: A Hexanuclear (Cymene)Ru Cylinder with a Length of more than 3 nm

Rosario Scopelliti, Kay Severin

Coordination cages based on organometallic half-sandwich complexes are of interest, because they can display unique structures and host properties. This communication describes the synthesis and structure of a cylindrical nanostructure containing six (p-cy ...

2009

Transactors: Unifying Transactions and Actors

Rachid Guerraoui, Martin Odersky, Mohsen Lesani

Composability and deadlock-freedom are important properties that are stated for transactional memory (TM). Commonly, the Semantics of TM requires linearization of transactions. It turns out that linearization of transactions that have cyclic communication ...

2009

Multiple Heterogeneous Ant Colonies with Information Exchange

Arash Arami, Bijan Rahimzadeh Rofoee

The method of multiple heterogeneous ant colonies with information exchange (MHACIE) is presented in this paper with emphasis on the speed of finding the optimal solution and the corresponding computational complexity. The proposed method which is inspired ...

2008

A formal approach to fault tolerant distributed consensus

Rachele Fuzzati

The term distributed Consensus denotes the problem of getting a certain number of processes, that could be far away from each other and that exchange messages through some communication means, to all agree on the same value. This problem has been proved im ...

EPFL2008

Modeling and validating the performance of atomic broadcast algorithms in high-latency networks

André Schiper, Nils Richard Ekwall

The performance of consensus and atomic broadcast algorithms using failure detectors is often affected by a trade-off between the number of communication steps and the number of messages needed to reach a decision. In this paper, we model the performance o ...

Springer2007

Atomic broadcast

Nils Richard Ekwall

Within only a couple of generations, the so-called digital revolution has taken the world by storm: today, almost all human beings interact, directly or indirectly, at some point in their life, with a computer system. Computers are present on our desks, co ...

EPFL2007

Broadcast, relay and feedback in Gaussian channels

Sibi Raj Bhaskaran Pillai

Network information theory explores the fundamental data transport limits over communication networks. Broadcasting and relaying are two natural models arising in communication contexts where multiple users share a common communication medium. Number of re ...

EPFL2007

Comparing Atomic Broadcast Algorithms in High Latency Networks

André Schiper, Nils Richard Ekwall

Since the introduction of the concept of failure detectors, several consensus and atomic broadcast algorithms based on these detectors have been published. The performance of these algorithms is often affected by a trade-off between the number of communica ...

2006

Improving Fast Paxos: being optimistic with no overhead

André Schiper

The paper addresses the cost of consensus algorithms. It has been shown that in the best case, consensus can be solved in two communication steps with f < n/2, and in one communication step with f < n/3 (f is the maximum number of faulty processes). This l ...

2006