Concept

MapReduce

Publications associées (41)

Fast Gaussian Process Regression Using KD-Trees

The computation required for Gaussian process regression with n training examples is about O(n^3) during training and O(n) for each prediction. This makes Gaussian process regression too slow for large datasets. In this paper, we present a fast approximati ...

2006

Streaming of Scalable Video from Multiple Servers using Rateless Codes

Pascal Frossard, Jean-Paul Wagner

This paper presents a framework for efficiently streaming scalable video from multiple servers over heterogeneous network paths. We propose to use rateless codes, or Fountain codes, such that each server acts as an independent source, without the need to c ...

2006

The Alpha of Indulgent Consensus

Rachid Guerraoui

This paper presents a simple framework unifying a family of consensus algorithms that can tolerate process crash failures and asynchronous periods of the network, also called indulgent consensus algorithms. Key to the framework is a new abstraction we intr ...

2006

Parallelization and scheduling of data intensive particle physics analysis jobs on clusters of PCs

Roger Hersch, Sébastien Ponce

Scheduling policies are proposed for parallelizing data intensive particle physics analysis applications on computer clusters. Particle physics analysis jobs require the analysis of tens of thousands of particle collision events, each event requiring typic ...

IEEE Computer Society, Los Alamitos;Massey University, Palmerston, CA 90720-1314, United States;New Zealand2004

Using Optimistic Atomic Broadcast in Transaction Processing Systems

André Schiper, Matthias Wiesmann, Fernando Pedone

Atomic broadcast primitives are often proposed as a mechanism to allow fault-tolerant cooperation between sites in a distributed system. Unfortunately, the delay incurred before a message can be delivered makes it difficult to implement high performance, s ...

2001

Selective, accurate, and timely self-invalidation using last-touch prediction

Babak Falsafi

Communication in cache-coherent distributed shared memory (DSM) often requires invalidating (or writing back) cached copies of a memory block, incurring high overheads. This paper proposes Last-Touch Predictors (LTPs) that learn and predict the “last touch ...

2000

Using Optimistic Atomic Broadcast in Transaction Processing Systems

André Schiper, Fernando Pedone

1999

Transaction Reordering in Replicated Databases

Rachid Guerraoui, André Schiper, Fernando Pedone

Transaction Reordering in Replicated Databases F.Pedone, R.Guerraoui and A.Schiper This paper presents a fault-tolerant lazy replication protocol that ensures 1-copy serializability at a relatively low cost. Unlike eager replication approaches, our protoco ...

1997

Transaction Reordering in Replicated Databases

Rachid Guerraoui, André Schiper, Fernando Pedone

1997

Lazy Release Consistency for Software Distributed Shared Memory

Willy Zwaenepoel

Release consistency, a relaxed memory consistency model that reduces the impact of remote memory access latency in both software and hardware distributed shared memory, is considered. To reduce the number of messages and the amount of data exchanged for re ...

1992

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