Publications by Ron Levy | EPFL Graph Search

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.

Fast Access to Distributed Atomic Memory

Rachid Guerraoui, Marko Vukolic, Ron Levy, Partha Dutta

We study eﬃcient and robust implementations of an atomic read-write data structure over an asynchronous distributed message-passing system made of reader and writer processes, as well as a number of servers implementing the data structure. We determine the ...

Society for Industrial and Applied Mathematics2010

Throughput Optimal Total Order Broadcast for Cluster Environments

Rachid Guerraoui, Bastian Pochon, Ron Levy

Total order broadcast is a fundamental communication primitive that plays a central role in bringing cheap software-based high availability to a wide range of services. This paper studies the practical performance of such a primitive on a cluster of homoge ...

Association for Computing Machinery2010

The Collective Memory of Amnesic Processes

Rachid Guerraoui, Bastian Pochon, James Pugh, Ron Levy

This paper considers the problem of robustly emulating a shared atomic memory over a distributed message passing system where processes can fail by crashing and possibly recover. We revisit the notion of atomicity in the crash-recovery context and introduc ...

2008

Optimistic Erasure Coded Distributed Storage

Rachid Guerraoui, Ron Levy, Partha Dutta

Erasure coded storage provides a cheap and space efficient way to tolerate failures through the use of networked commodity servers. Erasure coded data is kept on n different servers out of which f can fail. By combining encoded blocks from n-f servers, the ...

2008

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

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

High Throughput Total Order Broadcast for Cluster Environments

Rachid Guerraoui, Bastian Pochon, Ron Levy

Total order broadcast is a fundamental communication primitive that plays a central role in bringing cheap software-based high availability to a wide array of services. This paper studies the practical performance of such a primitive on a cluster of homoge ...

2006

Lucky Read/Write Access to Robust Atomic Storage

Rachid Guerraoui, Marko Vukolic, Ron Levy

This paper establishes tight bounds on the \emph{best-case} time-complexity of distributed atomic read/write storage implementations that tolerate \emph{worst-case} conditions. We study asynchronous robust implementations where a writer and a set of reader ...

2006

Ron Levy

Graph Chatbot

Chat with Graph Search

Fast Access to Distributed Atomic Memory

Throughput Optimal Total Order Broadcast for Cluster Environments

The complexity of reliable distributed storage

The Collective Memory of Amnesic Processes

Optimistic Erasure Coded Distributed Storage

Optimistic Erasure-Coded Distributed Storage

A High Throughput Atomic Storage Algorithm

High Throughput Total Order Broadcast for Cluster Environments

Lucky Read/Write Access to Robust Atomic Storage

Unconscious Eventual Consistency with Gossips

The Collective Memory of Amnesic Processes

The complexity of reliable distributed storage

Fast Access to Distributed Atomic Memory

Optimistic Erasure-Coded Distributed Storage

Throughput Optimal Total Order Broadcast for Cluster Environments

High Throughput Total Order Broadcast for Cluster Environments

A High Throughput Atomic Storage Algorithm

Lucky Read/Write Access to Robust Atomic Storage

Unconscious Eventual Consistency with Gossips

Optimistic Erasure Coded Distributed Storage