Publication

Robust Emulations of Shared Memory in a Crash-Recovery Model

Publications associées (127)

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

Multiclass Latent Locally Linear Support Vector Machines

Barbara Caputo, Marco Fornoni

Kernelized Support Vector Machines (SVM) have gained the status of o-the-shelf classiers, able to deliver state of the art performance on almost any problem. Still, their practical use is constrained by their computational and memory complexity, which grow ...

2013

Fast encoding techniques for Multiview Video Coding

Pascal Frossard

Multiview Video Coding (MVC) is a technique that permits efficient compression of multiview video. MVC uses variable block size motion and disparity estimation for block matching. This requires an exhaustive search process that involves all possible macro- ...

Elsevier Science Bv2013

LLR Compression for BICM Systems Using Large Constellations

Bixio Rimoldi, Stefano Rosati

Digital video broadcasting (DVB-C2) and other modern communication standards increase diversity by means of a symbol-level interleaver that spans over several codewords. Deinterleaving at the receiver requires a large memory, which has a significant impact ...

Institute of Electrical and Electronics Engineers2013

Introducing Speculation in Self-Stabilization: An Application to Mutual Exclusion

Rachid Guerraoui

Self-stabilization ensures that, after any transient fault, the system recovers in a finite time and eventually exhibits correct behavior. Speculation consists in guaranteeing that the system satisfies its requirements for any execution but exhibits signif ...

2013

Asynchronous Gossip

Rachid Guerraoui, Seth Gilbert

We study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. We show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. The algorithmic techniques prop ...

Association for Computing Machinery2013

Convergent Message-Passing Algorithms in the Presence of Erasures

Nicholas Ruozzi

We examine how to design convergent and correct message-passing schemes, similar to the min-sum algorithm, for maximum a posteriori (MAP) estimation in the case that the messages passed between two nodes of the network may never be delivered. The proposed ...

Ieee2013

Randomized versus Deterministic Implementations of Concurrent Data Structures

Dan Alistarh

One of the key trends in computing over the past two decades has been increased distribution, both at the processor level, where multi-core architectures are now the norm, and at the system level, where many key services are currently distributed overmulti ...

EPFL2012

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficien ...

Springer Verlag2012

Speculative Linearizability

Rachid Guerraoui, Viktor Kuncak, Giuliano Losa

Linearizability is a key design methodology for reasoning about implementations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusion that operations execute sequentially and fault-free, despite the a ...

Assoc Computing Machinery2012

How to Allocate Tasks Asynchronously

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Asynchronous task allocation is a fundamental problem in distributed computing, in which p asyn- chronous processes must execute a set of m tasks. Also known as write-all or do-all, this problem been studied extensively, both independently and as a key bui ...

2012