Spatial hardware implementation for sparse graph algorithms in GraphStep

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Delorimier, Michael, Kapre, Nachiket, Mehta, Nikil, Dehon, André
Other Authors: School of Computer Engineering
Format: Article
Language:English
Published: 2015
Subjects:
Languages
Spatial computing
Compute model
Algorithms
Performance
Parallel programming
Graph algorithm
graphStep
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

Internet

https://hdl.handle.net/10356/81195
http://hdl.handle.net/10220/39184

Similar Items