Publication

Safety-Liveness Exclusion in Distributed Computing

Related publications (32)

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.

Safety-Liveness Exclusion in Distributed Computing

Rachid Guerraoui, Victor Bushkov

The history of distributed computing is full of trade-offs between safety and liveness. For instance, one of the most celebrated results in the field, namely the impossibility of consensus in an asynchronous system basically says that we cannot devise an a ...

ACM Press2015

The Materials Genome Approach (MGA) aims to accelerate development of new materials by incorporating computational and data-driven approaches to reduce the cost of identification of optimal structures for a given application. Here, we use the MGA to guide ...

Amer Chemical Soc2014

Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The impossibility of fault-tolerant set agreement in asynchronous networks is one of the seminal ...

2012

Data-driven tuning of linear parameter varying precompensators

Alireza Karimi, Mark Edward John Butcher

Methods for direct data-driven tuning of the parameters of precompensators for LPV systems are developed. Since the commutativity property is not always satisfied for LPV systems, previously proposed methods for LTI systems that use this property cannot be ...

Wiley-Blackwell2010

This paper asks how much liveness a transactional memory (TM) implementation can guarantee. We first devise a formal framework for reasoning about liveness properties of TMs. Then, we prove that the strongest liveness property that a TM can ensure in an as ...

2009

Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Springer2009

This paper studies obstruction-free software transactional memory systems (OFTMs). These systems are appealing, for they combine the atomicity property of transactions with a liveness property that ensures the commitment of every transaction that eventuall ...

ACM2008

2008

A novel scheme for processing packets in a router is presented that provides load sharing among multiple network processors distributed within the router. It is complemented by a feedback control mechanism designed to prevent processor overload. Incoming t ...

2008

We study property (T) and the fixed point property for actions on Lp and other Banach spaces. We show that property (T) holds when L2 is replaced by Lp (and even a subspace/quotient of Lp), and that in fact it is independent of 1 ≤ p < ∞. We show that the ...

2007