2 citations · 2 across the 2 of their papers we have counts for
6 papers
Multi-Queues Can Be State-of-the-Art Priority Schedulers
Anastasiia Postnikova, Nikita Koval, Giorgi Nadiradze +1
Designing and implementing efficient parallel priority schedulers is an active research area. An intriguing proposed design is the Multi-Queue: given threads and disti…
Efficiency Guarantees for Parallel Incremental Algorithms under Relaxed Schedulers
Dan Alistarh, Nikita Koval, Giorgi Nadiradze
Several classic problems in graph processing and computational geometry are solved via incremental algorithms, which split computation into a series of small tasks acting on shared…
Dynamic Averaging Load Balancing on Cycles
Dan Alistarh, Giorgi Nadiradze, Amirmojtaba Sabour
We consider the following dynamic load-balancing process: given an underlying graph with nodes, in each step , one unit of load is created, and placed at a randoml…
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms
Dan Alistarh, Trevor Brown, Justin Kopinsky +1
There has been significant progress in understanding the parallelism inherent to iterative sequential algorithms: for many classic algorithms, the depth of the dependence structure…
The Transactional Conflict Problem
Dan Alistarh, Syed Kamran Haider, Raphael Kübler +1
The transactional conflict problem arises in transactional systems whenever two or more concurrent transactions clash on a data item. While the standard solution to such conflicts…
The Power of Choice in Priority Scheduling
Dan Alistarh, Justin Kopinsky, Jerry Li +1
Consider the following random process: we are given queues, into which elements of increasing labels are inserted uniformly at random. To remove an element, we pick two queues…