Publication

Speculative sequential consistency with little custom storage

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

Reliable Distributed Storage

Rachid Guerraoui, Marko Vukolic

Storage is nowadays commonly provided as a service, accessed by clients over a network. A distributed storage service provides clients with the abstraction of a single reliable shared storage device, using a collection of possibly unreliable computing unit ...

2008

Data storage device and refreshing method for use with such device

Serguei Okhonin

A data storage device such as a DRAM memory having a plurality of data storage cells 10 is disclosed. Each data storage cell 10 has a physical parameter which varies with time and represents one of two binary logic states. A selection circuit 16, writing c ...

2007

Amnesic Distributed Storage

Rachid Guerraoui

Distributed storage algorithms implement the abstraction of a shared register over distributed base objects. We study a specific class of storage algorithms, which we call amnesic: these have the pragmatic property that old values written in the implemente ...

2007

The Weight-Watcher Service and its Lightweight Implementation

Rachid Guerraoui, Maxime Monod, Benoît Garbinato, Jesper Honig Spring, Alexei Kounine

This paper presents the Weight-Watcher service. This service aims at providing resource consumption measurements and estimations for software executing on resource constrained devices. By using the Weight-Watcher, software components can continuously adapt ...

2007

Spatial Memory Streaming

Anastasia Ailamaki, Babak Falsafi

Prior research indicates that there is much spatial variation in applications' memory access patterns. Modern memory systems, however, use small fixed-size cache blocks and as such cannot exploit the variation. Increasing the block size would not only proh ...

2006

Reliability Support for On-chip Memories Using Networks-on-Chips

Giovanni De Micheli, David Atienza Alonso, Luca Benini, Srinivasan Murali, Federico Angiolini

As the geometries of the transistors reach the physical limits of operation, one of the main design challenges of Systems-on-Chips (SoCs) will be to provide dynamic (run-time) support against permanent and intermittent faults that can occur in the system. ...

2006

The Granularity of Soft-Error Containment in Shared-Memory Multiprocessors

Babak Falsafi

Concerns over rising soft-error rates in processor logic has led to numerous proposals for error tolerance mechanisms. In this paper, we examine the role of soft-error containment in a shared memory multiprocessor. We study a range of design alternatives b ...

2006

The Alpha of Indulgent Consensus

Rachid Guerraoui

This paper presents a simple framework unifying a family of consensus algorithms that can tolerate process crash failures and asynchronous periods of the network, also called indulgent consensus algorithms. Key to the framework is a new abstraction we intr ...

2006

TRUSS: A Reliable, Scalable Server Architecture

Babak Falsafi

Traditional reliable servers require costly design changes to the processor, use custom system or application software, or cannot scale beyond a few processing elements. We present TRUSS, a family of server architectures providing reliable, scalable comput ...

2005

Internet-scale storage systems under churn - A steady state analysis

Karl Aberer, Anwitaman Datta

Content storage in a distributed collaborative environment uses redundancy for better resilience. This redundancy is either achieved by pure replication or using erasure codes for more efficient utilization of available storage. Increasingly such schemes a ...

2005