Publication

Fault-tolerant and transactional mobile agent execution

Related publications (38)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Approaches to Fault-Tolerant and Transactional Mobile Agent Execution -- An Algorithmic View

André Schiper, Stefan Pleisch

Over the past years, mobile agent technology has attracted considerable attention, and a significant body of literature has been published. To further develop mobile agent technology, reliability mechanisms such as fault tolerance and transaction support a ...

2004

How fast can a distributed atomic read be?

Rachid Guerraoui, Ron Levy, Partha Dutta, Arindam Chakraborty

This paper addresses the problem of designing an efficient implementation of a basic atomic read-write data structure over an asynchronous message-passing system. In particular, we consider time-efficient implementations of this abstraction in the case of ...

2004

The Complexity of Asynchronous Byzantine Consensus

Rachid Guerraoui, Marko Vukolic, Partha Dutta

This paper establishes the first theorem relating resilience, round complexity and authentication in distributed computing. We give an exact measure of the time complexity of consensus algorithms that tolerate Byzantine failures and arbitrary long periods ...

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

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

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

FATOMAS - A Fault-Tolerant Mobile Agent System Based on the Agent-Dependent Approach

André Schiper, Stefan Pleisch

Fault tolerance is fundamental to the further development of mobile agent applications. In the context of mobile agents, fault-tolerance prevents a partial or complete loss of the agent, i.e., it ensures that the agent arrives at its destination. In this p ...

IEEE Computer Society2001

Open Multithreaded Transactions: Keeping Threads and Exceptions under Control

Jörg Kienzle

Although transactional models have proved to be very useful for numerous applications, the development of new models to reflect the ever-increasing complexity and diversity of modern applications is a very active area of research. Analysis of the existing ...

IEEE Computer Society Press2001

Solving consensus

Distributed systems are the basis of widespread computing facilities enabling many of our daily life activities. Telebanking, electronic commerce, online booking-reservation, and telecommunication are examples of common services that rely on distributed sy ...

EPFL2000

Efficient Algorithms to Implement Failure Detectors and Solve Consensus in Distributed Systems

The consensus problem is a fundamental paradigm for fault-tolerant distributed computing. It abstracts a family of problems known as agreement problems, e.g., atomic broadcast, atomic commitment, group membership, and leader election. Any solution to Conse ...

2000