Pipeline Synthesis and Optimization from Branched Feedback Dataflow Programs

Large dataflow designs are a result of behavioral specification of modern complex digital systems and/or a result of unfolding and transforming looped and branched programs. Since deep-submicron silicon technology provides large amounts of available resources, pipelining optimization without (or wit...

Full description

Saved in:
Bibliographic Details
Published in:Journal of signal processing systems 2020-10, Vol.92 (10), p.1091-1099
Main Authors: Prihozhy, Anatoly, Casale-Brunet, Simone, Bezati, Endri, Mattavelli, Marco
Format: Article
Language:English
Subjects:
Algorithms
Circuits and Systems
Computer Imaging
Computing time
Cryptography
Digital systems
Electrical Engineering
Engineering
Feedback
Genetic algorithms
High level synthesis
Image processing
Image Processing and Computer Vision
Optimization
Pattern Recognition
Pattern Recognition and Graphics
Pipelines
Signal,Image and Speech Processing
Video communication
Vision
Wireless communications
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Large dataflow designs are a result of behavioral specification of modern complex digital systems and/or a result of unfolding and transforming looped and branched programs. Since deep-submicron silicon technology provides large amounts of available resources, pipelining optimization without (or with minimal) resource sharing can give significant advantages in performance. High-level synthesis of CAL-programs is particularly popular in computation intensive applications (e.g., image and video processing, cryptography, wireless communication, etc.) where feedback actors with data flows at input and output ports represent loop-like behavior. In this work, we propose techniques for transforming, analysis, speculatively pipelining and optimizing large branched feedback dataflow programs. We develop an accurate algorithm and introduce fast dynamic and mixed static / dynamic heuristics that firstly minimize the number of pipeline stages for a given pipeline-stage time-period, and secondly minimize the overall pipeline registers size by means of appropriate assignment of feedbacks and instructions to pipeline stages. We also propose a genetic algorithm for tuning the heuristics for a particular design. The experimental results show the algorithms we propose give quickly solutions that are very close to accurate solutions and overcomes the earlier developed algorithms regarding computing time and pipeline parameters.
ISSN:1939-8018
1939-8115
DOI:10.1007/s11265-020-01568-5