13 citations · 31 across the 13 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018★ 13 cited
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…
cs.DC2018★ 3 cited
Distributionally Linearizable Data Structures
Dan Alistarh, Trevor Brown, Justin Kopinsky +2
Relaxed concurrent data structures have become increasingly popular, due to their scalability in graph processing and machine learning applications. Despite considerable interest,…