"Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms."

Dan Alistarh et al. (2018)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-26

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/podc/AlistarhBKN18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/podc/AlistarhBKN18
Dan Alistarh, Trevor Brown, Justin Kopinsky, Giorgi Nadiradze:
Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms. PODC 2018: 377-386

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.