Concept

Write amplification

Publications associées (40)

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

Evaluating and Repairing Write Performance on Flash Devices

Anastasia Ailamaki, Frederick Ryan Johnson, Manoussos Gavriil Athanassoulis, Radu Ioan Stoica

In the last few years NAND flash storage has become more and more popular as price per GB and capacity both improve at exponential rates. Flash memory offers significant benefits compared to magnetic hard disk drives (HDDs) and DBMSs are highly likely to u ...

2009

Brain oscillatory substrates of visual short-term memory capacity

Friedhelm Christoph Hummel

The amount of information that can be stored in visual short-term memory is strictly limited to about four items. Therefore, memory capacity relies not only on the successful retention of relevant information but also on efficient suppression of distractin ...

2009

The complexity of reliable distributed storage

Ron Levy

Distributed storage systems based on commodity hardware have gained in popularity because they are cheaper, can be made more reliable and offer better scalability than centralized storage systems. However, implementing and managing such systems is more com ...

EPFL2008

How Fast Can a Very Robust Read Be?

Rachid Guerraoui, Marko Vukolic

This paper studies the time complexity of reading unauthenticated data from a distributed storage made of a set of failure-prone base objects. More specifically, we consider the abstraction of a robust read/write storage that provides wait-free access to u ...

2006

How Fast Can a Very Robust Read Be?

Rachid Guerraoui, Marko Vukolic

2006

Optimal Asynchronous Garbage Collection for RDT Checkpointing Protocols

Rodrigo Malta Schmidt, Fernando Pedone

Communication-induced checkpointing protocols that ensure rollback-dependency trackability (RDT) guarantee important properties to the recovery system without explicit coordination. However, to the best of our knowledge, there was no garbage collection alg ...

2005

Optimal Asynchronous Garbage Collection for Checkpointing Protocols with Rollback-Dependency Trackability

Rodrigo Malta Schmidt, Fernando Pedone

2004

Robust Emulations of Shared Memory in a Crash-Recovery Model

Rachid Guerraoui, Ron Levy

A shared memory abstraction can be robustly emulated over an asynchronous message passing system where any process can fail by crashing and possibly recover (crash-recovery model), by having (a) the processes exchange messages to synchronize their read and ...

2004

Holographic memory with localized recording

Demetri Psaltis

We experimentally demonstrate and characterize a memory module that features selective page erasure and readout persistence using the localized recording method in doubly doped LiNbO3. Pages of information can be selectively erased without partially erasin ...

2001

eNVy: A Non-Volatile Main Memory Storage System

Willy Zwaenepoel

This paper describes the architecture of eNVy, a large non-volatile main memory storage system built primarily with Flash memory. eNVy presents its storage space as a linear, memory mapped array rather than as an emulated disk in order to provide an effici ...

1994