Spatial hardware implementation for sparse graph algorithms in GraphStep
How do we develop programs that are easy to express, easy to reason about, and able to achieve high performance on massively parallel machines? To address this problem, we introduce GraphStep, a domain-specific compute model that captures algorithms that act on static, irregular, sparse graphs. In G...
Saved in:
Main Authors: | , , , |
---|---|
其他作者: | |
格式: | Article |
語言: | English |
出版: |
2015
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/81195 http://hdl.handle.net/10220/39184 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |