Recursive bipartitioning of signal flow graphs for programmable video signal processors

E.H.L. Aarts; G. Essink; E.L. Kock, de

doi:10.1109/EDTC.1996.494341

Recursive bipartitioning of signal flow graphs for programmable video signal processors

E.H.L. Aarts, G. Essink, E.L. Kock, de

Algorithms

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

3 Citations (Scopus)

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.

Original language	English
Title of host publication	Proceedings of the 1996 European Conference on Design and Test, EDTC 1996
Publisher	Association for Computing Machinery, Inc.
Pages	460-466
Number of pages	7
ISBN (Electronic)	0818674237, 9780818674235
DOIs	https://doi.org/10.1109/EDTC.1996.494341
Publication status	Published - 1996
Event	1996 European Conference on Design and Test, EDTC 1996 - Paris, France Duration: 11 Mar 1996 → 14 Mar 1996

Conference

Conference	1996 European Conference on Design and Test, EDTC 1996
Country/Territory	France
City	Paris
Period	11/03/96 → 14/03/96

Keywords

Graph partitioning
Local search
Realtime video signal processing

Access to Document

10.1109/EDTC.1996.494341

Cite this

@inproceedings{90cffa652df348a6838550f5d01eaaa6,

title = "Recursive bipartitioning of signal flow graphs for programmable video signal processors",

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.",

keywords = "Graph partitioning, Local search, Realtime video signal processing",

author = "E.H.L. Aarts and G. Essink and {Kock, de}, E.L.",

year = "1996",

doi = "10.1109/EDTC.1996.494341",

language = "English",

pages = "460--466",

booktitle = "Proceedings of the 1996 European Conference on Design and Test, EDTC 1996",

publisher = "Association for Computing Machinery, Inc.",

address = "United States",

note = "1996 European Conference on Design and Test, EDTC 1996 ; Conference date: 11-03-1996 Through 14-03-1996",

}

Aarts, EHL, Essink, G & Kock, de, EL 1996, Recursive bipartitioning of signal flow graphs for programmable video signal processors. in Proceedings of the 1996 European Conference on Design and Test, EDTC 1996., 494341, Association for Computing Machinery, Inc., pp. 460-466, 1996 European Conference on Design and Test, EDTC 1996, Paris, France, 11/03/96. https://doi.org/10.1109/EDTC.1996.494341

Recursive bipartitioning of signal flow graphs for programmable video signal processors. / Aarts, E.H.L.; Essink, G.; Kock, de, E.L.
Proceedings of the 1996 European Conference on Design and Test, EDTC 1996. Association for Computing Machinery, Inc., 1996. p. 460-466 494341.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Recursive bipartitioning of signal flow graphs for programmable video signal processors

AU - Aarts, E.H.L.

AU - Essink, G.

AU - Kock, de, E.L.

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

KW - Graph partitioning

KW - Local search

KW - Realtime video signal processing

UR - http://www.scopus.com/inward/record.url?scp=85030126815&partnerID=8YFLogxK

U2 - 10.1109/EDTC.1996.494341

DO - 10.1109/EDTC.1996.494341

M3 - Conference contribution

SP - 460

EP - 466

BT - Proceedings of the 1996 European Conference on Design and Test, EDTC 1996

PB - Association for Computing Machinery, Inc.

T2 - 1996 European Conference on Design and Test, EDTC 1996

Y2 - 11 March 1996 through 14 March 1996

ER -

Recursive bipartitioning of signal flow graphs for programmable video signal processors

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this