Optimizing ordered graph algorithms with GraphIt
© 2020 Copyright held by the owner/author(s). Many graph problems can be solved using ordered parallel graph algorithms that achieve significant speedup over their unordered counterparts by reducing redundant work. This paper introduces a new priority-based extension to GraphIt, a domain-specific la...
| 主要な著者: | , , , , , , |
|---|---|
| フォーマット: | 論文 |
| 言語: | English |
| 出版事項: |
ACM
2021
|
| オンライン･アクセス: | https://hdl.handle.net/1721.1/132253 |