Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms

DOI10.1145/3212734.3212756zbMath1428.68359arXiv1808.04155OpenAlexW2886779068MaRDI QIDQ5197703

Giorgi Nadiradze, Trevor Brown, Justin Kopinsky, Dan Alistarh

Publication date: 19 September 2019

Published in: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.04155

zbMATH Keywords

task schedulingmaximal independent setconcurrent data structuresrelaxed data structures

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items (1)

Quantifiability: a concurrent correctness condition modeled in vector space

This page was built for publication: Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms