Concept

Clustered file system

Related publications (230)

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.

Managing Tail Latency in Datacenter-Scale File Systems Under Production Constraints

Willy Zwaenepoel, Ricardo Bianchini, Maria Fernanda Borge Chavez

Distributed file systems often exhibit high tail latencies, especially in large-scale datacenters and in the presence of competing (and possibly higher priority) workloads. This paper introduces techniques for managing tail latencies in these systems, whil ...

ASSOC COMPUTING MACHINERY2019

Formal Approaches to Querying Big Data in Shared-Nothing Systems

Bas Ketsman

To meet today's data management needs, it is a widespread practice to use distributed data storage and processing systems. Since the publication of the MapReduce paradigm, a plethora of such systems arose, but although widespread, the capabilities of these ...

ASSOC COMPUTING MACHINERY2019

Scaling Out Bioinformatics in the Data Center

Sam David Whitlock

Whole Genome Sequencing is a process in the field of bioinformatics that transforms biological samples of DNA into an electronic dataset of genetic bases. The process consists of two sequential components. First, the laboratory process of sequencing transf ...

EPFL2019

System Support for Efficient Replication in Distributed Systems

Dragos-Adrian Seredinschi

Current online applications, such as search engines, social networks, or file sharing services, execute across a distributed network of machines. They provide non-stop services to their users despite failures in the underlying network. To achieve such a hi ...

EPFL2019

Distributed Transactional Systems Cannot Be Fast

Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Junxiong Wang, Panagiota Fatourou

We prove that no fully transactional system can provide fast read transactions (including read-only ones that are considered the most frequent in practice). Specifically, to achieve fast read transactions, the system has to give up support of transactions ...

2019

On the Hardness of the Strongly Dependent Decision Problem

Martin Biely

We present necessary and sufficient conditions for solving the strongly dependent decision (SDD) problem in various distributed systems. Our main contribution is a novel characterization of the SDD problem based on point-set topology. For partially synchro ...

ASSOC COMPUTING MACHINERY2019

Rethinking General-Purpose Decentralized Computing

Bryan Alexander Ford, Eleftherios Kokoris Kogias, Georgia Fragkouli, Enis Ceyhun Alp

While showing great promise, smart contracts are difficult to program correctly, as they need a deep understanding of cryptography and distributed algorithms, and offer limited functionality, as they have to be deterministic and cannot operate on secret da ...

ASSOC COMPUTING MACHINERY2019

Caching and Distributed Storage

Saeid Sahraei

A simple task of storing a database or transferring it to a different point via a communication channel turns far more complex as the size of the database grows large. Limited bandwidth available for transmission plays a central role in this predicament. I ...

EPFL2018

Distributed Transactions: Dissecting the Nightmare

Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Junxiong Wang

Many distributed storage systems are transactional and a lot of work has been devoted to optimizing their performance, especially the performance of read-only transactions that are considered the most frequent in practice. Yet, the results obtained so far ...

2018

Monotonic Prefix Consistency in Distributed Systems

Rachid Guerraoui, Jad Hamza, Dragos-Adrian Seredinschi

We study the issue of data consistency in distributed systems. Specifically, we consider a distributed system that replicates its data at multiple sites, which is prone to partitions, and which is assumed to be available (in the sense that queries are alwa ...

2018