Dan Alistarh, Trevor Brown 0001, Justin Kopinsky, Giorgi Nadiradze. Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms. In Calvin Newport, Idit Keidar, editors, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, July 23-27, 2018. pages 377-386, ACM, 2018. [doi]
@inproceedings{AlistarhBKN18,
title = {Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms},
author = {Dan Alistarh and Trevor Brown 0001 and Justin Kopinsky and Giorgi Nadiradze},
year = {2018},
url = {https://dl.acm.org/citation.cfm?id=3212756},
researchr = {https://researchr.org/publication/AlistarhBKN18},
cites = {0},
citedby = {0},
pages = {377-386},
booktitle = {Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, July 23-27, 2018},
editor = {Calvin Newport and Idit Keidar},
publisher = {ACM},
}