The Reduceron: Widening the von Neumann Bottleneck for Graph Reduction using an FPGA
Cached
Download Links
- [www-users.cs.york.ac.uk]
- [www.cs.york.ac.uk]
- [www-users.cs.york.ac.uk]
- DBLP
Other Repositories/Bibliography
| Citations: | 4 - 3 self |
BibTeX
@MISC{Naylor_thereduceron:,
author = {Matthew Naylor and Colin Runciman},
title = {The Reduceron: Widening the von Neumann Bottleneck for Graph Reduction using an FPGA},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. For the memory intensive task of graph reduction, modern PCs are limited not by processor speed, but by the rate that data can travel between processor and memory. This limitation is known as the von Neumann bottleneck. We explore the effect of widening this bottleneck using a special-purpose graph reduction machine with wide, parallel memories. Our prototype machine – the Reduceron – is implemented using an FPGA, and is based on a simple template-instantiation evaluator. Running at only 91.5MHz on an FPGA, the Reduceron is faster than mature bytecode implementations of Haskell running on a 2.8GHz PC. 1
