Concept

Tolérance aux pannes

Publications associées (174)

Atomic broadcast

Within only a couple of generations, the so-called digital revolution has taken the world by storm: today, almost all human beings interact, directly or indirectly, at some point in their life, with a computer system. Computers are present on our desks, co ...

EPFL2007

Fault-Tolerant Logic Gates Using Neuromorphic CMOS Circuits

Alexandre Schmid, Yusuf Leblebici, Neil Joye

Fault-tolerant design methods for VLSI circuits, which have traditionally been addressed at system level, will not be adequate for future very-deep submicron CMOS devices where serious degradation of reliability is expected. Therefore, a new design approac ...

IEEE2007

The Heard-Of Model: Computing in Distributed Systems with Benign Failures

André Schiper

Problems in fault-tolerant distributed computing have been studied in a variety of models. These models are structured around two central ideas: Degree of synchrony and failure model are two independent parameters that determine a particular type of system ...

2007

Multiple Description Coding with Redundant Expansions and Application to Image Communications

Pascal Frossard, Ivana Radulovic

Multiple description coding offers an elegant and competitive solution for data transmission over lossy packetbased networks, with a graceful degradation in quality as losses increase. In the same time, coding techniques based on redundant transforms give ...

2007

Refined Quorum Systems

Rachid Guerraoui, Marko Vukolic

It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform fast if few failures occur, the system is synchronous and there is no contenti ...

2007

Query-load balancing in structured overlays

Karl Aberer, Anwitaman Datta, Roman Schmidt

Query-load (forwarding and answering) balancing in structured overlays is one of the most critical and least studied problems. It has been assumed that caching heuristics can take care of it. We expose that caching, while necessary, is not in itself suffic ...

2007

The Algebra of Connectors — Structuring Interaction in BIP

Joseph Sifakis, Simon Bliudze

We provide an algebraic formalisation of connectors in BIP. These are used to structure interactions in a component-based system. A connector relates a set of typed ports. Types are used to describe different modes of synchronisation: rendezvous and broadc ...

ACM2007

Refined Quorum Systems

Rachid Guerraoui, Marko Vukolic

2007

A Methodology for Reliability Enhancement of Nanometer- Scale Digital Systems Based on A-Priori Functional Fault- Tolerance Analysis

Alexandre Schmid, Yusuf Leblebici, Milos Stanisavljevic

This paper presents a new approach for monitoring and estimating device reliability of nanometer-scale devices prior to fabrication. A four-layer architecture exhibiting a large immunity to permanent as well as random failures is used. A complete tool for ...

Springer2007

Studying Error Resilience Performance for a Feedback Channel Based Transform Domain Wyner-Ziv Video Codec

Touradj Ebrahimi, Frédéric Dufaux

Wyner-Ziv (WZ) video coding is an emerging video coding paradigm based on two major Information Theory results: the Slepian-Wolf and Wyner-Ziv theorems. One of the most interesting and used WZ video coding architectures makes use of a feedback channel (FC) ...

2007

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