Template Generation and Selection Algorithms


Share/Save/Bookmark

Guo, Yuanqing and Smit, Gerard J.M. and Broersma, Hajo and Heysters, Paul M. (2003) Template Generation and Selection Algorithms. In: 3rd IEEE International Workshop on System-on-Chip for Real-Time Applications, IWSOC 2003, 30 June - 2 July 2003, Calgary, Alberta, Canada (pp. pp. 2-5).

[img] PDF
Restricted to UT campus only
: Request a copy
311kB
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 method 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.
Item Type:Conference or Workshop Item
Copyright:© 2003 IEEE
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/46374
Official URL:http://dx.doi.org/10.1109/IWSOC.2003.1212995
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 214812