A Graph Covering Algorithm for a Coarse Grain Reconfigurable System

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

18 Downloads (Pure)

Abstract

The availability of high-level design entry tooling is crucial for the viability of any reconfigurable SoC architecture. This paper presents a graph covering algorithm. The graph covering is done in two steps: template generation and template selection. The objective of template generation step is to extract functional equivalent structures, i.e. templates, from a control data flow graph. By inspecting the graph, the algorithm generates all the possible templates and the corresponding matches. Using unique serial numbers and circle numbers, the algorithm can find all distinct templates with multiple outputs. The template selection algorithm shows how this information can be used in compilers for reconfigurable systems. The objective of the template selection algorithm is to find an efficient cover for an application graph with a minimal number of distinct templates and minimal number of matches.
Original languageUndefined
Title of host publicationProceedings of LCTES 2003
Place of PublicationNew York
PublisherAssociation for Computing Machinery (ACM)
Pages199-208
Number of pages10
ISBN (Print)1-58113-647-1
DOIs
Publication statusPublished - Jun 2003

Publication series

Name
PublisherACM

Keywords

  • CAES-EEA: Efficient Embedded Architectures
  • IR-46372
  • EWI-1512
  • METIS-214809

Cite this

Guo, Y., Smit, G. J. M., Heysters, P. M., & Broersma, H. J. (2003). A Graph Covering Algorithm for a Coarse Grain Reconfigurable System. In Proceedings of LCTES 2003 (pp. 199-208). New York: Association for Computing Machinery (ACM). https://doi.org/10.1145/780732.780760
Guo, Y. ; Smit, Gerardus Johannes Maria ; Heysters, P.M. ; Broersma, Haitze J. / A Graph Covering Algorithm for a Coarse Grain Reconfigurable System. Proceedings of LCTES 2003. New York : Association for Computing Machinery (ACM), 2003. pp. 199-208
@inproceedings{93442af1daf34fba921382de64a2a5c8,
title = "A Graph Covering Algorithm for a Coarse Grain Reconfigurable System",
abstract = "The availability of high-level design entry tooling is crucial for the viability of any reconfigurable SoC architecture. This paper presents a graph covering algorithm. The graph covering is done in two steps: template generation and template selection. The objective of template generation step is to extract functional equivalent structures, i.e. templates, from a control data flow graph. By inspecting the graph, the algorithm generates all the possible templates and the corresponding matches. Using unique serial numbers and circle numbers, the algorithm can find all distinct templates with multiple outputs. The template selection algorithm shows how this information can be used in compilers for reconfigurable systems. The objective of the template selection algorithm is to find an efficient cover for an application graph with a minimal number of distinct templates and minimal number of matches.",
keywords = "CAES-EEA: Efficient Embedded Architectures, IR-46372, EWI-1512, METIS-214809",
author = "Y. Guo and Smit, {Gerardus Johannes Maria} and P.M. Heysters and Broersma, {Haitze J.}",
note = "Imported from CHAMELEON.xml",
year = "2003",
month = "6",
doi = "10.1145/780732.780760",
language = "Undefined",
isbn = "1-58113-647-1",
publisher = "Association for Computing Machinery (ACM)",
pages = "199--208",
booktitle = "Proceedings of LCTES 2003",
address = "United States",

}

Guo, Y, Smit, GJM, Heysters, PM & Broersma, HJ 2003, A Graph Covering Algorithm for a Coarse Grain Reconfigurable System. in Proceedings of LCTES 2003. Association for Computing Machinery (ACM), New York, pp. 199-208. https://doi.org/10.1145/780732.780760

A Graph Covering Algorithm for a Coarse Grain Reconfigurable System. / Guo, Y.; Smit, Gerardus Johannes Maria; Heysters, P.M.; Broersma, Haitze J.

Proceedings of LCTES 2003. New York : Association for Computing Machinery (ACM), 2003. p. 199-208.

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

TY - GEN

T1 - A Graph Covering Algorithm for a Coarse Grain Reconfigurable System

AU - Guo, Y.

AU - Smit, Gerardus Johannes Maria

AU - Heysters, P.M.

AU - Broersma, Haitze J.

N1 - Imported from CHAMELEON.xml

PY - 2003/6

Y1 - 2003/6

N2 - The availability of high-level design entry tooling is crucial for the viability of any reconfigurable SoC architecture. This paper presents a graph covering algorithm. The graph covering is done in two steps: template generation and template selection. The objective of template generation step is to extract functional equivalent structures, i.e. templates, from a control data flow graph. By inspecting the graph, the algorithm generates all the possible templates and the corresponding matches. Using unique serial numbers and circle numbers, the algorithm can find all distinct templates with multiple outputs. The template selection algorithm shows how this information can be used in compilers for reconfigurable systems. The objective of the template selection algorithm is to find an efficient cover for an application graph with a minimal number of distinct templates and minimal number of matches.

AB - The availability of high-level design entry tooling is crucial for the viability of any reconfigurable SoC architecture. This paper presents a graph covering algorithm. The graph covering is done in two steps: template generation and template selection. The objective of template generation step is to extract functional equivalent structures, i.e. templates, from a control data flow graph. By inspecting the graph, the algorithm generates all the possible templates and the corresponding matches. Using unique serial numbers and circle numbers, the algorithm can find all distinct templates with multiple outputs. The template selection algorithm shows how this information can be used in compilers for reconfigurable systems. The objective of the template selection algorithm is to find an efficient cover for an application graph with a minimal number of distinct templates and minimal number of matches.

KW - CAES-EEA: Efficient Embedded Architectures

KW - IR-46372

KW - EWI-1512

KW - METIS-214809

U2 - 10.1145/780732.780760

DO - 10.1145/780732.780760

M3 - Conference contribution

SN - 1-58113-647-1

SP - 199

EP - 208

BT - Proceedings of LCTES 2003

PB - Association for Computing Machinery (ACM)

CY - New York

ER -

Guo Y, Smit GJM, Heysters PM, Broersma HJ. A Graph Covering Algorithm for a Coarse Grain Reconfigurable System. In Proceedings of LCTES 2003. New York: Association for Computing Machinery (ACM). 2003. p. 199-208 https://doi.org/10.1145/780732.780760