Publications by Dan Alistarh | EPFL Graph Search

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficien ...

Springer Verlag2012

The Complexity of Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

We study the complexity of renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct names from a given namespace. We prove an individual lower bound of Omega(k) process steps for deterministic renaming into ...

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

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficien ...

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

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

We give two new randomized algorithms for tight renaming, both of which work against an adaptive adversary. The first uses repeated sampling over a sequence of arrays of decreasing size to assign unique names to each of

n

processes with step complexity $ ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

Sub-Logarithmic Test-and-Set Against a Weak Adversary

Dan Alistarh

A randomized implementation is given of a test-and-set register with O(log log it) individual step complexity and O(n) total step complexity against an oblivious adversary. The implementation is linearizable and multi-shot, and shows an exponential complex ...

Springer-Verlag Berlin2011

Fast Randomized Test-and-Set and Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh, Hagit Albo Attiya, Andrei Giurgiu

Most people believe that renaming is easy: simply choose a name \emph{at random}; if more than one process selects the same name, then try again. We highlight the issues that occur when trying to implement such a scheme and shed new light on the read-write ...

2010

Fast Randomized Test-and-Set and Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh, Hagit Albo Attiya, Andrei Giurgiu

Most people believe that renaming is easy: simply choose a name \emph{at random}; if more than one process selects the same name, then try again. We highlight the issues that occur when trying to implement such a scheme and shed new light on the read-write ...

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

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

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 in- creasingly popular technique in distributed systems. Yet, it has remained a partially open question: how robust are such protocols? We consider a natural ex- tension of the random phone-call ...

Springer2010

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

Dan Alistarh

Graph Chatbot

Chat with Graph Search

Generating Fast Indulgent Algorithms

The Complexity of Renaming

Generating Fast Indulgent Algorithms

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Sub-Logarithmic Test-and-Set Against a Weak Adversary

Fast Randomized Test-and-Set and Renaming

Fast Randomized Test-and-Set and Renaming

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

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

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

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

Generating Fast Indulgent Algorithms

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

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

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

Fast Randomized Test-and-Set and Renaming

Generating Fast Indulgent Algorithms

The Complexity of Renaming

Sub-Logarithmic Test-and-Set Against a Weak Adversary

Fast Randomized Test-and-Set and Renaming