Reliability of clustered vs. declustered replica placement in data storage systems
Graph Chatbot
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.
For further miniaturization of magnetic data storage devices, instruments for exploring magnetic nanostructures are needed. Hall sensors provide a non invasive technique for quantitative magnetic field detection. In contrast to the highly sensitive semicon ...
Presentation at the International symposium on Museums of the Future, which was organized for the presentation of the first draft of KMoMA. The presentaiton outlined the approach that cultural institutions can be civic, social, and cultural cornerstones fo ...
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 ...
Many new applications, for example Wikis, social networks, and distributed recommender systems, require the efficient integration of decentralized and heterogenous data sources at a large scale. In this paper, we present our vision of a universal storage f ...
This paper reports an optofluidic architecture which enables reversible trapping, detection and long term storage of spectrally multiplexed semiconductor quantum dot cocktails in electrokinetically active wells ranging in size from 200nm to 5 mu m. Here we ...
Magnetic nanostructures have long been in the focus of intense research in the magnetic storage industry. For data storage the nonvolatility of magnetic states is of utmost relevance. As information technology generates the need for higher and higher data- ...
Challenges in nanotechnology today involve controlling dimensions, inter-particle spacing, surface coverage and behavior/response of functional nanostructures. Creating or placing nanostructures on surfaces is important for applications like data storage, ...
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 ...
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 ...
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 ...
