Recursive Bipartitioning of Signal Flow Graphs for Programmable Video Signal Processors

Authors:
E. H. L. Aarts;G. Essink;E. A. de Kock
Affiliations:
Philips Research, Prof. Holstlaan 4, 5656 AA Eindhoven, The Netherlands;Philips Research, Prof. Holstlaan 4, 5656 AA Eindhoven, The Netherlands;Philips Research, Prof. Holstlaan 4, 5656 AA Eindhoven, The Netherlands
Venue:
EDTC '96 Proceedings of the 1996 European conference on Design and Test
Year:
1996

Citing 6
Cited 5

Partitioning Problems in Parallel, Pipeline, and Distributed Computing

IEEE Transactions on Computers
VLSI cell placement techniques

ACM Computing Surveys (CSUR)
Efficient Algorithms for a Class of Partitioning Problems

IEEE Transactions on Parallel and Distributed Systems
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Cheops: a reconfigurable data-flow system for video processing

IEEE Transactions on Circuits and Systems for Video Technology

Partitioning of VLSI circuits and systems

DAC '96 Proceedings of the 33rd annual Design Automation Conference
A Clustering Approach to Explore Grain-Sizes in the Definitionof Processing Elements in Dataflow Architectures

Journal of VLSI Signal Processing Systems - Special issue on the 1997 IEEE workshop on signal processing systems (SiPS): design and implementation
A codesign back-end approach for embedded system design

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Real-time scheduling in video systems

Engineering of distributed control systems
A generic multi-unit architecture for codesign methodologies

CODES '97 Proceedings of the 5th International Workshop on Hardware/Software Co-Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.