research
∙
04/18/2023
Provably-Efficient and Internally-Deterministic Parallel Union-Find
Determining the degree of inherent parallelism in classical sequential a...
share
research
∙
10/14/2022
Hybrid Decentralized Optimization: First- and Zeroth-Order Optimizers Can Be Jointly Leveraged For Faster Convergence
Distributed optimization has become one of the standard ways of speeding...
research
∙
06/20/2022
QuAFL: Federated Averaging Can Be Both Asynchronous and Communication-Efficient
Federated Learning (FL) is an emerging paradigm to enable the large-scal...
research
∙
09/02/2021
Multi-Queues Can Be State-of-the-Art Priority Schedulers
Designing and implementing efficient parallel priority schedulers is an ...
research
∙
08/05/2021
Lower Bounds for Shared-Memory Leader Election under Bounded Write Contention
This paper gives tight logarithmic lower bounds on the solo step complex...
research
∙
03/20/2020
Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers
Several classic problems in graph processing and computational geometry ...
research
∙
03/20/2020
Dynamic Averaging Load Balancing on Cycles
We consider the following dynamic load-balancing process: given an under...
research
∙
10/27/2019
PopSGD: Decentralized Stochastic Gradient Descent in the Population Model
The population model is a standard way to represent large-scale decentra...
research
∙
08/13/2018
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms
There has been significant progress in understanding the parallelism inh...
research
∙
04/03/2018
Distributionally Linearizable Data Structures
Relaxed concurrent data structures have become increasingly popular, due...
research
∙
04/03/2018
