Soft real-time analysis of asynchronous agreement algorithms using Petri nets

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 developed a space and time adaptive method to simulate electroosmosis and mass transport of a sample concentration within a network of microchannels. The space adaptive criteria is based on an error estimator derived using anisotropic interpolation esti ...

This thesis inquires how map annotations can be used to sustain remote collaboration. Maps condense the interplay of space and communication, solving linguistic references by linking conversational content to the actual places to which it refers. This is a ...

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 ...

This paper considers the problem of robustly emulating a shared atomic memory over a distributed message passing system where processes can fail by crashing and possibly recover. We revisit the notion of atomicity in the crash-recovery context and introduc ...

This article presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their performance in finding sparse signal representations in redundant dictionaries. These algorithms can be split into a sensing an ...

Max-min fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing it; in most, but not all cases, they are based on the notion of bottlenecks. In spite ...

We present a general framework and an efficient algorithm for tracking relevant video structures. The structures to be tracked are implicitly defined by a Matching Pursuit procedure that extracts and ranks the most important image contours. Based on the ra ...

How often have you been able to implement an algorithm as it is described in a paper? And when you did, were you confident that you had exactly the same parameter values and results as the authors of the paper? All too often, articles do not describe all t ...

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 ...

In 1971, the first microprocessor produced in mass production had 2300 transistor and was able to compute 60'000 operations per second at 740 kHz. Nowadays, even a common gaming console uses a central unit including 243 millions of transistors running at 4 ...

This paper addresses the problem of choosing the best streaming policy for distortion optimal multipath video delivery, under delay constraints. The streaming policy consists in a joint selection of the video packets to be transmitted, as well as their sen ...

In this paper we present a numerical model in which both the thermal and the electromagnetic aspects of the over-critical current regime of HTS materials are taken into account. The electromagnetic and thermal equations have been implemented in finite elem ...

Soft real-time analysis of asynchronous agreement algorithms using Petri nets

Chat with Graph Search

Space-time adaptive algorithms for parabolic problems : a posteriori error estimates and application to microfluidics

Annotations of maps in collaborative work at a distance

A Statistical Analysis of Certain Iterative Learning Control Algorithms

The Collective Memory of Amnesic Processes

Dictionary preconditioning for greedy algorithms

A Unified Framework for Max-Min and Min-Max Fairness with Applications

Tracking Atoms with Particles for Audio-visual Source Localization

Experiences with Reproducible Research in Various Facets of Signal Processing Research

The Overhead of Consensus Failure Recovery

A profiling framework for high level design space exploration for memory and system architectures

Packet Selection and Scheduling for Multipath Video Streaming

Finite-element modelling of YBCO fault current limiter with temperature dependent parameters