Affiliation:
1. University of York, York, United Kingdom
Abstract
The leading implementations of graph reduction all target conventional processors designed for low-level imperative execution. In this paper, we present a processor specially designed to perform graph-reduction. Our processor -- the Reduceron -- is implemented using off-the-shelf reconfigurable hardware. We highlight the low-level parallelism present in sequential graph reduction, and show how parallel memories and dynamic analyses are used in the Reduceron to achieve an average reduction rate of 0.55 function applications per clock-cycle.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference26 articles.
1. The spineless G-machine
2. Realisations for Non-Strict Languages
3. }}E. W. Dijkstra. A mild variant of Combinatory Logic. EWD735 1980. }}E. W. Dijkstra. A mild variant of Combinatory Logic. EWD735 1980.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Architectural Support for Functional Programming;2022 IFIP/IEEE 30th International Conference on Very Large Scale Integration (VLSI-SoC);2022-10-03
2. Structured Combinators for Efficient Graph Reduction;IEEE Computer Architecture Letters;2022-07-01
3. Cephalopode: A custom processor aimed at functional language execution for IoT devices.;2020 18th ACM-IEEE International Conference on Formal Methods and Models for System Design (MEMOCODE);2020-12-02
4. ACQuA: A Parallel Accelerator Architecture for Pure Functional Programs;2020 IEEE Computer Society Annual Symposium on VLSI (ISVLSI);2020-07
5. Weaving Parallel Threads;Search-Based Software Engineering;2015