Recursive bipartitioning of signal flow graphs for programmable video signal processors

We consider the problem of partitioning video algorithms over an arbitrary network of high-performance video signal processors. The partitioning problem under consideration is very hard due to the many constraints that need to be satisfied. We present a solution strategy based on a recursive biparti...

Full description

Saved in:
Bibliographic Details
Main Authors: Aarts, E.H.L., Essink, G., de Kock, E.A.
Format: Conference Proceeding
Language:English
Subjects:
Digital signal processing
Flow graphs
Partitioning algorithms
Processor scheduling
Routing
Signal mapping
Signal processing
Signal processing algorithms
Time factors
Video signal processing
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider the problem of partitioning video algorithms over an arbitrary network of high-performance video signal processors. The partitioning problem under consideration is very hard due to the many constraints that need to be satisfied. We present a solution strategy based on a recursive bipartitioning approach, which effectively handles the routing of the data flows through the network under time and resource constraints. The bipartitions are generated using a variable-depth search algorithm. We present results for industrially relevant video algorithms.
ISSN:1066-1409
2377-6323
DOI:10.1109/EDTC.1996.494341