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: | Delorimier, Michael, Kapre, Nachiket, Mehta, Nikil, Dehon, André |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Article |
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/81195 http://hdl.handle.net/10220/39184 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
An effective and efficient parallel approach for random graph generation over GPUs
by: Bressan, S., et al.
Published: (2014) -
On the vector space of a-like matrices for tadpole graphs
by: Gillesania, Chester James Kent I., et al.
Published: (2016) -
Fast random graph generation
by: Nobari, S., et al.
Published: (2013) -
Square of an oriented graph
by: Macariola, Francesca, et al.
Published: (2016) -
Scalable Data-Parallel graph algorithms from generation to management
by: SADEGH HEYRANI NOBARI
Published: (2012)