908 citations · 2.4k across the 149 of their papers we have counts for
5 papers · 2 filters
The Splay-List: A Distribution-Adaptive Concurrent Skip-List
Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova +1
The design and implementation of efficient concurrent data structures have seen significant attention. However, most of this work has focused on concurrent data structures providin…
Fast General Distributed Transactions with Opacity using Global Time
Alex Shamis, Matthew Renzelmann, Stanko Novakovic +6
Transactions can simplify distributed applications by hiding data distribution, concurrency, and failures from the application developer. Ideally the developer would see the abstra…
Breaking (Global) Barriers in Parallel Stochastic Optimization with Wait-Avoiding Group Averaging
Shigang Li, Tal Ben-Nun, Giorgi Nadiradze +4
Deep learning at scale is dominated by communication time. Distributing samples across nodes usually yields the best performance, but poses scaling challenges due to global informa…
Robust Comparison in Population Protocols
Dan Alistarh, Martin Töpfer, Przemysław Uznański
There has recently been a surge of interest in the computational and complexity properties of the population model, which assumes anonymous, computationally-bounded nodes, inte…
Relaxed Scheduling for Scalable Belief Propagation
Vitaly Aksenov, Dan Alistarh, Janne H. Korhonen
The ability to leverage large-scale hardware parallelism has been one of the key enablers of the accelerated recent progress in machine learning. Consequently, there has been consi…