Publication

A General Characterization of Indulgence (Invited Paper)

Publications associées (35)

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

Frugal Mobile Objects

Rachid Guerraoui, Maxime Monod, Benoît Garbinato, Jesper Honig Spring

This paper presents a computing model for resource-limited mobile devices. The originality of the model lies in the integration of a stronglytyped event-based communication paradigm with abstractions for frugal control, assuming a small footprint runtime. ...

2006

REVERSE TRANSFER OF NANOSTENCIL PATTERNS USING INTERMEDIATE SACRIFICIAL LAYER AND LIFT-OFF

Jürgen Brugger, Marc Antonius Friedrich van den Boogaart, Oscar Vazquez Mena

We have developed a new process for reversing the nanostencil patterns by using an intermediate sacrificial layer. Using this process, we can pattern isolated ‘empty’ shapes with their background filled with a certain material, which is impossible with the ...

2006

Time-complexity bounds on agreement problems

Partha Dutta

In many distributed systems, designing an application that maintains consistency and availability despite failure of processes, involves solving some form of agreement. Not surprisingly, providing efficient agreement algorithms is critical for improving th ...

EPFL2005

Performance Comparison of a Rotating Coordinator and a Leader Based Consensus Algorithm

André Schiper

Performance Comparison of a Rotating Coordinator and a Leader Based Consensus Algorithm Peter Urban, Naohiro Hayashibara, Andre Schiper, and Takuya Katayama Protocols that solve agreement problems are essential building blocks for fault tolerant distribute ...

2004

Evaluating the performance of distributed agreement algorithms

Nowadays, networked computers are present in most aspects of everyday life. Moreover, essential parts of society come to depend on distributed systems formed of networked computers, thus making such systems secure and fault tolerant is a top priority. If t ...

EPFL2003

Goals and Business Rules as the Central Design Mechanism

Gil Regev, Alain Wegmann

Current UML based behavioral requirements focus on the specification of use cases. Business rules are seen as a very important part of the requirements but are either considered as a separate entity or, at best, attached to use cases. Some authors have rec ...

2001

Chasing the FLP Impossibility Result in a LAN or How Robust Can a Fault Tolerant Server Be?

André Schiper, Xavier Défago

Fault tolerance can be achieved in distributed systems by replication. However, Fischer, Lynch and Paterson have proven an impossibility result about consensus in the asynchronous system model. Similar impossibility results have been established for atomic ...

2001

Chasing the FLP Impossibility Result in a LAN or How Robust Can a Fault Tolerant Server Be?

André Schiper, Xavier Défago

Peter Urban, Xavier Defago and Andre Schiper: Chasing the FLP Impossibility Result in a LAN or How Robust Can a Fault Tolerant Server Be? Keywords: replication, atomic broadcast, consensus, measurements, robustness, high load, LAN, FLP impossibility Abstra ...

2001

Asynchronous Leasing

Rachid Guerraoui, Partha Dutta, Romain Boichat

Leasing is a very effective way to improve the performance of distributed algorithms without hampering their fault-tolerance. The notion of lease has traditionally been defined using a global notion of time and was hence strongly tied to synchronous system ...

2001

Agreement-related problems

Xavier Défago

Agreement problems constitute a fundamental class of problems in the context of distributed systems. All agreement problems follow a common pattern: all processes must agree on some common decision, the nature of which depends on the specific problem. This ...

EPFL2000