@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 = jun,

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

}