908 citations · 2.4k across the 149 of their papers we have counts for
5 papers · 2 filters
Collecting Coupons is Faster with Friends
Dan Alistarh, Peter Davies
In this note, we introduce a distributed twist on the classic coupon collector problem: a set of collectors wish to each obtain a set of coupons; for this, they can each sa…
CGX: Adaptive System Support for Communication-Efficient Deep Learning
Ilia Markov, Hamidreza Ramezanikebrya, Dan Alistarh
The ability to scale out training workloads has been one of the key performance enablers of deep learning. The main scaling approach is data-parallel GPU-based training, which has…
Lower Bounds for Shared-Memory Leader Election under Bounded Write Contention
Dan Alistarh, Rati Gelashvili, Giorgi Nadiradze
This paper gives tight logarithmic lower bounds on the solo step complexity of leader election in an asynchronous shared-memory model with single-writer multi-reader (SWMR) registe…
Wait-free approximate agreement on graphs
Dan Alistarh, Faith Ellen, Joel Rybicki
Approximate agreement is one of the few variants of consensus that can be solved in a wait-free manner in asynchronous systems where processes communicate by reading and writing to…
Fast Graphical Population Protocols
Dan Alistarh, Rati Gelashvili, Joel Rybicki
Let be a graph on nodes. In the stochastic population protocol model, a collection of indistinguishable, resource-limited nodes collectively solve tasks via pairwise in…