Immediately after power-up, synchronous distributed systems need some time until essential timing properties, which are required to operate correctly, are established. We say that synchronous systems are initially in asynchronous operation. In this paper, we present an algorithm and ar-chitectural guidelines that assure the transition from asyn-chronous to synchronous operation within a bounded dura-tion even in case of failures.
Abstract—We investigate whether asynchronous computational models and asynchronous algorithms can be...
We propose a new algorithm for recovering asynchronously from failures in a distributed computation....
So far, we have mainly studied synchronous algorithms. Generally, asynchronous algorithms are more d...
We address the problem of the impossibility of implementing synchronous fault-tolerant service speci...
SRI International A general method is described for implementing a distributed system with any desir...
Local synchrony is a distributed approach to providing logically synchronous capabilities in an asyn...
AbstractIn this paper we show how a distributed system with synchronous processors and asynchronous ...
The distributed consensus problem arises when several processes need to reach a common decision desp...
Texto completo: acesso restrito. p. 18-31The capability of dynamically adapting to distinct runtime ...
This work investigates the amount of information about failures required to simulate a synchronous d...
Fault tolerance in distributed computing is a wide area with a significant body of literature that i...
Fault tolerance in distributed computing is a wide area with a significant body of literature that i...
AbstractWe describe a new fault-tolerant algorithm for solving a variant of Lamport's clock synchron...
The fail-stop failure model appears frequently in the distributed systems literature. However, in a...
The development of reliable distributed software is simplified by the ability to assume a fail-stop...
Abstract—We investigate whether asynchronous computational models and asynchronous algorithms can be...
We propose a new algorithm for recovering asynchronously from failures in a distributed computation....
So far, we have mainly studied synchronous algorithms. Generally, asynchronous algorithms are more d...
We address the problem of the impossibility of implementing synchronous fault-tolerant service speci...
SRI International A general method is described for implementing a distributed system with any desir...
Local synchrony is a distributed approach to providing logically synchronous capabilities in an asyn...
AbstractIn this paper we show how a distributed system with synchronous processors and asynchronous ...
The distributed consensus problem arises when several processes need to reach a common decision desp...
Texto completo: acesso restrito. p. 18-31The capability of dynamically adapting to distinct runtime ...
This work investigates the amount of information about failures required to simulate a synchronous d...
Fault tolerance in distributed computing is a wide area with a significant body of literature that i...
Fault tolerance in distributed computing is a wide area with a significant body of literature that i...
AbstractWe describe a new fault-tolerant algorithm for solving a variant of Lamport's clock synchron...
The fail-stop failure model appears frequently in the distributed systems literature. However, in a...
The development of reliable distributed software is simplified by the ability to assume a fail-stop...
Abstract—We investigate whether asynchronous computational models and asynchronous algorithms can be...
We propose a new algorithm for recovering asynchronously from failures in a distributed computation....
So far, we have mainly studied synchronous algorithms. Generally, asynchronous algorithms are more d...