Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Dan Alistarh' in GoogleThis author has not been identified. Look up 'Trevor Brown 0001' in GoogleThis author has not been identified. Look up 'Justin Kopinsky' in GoogleThis author has not been identified. Look up 'Giorgi Nadiradze' in Google

runs on WebDSL