Register Requirement Minimization of Fixed-Depth Pipelines for Streaming Data Applications

Thomas Goldbrunner, Nguyen Anh Vu Doan, Diogo Pocas, Thomas Wild, Andreas Herkersdorf

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a method that can be used to map control/data flow graphs into fixed-depth pipelines targeted at FPGA design. The main objective for the design is to reduce the register resources which are needed to forward data within the processing pipeline. We show that these requirements can be reduced by appropriate task scheduling. Starting from an intuitive network flow based scheduling approach, we develop a linear programming model of the task scheduling problem. This allows us to efficiently create schedules which are provably optimal with regard to the objective of minimal register usage.

Original languageEnglish
Title of host publicationProceedings - 32nd IEEE International System on Chip Conference, SOCC 2019
EditorsDanella Zhao, Arindam Basu, Magdy Bayoumi, Gwee Bah Hwee, Ge Tong, Ramalingam Sridhar
PublisherIEEE Computer Society
Pages406-411
Number of pages6
ISBN (Electronic)9781728134826
DOIs
StatePublished - Sep 2019
Event32nd IEEE International System on Chip Conference, SOCC 2019 - Singapore, Singapore
Duration: 3 Sep 20196 Sep 2019

Publication series

NameInternational System on Chip Conference
Volume2019-September
ISSN (Print)2164-1676
ISSN (Electronic)2164-1706

Conference

Conference32nd IEEE International System on Chip Conference, SOCC 2019
Country/TerritorySingapore
CitySingapore
Period3/09/196/09/19

Fingerprint

Dive into the research topics of 'Register Requirement Minimization of Fixed-Depth Pipelines for Streaming Data Applications'. Together they form a unique fingerprint.

Cite this