Publication

Rethinking General-Purpose Decentralized Computing

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

Model Checking of Distributed Algorithm Implementations

Maysam Yabandeh

It is notoriously difficult to develop reliable, high-performance distributed systems that run over asynchronous networks. Even if a distributed system is based on a well-understood distributed algorithm, its implementation can contain errors arising from ...

EPFL2011

Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms

André Schiper, Martin Hutle, Fatemeh Borran

We compare in an analytical way two leader-based and decentralized algorithms (that is, algorithms that do not use a leader) for Byzantine consensus with strong validity. We show that for \emph{the algorithms we analyzed}, in most cases, the decentralized ...

IEEE2011

Timing Analysis of Leader-based and Decentralized Byzantine Consensus Algorithms

André Schiper, Martin Hutle, Fatemeh Borran

We compare in an analytical way two leader-based and decentralized algorithms (that is, algorithms that do not use a leader) for Byzantine consensus with strong validity. We show that for the algorithms we analyzed, in most cases, the decentralized variant ...

2010

Diffusion Least-Mean Squares Over Adaptive Networks

Ali H. Sayed

Distributed adaptive algorithms are proposed to address the problem of estimation in distributed networks. We extend recent work by relying on static and adaptive diffusion strategies. The resulting adaptive networks are robust to node and link failures an ...

IEEE2007

Scale-up of batch processes via decentralized control

Dominique Bonvin, Benoît Chachuat, Michael Amrhein, Alejandro Gabriel Marchetti

The economic environment in the specialty chemicals industry requires short times to market and thus the ability to develop new products and processes very rapidly. This, in turn, calls for large scale-ups from laboratory to production. Due to scale-relate ...

2006

Distributed link-based ranking in P2P Web retrieval

Jie Wu

One of the main differences between modern search engines and traditional ones is the adoption of link-based ranking algorithm in ordering Web documents. Google has claimed that it is its link-based ranking algorithm, PageRank that has made the quality of ...

EPFL2006

Semantic Overlay Networks

Karl Aberer, Philippe Cudré-Mauroux

In a handful of years only, Peer-to-Peer (P2P) systems have become an integral part of the Internet. After a few key successes related to music-sharing (e.g., Napster or Gnutella), they rapidly developed and are nowadays firmly established in various conte ...

2005

Comparing Distributed Consensus Algorithms

André Schiper

Peter Urban and Andre Schiper Comparing Distributed Consensus Algorithms Protocols that solve agreement problems are essential building blocks for fault tolerant distributed systems. While many protocols have been published, little has been done to analyze ...

2004

Comparing the Performance of Two Consensus Algorithms with Centralized and Decentralized Communication Schemes

André Schiper

Comparing the Performance of Two Consensus Algorithms with Centralized and Decentralized Communication Schemes Peter Urban and Andre Schiper Protocols that solve agreement problems are essential building blocks for fault tolerant distributed systems. While ...

2004

Decentralized Network Coding

Christina Fragouli, Emina Soljanin

This paper proposes deterministic algorithms for decentralized network coding. Decentralized coding allows to locally specify the coding operations at network nodes without knowledge of the overall network topology, and to accommodate future changes in the ...

2004