Template Generation - A Graph Profiling Algorithm

Share/Save/Bookmark

Guo, Y. and Smit, G.J.M. (2003) Template Generation - A Graph Profiling Algorithm. In: 4th PROGRESS Symposium on Embedded Systems, 22 Oct 2003, Nieuwegein, The Netherlands (pp. pp. 96-101).

open access
[img]
Preview
PDF
358kB
Abstract:The availability of high-level design entry tooling is crucial for the viability of any reconfigurable SoC architecture. This paper presents a template generation algorithm. The objective of template generation step is to extract functional equivalent structures, i.e. templates, from a control data flow graph. By profiling 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. A new type of graph (hydragraph) that can cope with multiple outputs is introduced. The generated templates pepresented by the hydragraph are not limited in shapes, i.e., we can find templates with multiple outputs or multiple sinks.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/66352
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page