Concept

Réplication (informatique)

Publications associées (218)

Distributed Planar Manipulation in Fluidic Environments

We present a distributed control mechanism allowing a swarm of non-holonomic autonomous surface vehicles (ASVs) to synchronously arrange around a rectangular floating object in a grasping formation; the swarm is then able to collaboratively transport the o ...

Ieee2016

Pfimbi: Accelerating Big Data Jobs Through Flow-Controlled Data Replication

Florin Dinu

The performance of HDFS is critical to big data software stacks and has been at the forefront of recent efforts from the industry and the open source community. A key problem is the lack of flexibility in how data replication is performed. To address this ...

2016

The Case for RackOut: Scalable Data Serving Using Rack-Scale Systems

Babak Falsafi, Edouard Bugnion, Boris Robert Grot, Alexandros Daglis, Stanko Novakovic

To provide low latency and high throughput guarantees, most large key-value stores keep the data in the memory of many servers. Despite the natural parallelism across lookups, the load imbalance, introduced by heavy skew in the popularity distribution of k ...

2016

Atum: Scalable Group Communication Using Volatile Groups

Rachid Guerraoui, Anne-Marie Kermarrec, Dragos-Adrian Seredinschi, Matej Pavlovic

This paper presents Atum, a group communication middleware for a large, dynamic, and hostile environment. At the heart of Atum lies the novel concept of volatile groups: small, dynamic groups of nodes, each executing a state machine replication protocol, o ...

ACM Press2016

Who's On Board? Probabilistic Membership for Real-Time Distributed Control Systems (Extended)

Rachid Guerraoui, David Kozhaya, Yvonne Anne Pignolet-Oswald

To increase their dependability, distributed control systems (DCSs) need to agree in real time about which hosts have crashed, i.e., they need a real-time membership service. In this paper, we prove that such a service cannot be implemented deterministical ...

SRDS2016

WHO'S ON BOARD? Probabilistic Membership for Real-Time Distributed Control Systems

Rachid Guerraoui, David Kozhaya

To increase their dependability, distributed control systems (DCSs) need to agree in real time about crashed hosts, i.e., they need a real-time membership service. In this paper, we prove that such a service cannot be implemented deterministically if, besi ...

Ieee2016

The Weakest Failure Detector for Eventual Consistency

Rachid Guerraoui, Pierre Sens

In its classical form, a consistent replicated service requires all replicas to witness the same evolution of the service state. Assuming a message-passing environment with a majority of correct processes, the necessary and sufficient information about fai ...

ACM Press2015

Hawk: Hybrid Datacenter Scheduling

Willy Zwaenepoel, Anne-Marie Kermarrec, Pamela Isabel Delgado Borda, Florin Dinu

This paper addresses the problem of efficient scheduling of large clusters under high load and heterogeneous workloads. A heterogeneous workload typically consists of many short jobs and a small number of large jobs that consume the bulk of the cluster's r ...

USENIX Association2015

A simple model-based approach to variable selection in classification and clustering

Anthony Christopher Davison, Vahid Partovi Nia

Clustering and classification of replicated data is often performed using classical techniques that inappropriately treat the data as unreplicated, or by complex modern ones that are computationally demanding. In this paper, we introduce a simple approach ...

Wiley-Blackwell2015

CoShare: A Cost-effective Data Sharing System for Data Center Networks

Karl Aberer, Rameez Rahman, Hao Zhuang, Imen Filali

Numerous research groups and other organizations collect data from popular data sources such as online social networks. This leads to the problem of data islands, wherein all this data is isolated and lying idly, without any use to the community at large. ...

2015

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