Limits of Statically-Scheduled Token Dataflow Processing
FPGA-based token dataflow processing has been shown to accelerate hard-to-parallelize problems exhibiting irregular dataflow parallelism by as much as an order of magnitude when compared to conventional compute organizations. However, when the structure of the dataflow computation is known upfront,...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Conference Paper |
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/81240 http://hdl.handle.net/10220/39193 |