Concept

Système de fichiers distribué

Publications associées (105)

SPADE: Tuning scale-out OLTP on modern RDMA clusters

Rachid Guerraoui, Aleksandar Dragojevic, Georgios Chatzopoulos

Distributed transactions on modern RDMA clusters promise high throughput and low latency for scale-out workloads. As such, they can be particularly beneficial to large OLTP workloads, which require both. However, achieving good performance requires tuning ...

Association for Computing Machinery2018

Scalable Bias-Resistant Distributed Randomness

Bryan Alexander Ford, Linus Gasser, Eleftherios Kokoris Kogias, Philipp Svetolik Jovanovic, Nicolas Gailly, Ismail Khoffi

Bias-resistant public randomness is a critical component in many (distributed) protocols. Existing solutions do not scale to hundreds or thousands of participants, as is needed in many decentralized systems. We propose two large-scale distributed protocols ...

Ieee2017

Mapping large organizations

Dario Rodighiero

Today organizations are more than ever complex systems. They are large, ramified, distributed, and intertwined so that their organic structure seems like a tangle of activities. Day by day individuals contribute to keep these structures alive with their wo ...

2017

Rack-Scale Memory Pooling for Datacenters

Stanko Novakovic

The rise of web-scale services has led to a staggering growth in user data on the Internet. To transform such a vast raw data into valuable information for the user and provide quality assurances, it is important to minimize access latency and enable in-me ...

EPFL2017

Multicloud Resource Allocation

Hao Zhuang

Nowadays our daily life is not only powered by water, electricity, gas and telephony but by "cloud" as well. Big cloud vendors such as Amazon, Microsoft and Google have built large-scale centralized data centers to achieve economies of scale, on-demand res ...

EPFL2017

Multitask Diffusion Adaptation Over Networks With Common Latent Representations

Ali H. Sayed, Jie Chen

Online learning with streaming data in a distributed and collaborative manner can be useful in a wide range of applications. This topic has been receiving considerable attention in recent years with emphasis on both single-task and multitask scenarios. In ...

2017

Efficient Decentralized Visual Place Recognition From Full-Image Descriptors

Davide Scaramuzza, Titus Cieslewski

In this paper, we discuss the adaptation of our decentralized place recognition method described in [1] to fullimage descriptors. As we had shown, the key to making a scalable decentralized visual place recognition lies in exploting deterministic key assig ...

2017

Why You Can't Beat Blockchains: Consistency and High Availability in Distributed Systems

Rachid Guerraoui, Jad Hamza, Dragos-Adrian Seredinschi

We study the issue of data consistency in highly-available distributed systems. Specifically, we consider a distributed system that replicates its data at multiple sites, which is prone to partitions, and which is expected to be highly available. In such a ...

arxiv2017

Optimizing Information Leakage in Multicloud Storage Services

Karl Aberer, Rameez Rahman, Hao Zhuang

Many schemes have been recently advanced for storing data on multiple clouds. Distributing data over multiple cloud storage providers automatically provides users with a certain degree of information leakage control, for no single point of attack can leak ...

2016

Distributed Graph-Based Control of Convoys of Heterogeneous Vehicles using Curvilinear Road Coordinates

Alcherio Martinoli, Milos Vasic, Inaki Navarro Oiza, Florian Zimmermann

This paper investigates the problem of controlling a heterogeneous group of vehicles with the aim of forming multi-lane convoys. We use a distributed, graph-based control law, implemented in a longitudinal coordinate system parallel to the road. Each vehic ...

Ieee2016

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