Person
Dan Alistarh
This person is no longer with EPFL
Related publications (23)
The splay-list: a distribution-adaptive concurrent skip-list
Amirkeivan Mohtashami, Dan Alistarh
The design and implementation of efficient concurrent data structures has seen significant attention. However, most of this work has focused on concurrent data structures providing good worst-case guarantees, although, in real workloads, objects are often ...
SPRINGER2023NUQSGD: Provably Communication-efficient Data-parallel SGD via Nonuniform Quantization
As the size and complexity of models and datasets grow, so does the need for communication-efficient variants of stochastic gradient descent that can be deployed to perform parallel model training. One popular communication-compression method for data-para ...
MICROTOME PUBL2021Tight Bounds for Asynchronous Renaming
Rachid Guerraoui, Seth Gilbert, Dan Alistarh
This article presents the first tight bounds on the time complexity of shared-memory renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct identifiers from a small namespace. We first prove an individual ...
Association for Computing Machinery2014How to Allocate Tasks Asynchronously
Rachid Guerraoui, Seth Gilbert, Dan Alistarh
Asynchronous task allocation is a fundamental problem in distributed computing, in which p asyn- chronous processes must execute a set of m tasks. Also known as write-all or do-all, this problem been studied extensively, both independently and as a key bui ...
2012On the cost of composing shared-memory algorithms
Rachid Guerraoui, Dan Alistarh, Giuliano Losa
Decades of research in distributed computing have led to a variety of perspectives on what it means for a concurrent algorithm to be efficient, depending on model assumptions, progress guarantees, and complexity metrics. It is therefore natural to ask whet ...
ACM Press2012Early Deciding Synchronous Renaming in O( logf ) Rounds or Less
Rachid Guerraoui, Dan Alistarh, Hagit Albo Attiya
Renaming is a fundamental problem in distributed computing, in which a set of n processes need to pick unique names from a namespace of limited size. In this paper, we present the first early-deciding upper bounds for synchronous renaming, in which the run ...
Springer Berlin Heidelberg2012How to Allocate Tasks Asynchronously
Rachid Guerraoui, Seth Gilbert, Dan Alistarh
Asynchronous task allocation is a fundamental problem in distributed computing in which p asynchronous processes must execute a set of m tasks. Also known as write-all or do-all, this problem been studied extensively, both independently and as a key buildi ...
IEEE2012Of 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 ...
2012Of 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 ...
2012Randomized versus Deterministic Implementations of Concurrent Data Structures
One of the key trends in computing over the past two decades has been increased distribution, both at the processor level, where multi-core architectures are now the norm, and at the system level, where many key services are currently distributed overmulti ...
EPFL2012