Automated dataflow graph merging

Conference paper (2017)

Authors

Nils Voss Maxeler Technologies, Rheinisch-Westfälische Technische Hochschule
Stephen Girdlestone Maxeler Technologies
Oskar Mencer Maxeler Technologies
G. Gaydadjiev Maxeler Technologies
Affiliation
External organisation
More Info
expand_more

Published Date

13-01-2017

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Affiliation

External organisation

Abstract

In this paper we present several algorithms used to construct a tool that automatically optimizes static dataflow graphs for the purpose of high level hardware synthesis. Our target is to automatically merge multiple dataflow graphs in order to create a single structure implementing all distinct operations with minimal area overhead by time-slicing hardware resources. We show that a combination of dedicated optimizations and a simple greedy approach for graph merging reduces the overall area by up to 4x compared to a naive hardware implementation.