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

Stochastic Algorithm and Analysis of amino-acyl-tRNA Competition in Translation

This work deals with the creation of a stochastic algorithm for aa-tRNA competition during translation using an abstraction of the biological model. The major challenges were to manage aa-tRNA specie specific input information in order to deal with eventua ...

2010

Swift Algorithms for Repeated Consensus

André Schiper, Martin Hutle, Fatemeh Borran, Nuno Filipe de Sousa Santos

We introduce the notion of a swift algorithm. Informally, an algorithm that solves the repeated consensus is swift if, in a partial synchronous run of this algorithm, eventually no timeout expires, i.e., the algorithm execution proceeds with the actual spe ...

EPFL2010

Swift Algorithms for Repeated Consensus

André Schiper, Martin Hutle, Fatemeh Borran, Nuno Filipe de Sousa Santos

We introduce the notion of a swift algorithm. Informally, an algorithm that solves the repeated consensus is swift if, in a partial synchronous run of this algorithm, eventually no timeout expires, i.e., the algorithm execution proceeds with the actual spe ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2010

A Leader-Free Byzantine Consensus Algorithm

André Schiper, Fatemeh Borran

The paper considers the consensus problem in a partially synchronous system with Byzantine faults. It turns out that, in the partially synchronous system, all deterministic algorithms that solve consensus with Byzantine faults are leader-based. This is not ...

Springer-Verlag2010

A Leader-Free Byzantine Consensus Algorithm

André Schiper, Fatemeh Borran

The paper considers the consensus problem in a partially synchronous system with Byzantine faults. It turns out that, in the partially synchronous system, all deterministic algorithms that solve consensus with Byzantine faults are leader-based. This is not ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Fast Access to Distributed Atomic Memory

Rachid Guerraoui, Marko Vukolic, Ron Levy, Partha Dutta

We study eﬃcient and robust implementations of an atomic read-write data structure over an asynchronous distributed message-passing system made of reader and writer processes, as well as a number of servers implementing the data structure. We determine the ...

Society for Industrial and Applied Mathematics2010

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)

Rachid Guerraoui, Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

Gossip, also known as epidemic dissemination, is becoming an increasingly popular technique in distributed systems. Yet, it has remained a partially open question: how robust are such protocols? We consider a natural extension of the random phone-call mode ...

2010

Routing Attacks as a Viable Threat: Can Software Systems Protect Themselves?

Dan Alistarh

In this paper, we show that distributed systems are vul- nerable to routing attacks and propose an architecture to obviate this vulnerability. A somewhat surprising finding is that even a small-scale routing attack can completely dis- rupt the operation of ...

2010

Model-Based Estimation of Three-Dimensional Stiffness Parameters in Photonic-Force Microscopy

Michaël Unser, Andrzej Kulik, Philippe Thévenaz, Elena Bertseva, Amardeep Singh

We propose a system to characterize the 3-D diffusion properties of the probing bead trapped by a photonic-force microscope. We follow a model-based approach, where the model of the dynamics of the bead is given by the Langevin equation. Our procedure comb ...

Institute of Electrical and Electronics Engineers2010

Scheduling periodic tasks in a hard real-time environment

Friedrich Eisenbrand, Martin Niemeier, Nicolai Hähnle

We give a rigorous account on the complexity landscape of an important real-time scheduling problem that occurs in the design of software-based aircraft control. The goal is to distribute tasks

\tau_i=(c_i,p_i)

on a minimum number of identical machines a ...

Springer-Verlag2010

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

Graph Chatbot

Chat with Graph Search

Stochastic Algorithm and Analysis of amino-acyl-tRNA Competition in Translation

Swift Algorithms for Repeated Consensus

Swift Algorithms for Repeated Consensus

A Leader-Free Byzantine Consensus Algorithm

A Leader-Free Byzantine Consensus Algorithm

Fast Access to Distributed Atomic Memory

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)

Routing Attacks as a Viable Threat: Can Software Systems Protect Themselves?

Model-Based Estimation of Three-Dimensional Stiffness Parameters in Photonic-Force Microscopy

Scheduling periodic tasks in a hard real-time environment

Stochastic Algorithm and Analysis of amino-acyl-tRNA Competition in Translation

Swift Algorithms for Repeated Consensus

Swift Algorithms for Repeated Consensus

A Leader-Free Byzantine Consensus Algorithm

Model-Based Estimation of Three-Dimensional Stiffness Parameters in Photonic-Force Microscopy

Routing Attacks as a Viable Threat: Can Software Systems Protect Themselves?

A Leader-Free Byzantine Consensus Algorithm

Fast Access to Distributed Atomic Memory

Scheduling periodic tasks in a hard real-time environment

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)