Publication

System Support for Efficient Replication in Distributed Systems

Publications associées (83)

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

Almost-Invariants: From Bugs in Distributed Systems to Invariants

Dejan Kostic, Marco Canini, Maysam Yabandeh, Abhishek Anand

It is notoriously hard to develop dependable distributed systems. This is partly due to the difficulties in foreseeing various corner cases and failure scenarios while implementing a system that will be deployed over an asynchronous network. In contrast, r ...

2009

Sharing of probabilistically correlated data in peer-to-peer networks

Roman Schmidt

The impact of Peer-to-Peer (P2P) networks on the Internet landscape is undisputed. It has led to a series of new applications, e.g., as part of the so-called Web 2.0. The shift from the classical client-server based paradigm of the Internet, with a clear d ...

EPFL2008

Optimistic Erasure-Coded Distributed Storage

Rachid Guerraoui, Ron Levy, Partha Dutta

We study erasure-coded atomic register implementations in an asynchronous crash-recovery model. Erasure coding provides a cheap and space-efficient way to tolerate failures in a distributed system. This paper presents ORCAS, Optimistic eRasure-Coded Atomic ...

2008

Efficient Object Placement Including Node Selection in a Distributed Virtual Machine

David Atienza Alonso

Currently, software engineering is becoming even more complex due to distributed computing. In this new context, portability while providing the programmer with the single system image of a classical Java Virtual Machine (JVM) is one of the key issues. Hen ...

IOS Press2008

The Perfectly-Synchronized Round-based Model of Distributed Computing

Rachid Guerraoui, Bastian Pochon

The perfectly-synchronized round-based model provides the powerful abstraction of crash-stop failures with atomic and synchronous message delivery. This abstraction makes distributed programming very easy.We describe a technique to automatically transform ...

2007

Language Evolution as a Darwinian Process: Computational Studies

Frédéric Kaplan

This paper presents computational experiments that illustrate how one can precisely conceptualize language evolution as a Darwinian process. We show that there is potentially a wide diversity of replicating units and replication mechanisms involved in lang ...

2007

Incremental Adaptive Strategies Over Distributed Networks

Ali H. Sayed

An adaptive distributed strategy is developed based on incremental techniques. The proposed scheme addresses the problem of linear estimation in a cooperative fashion, in which nodes equipped with local computing abilities derive local estimates and share ...

Institute of Electrical and Electronics Engineers2007

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

A High Throughput Atomic Storage Algorithm

Rachid Guerraoui, Dejan Kostic, Ron Levy

This paper presents an algorithm to ensure the atomicity of a distributed storage that can be read and written by any number of clients. In failure-free and synchronous situations, and even if there is contention, our algorithm has a high write throughput ...

2007

SoS: self-organizing substrates

Anwitaman Datta

Large-scale networked systems often, both by design or chance exhibit self-organizing properties. Understanding self-organization using tools from cybernetics, particularly modeling them as Markov processes is a first step towards a formal framework which ...

EPFL2006