Soft real-time analysis of asynchronous agreement algorithms using Petri nets
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.
We propose ODPOP, a new distributed algorithm for \textit{open multiagent combinatorial optimization} \cite{Faltings2005c}. The ODOP algorithm explores the same search space as the dynamic programming algorithm DPOP~\cite{Petcu2005} or the AND/OR search al ...
In this paper, we study dynamic protocol update (DPU). Contrary to local code updates on-the-fly, DPU requires global coordination of local code replacements. We propose a novel solution to DPU. The key idea is to add a level of indirection between the ser ...
The paper addresses the cost of consensus algorithms. It has been shown that in the best case, consensus can be solved in two communication steps with f < n/2, and in one communication step with f < n/3 (f is the maximum number of faulty processes). This l ...
Consensus is one of the key problems in fault tolerant distributed computing. A very popular model for solving consensus is the failure detector model defined by Chandra and Toueg. However, the failure detector model has limitations. The paper points out t ...
Problems in fault-tolerant distributed computing have been studied in a variety of models. These models are structured around two central ideas: 1. Degree of synchrony and failure model are two independent parameters that determine a particular type of sys ...
A novel algorithm is introduced for estimating the echo path responses for stereophonic acoustic echo cancellation. When the Wiener solution for the echo path responses is non-unique, the echo paths are estimated in two stages. In a first stage, one of the ...
Iterative Learning Control (ILC) is a technique used to improve the tracking performance of systems carrying out repetitive tasks, which are affected by deterministic disturbances. The achievable performance is greatly degraded, however, when non-repeating ...
Many reliable distributed systems are consensus-based and typically operate under two modes: a fast normal mode in failure-free synchronous periods, and a slower recovery mode following asynchrony and failures. A lot of work has been devoted to optimize th ...
This paper presents a distributed algorithm to disseminate events in a publish/subscribe system, where processes publish events of certain topics, organized in a hierarchy, and expect events of topics they subscribed to. Every topic defines a dynamic notio ...
An indulgent algorithm is a distributed algorithm that, besides tolerating process failures, also tolerates arbitrarily long periods of instability, with an unbounded number of timing and scheduling failures. In particular, no process can take any irrevoca ...
